{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AW4UAQP3JLWDIMEZLIIEWB4R2M","short_pith_number":"pith:AW4UAQP3","schema_version":"1.0","canonical_sha256":"05b94041fb4aec3430995a104b0791d320e3a2a4be6ca9eda152bd31837afa6b","source":{"kind":"arxiv","id":"1105.2690","version":2},"attestation_state":"computed","paper":{"title":"Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Frank Werner, Thorsten Hohage","submitted_at":"2011-05-13T11:20:11Z","abstract_excerpt":"We study Newton type methods for inverse problems described by nonlinear operator equations $F(u)=g$ in Banach spaces where the Newton equations $F'(u_n;u_{n+1}-u_n) = g-F(u_n)$ are regularized variationally using a general data misfit functional and a convex regularization term. This generalizes the well-known iteratively regularized Gauss-Newton method (IRGNM). We prove convergence and convergence rates as the noise level tends to 0 both for an a priori stopping rule and for a Lepski{\\u\\i}-type a posteriori stopping rule. Our analysis includes previous order optimal convergence rate results "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1105.2690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-05-13T11:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"ca7752a168d1ec11d6c608d8b34c084def3a7219990c2c32dd29f40b277bffee","abstract_canon_sha256":"70e70e7fa4281eb30df1fbc88a74fa96b4377c0679ea51546a4c248d7b732105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:00.713105Z","signature_b64":"qkwEJqsv6Ii9Um2pOf/vEGwPgtcIfU+azY/rWsnHt7GfuFNo8vZeJhWDmytEEu3bpzIgSPTUbCefXkUSkVKAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05b94041fb4aec3430995a104b0791d320e3a2a4be6ca9eda152bd31837afa6b","last_reissued_at":"2026-05-18T02:20:00.712442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:00.712442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Frank Werner, Thorsten Hohage","submitted_at":"2011-05-13T11:20:11Z","abstract_excerpt":"We study Newton type methods for inverse problems described by nonlinear operator equations $F(u)=g$ in Banach spaces where the Newton equations $F'(u_n;u_{n+1}-u_n) = g-F(u_n)$ are regularized variationally using a general data misfit functional and a convex regularization term. This generalizes the well-known iteratively regularized Gauss-Newton method (IRGNM). We prove convergence and convergence rates as the noise level tends to 0 both for an a priori stopping rule and for a Lepski{\\u\\i}-type a posteriori stopping rule. Our analysis includes previous order optimal convergence rate results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2690","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.2690","created_at":"2026-05-18T02:20:00.712542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2690v2","created_at":"2026-05-18T02:20:00.712542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2690","created_at":"2026-05-18T02:20:00.712542+00:00"},{"alias_kind":"pith_short_12","alias_value":"AW4UAQP3JLWD","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AW4UAQP3JLWDIMEZ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AW4UAQP3","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M","json":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M.json","graph_json":"https://pith.science/api/pith-number/AW4UAQP3JLWDIMEZLIIEWB4R2M/graph.json","events_json":"https://pith.science/api/pith-number/AW4UAQP3JLWDIMEZLIIEWB4R2M/events.json","paper":"https://pith.science/paper/AW4UAQP3"},"agent_actions":{"view_html":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M","download_json":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M.json","view_paper":"https://pith.science/paper/AW4UAQP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2690&json=true","fetch_graph":"https://pith.science/api/pith-number/AW4UAQP3JLWDIMEZLIIEWB4R2M/graph.json","fetch_events":"https://pith.science/api/pith-number/AW4UAQP3JLWDIMEZLIIEWB4R2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M/action/storage_attestation","attest_author":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M/action/author_attestation","sign_citation":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M/action/citation_signature","submit_replication":"https://pith.science/pith/AW4UAQP3JLWDIMEZLIIEWB4R2M/action/replication_record"}},"created_at":"2026-05-18T02:20:00.712542+00:00","updated_at":"2026-05-18T02:20:00.712542+00:00"}