{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4AUETMRGYDVVRXG4KA3VGY3BFD","short_pith_number":"pith:4AUETMRG","schema_version":"1.0","canonical_sha256":"e02849b226c0eb58dcdc503753636128dccafd069138684b32ddd9bc91af7b55","source":{"kind":"arxiv","id":"1403.3522","version":2},"attestation_state":"computed","paper":{"title":"An inertial forward-backward algorithm for monotone inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Dirk A. Lorenz, Thomas Pock","submitted_at":"2014-03-14T10:30:47Z","abstract_excerpt":"In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that "},"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":"1403.3522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-03-14T10:30:47Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"a803e84254b5d68d51d7c90ddb6c7ad38bd4dbda852fd56444382839b427796b","abstract_canon_sha256":"797b057c8a994a42b8ef0b4efe4cf45597175b25f691e8af00401c265fbdb469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:00.558887Z","signature_b64":"5szXvs2xwQOwV/9LBCJY3Rc1guHZe+CdkV0jJGeMgvxH2Dvayv9pzDzSlR5nVdqJSEQPFojEdQa93hOezvwJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02849b226c0eb58dcdc503753636128dccafd069138684b32ddd9bc91af7b55","last_reissued_at":"2026-05-18T02:43:00.558185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:00.558185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An inertial forward-backward algorithm for monotone inclusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.CV","authors_text":"Dirk A. Lorenz, Thomas Pock","submitted_at":"2014-03-14T10:30:47Z","abstract_excerpt":"In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3522","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":"1403.3522","created_at":"2026-05-18T02:43:00.558290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3522v2","created_at":"2026-05-18T02:43:00.558290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3522","created_at":"2026-05-18T02:43:00.558290+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AUETMRGYDVV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AUETMRGYDVVRXG4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AUETMRG","created_at":"2026-05-18T12:28:14.216126+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/4AUETMRGYDVVRXG4KA3VGY3BFD","json":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD.json","graph_json":"https://pith.science/api/pith-number/4AUETMRGYDVVRXG4KA3VGY3BFD/graph.json","events_json":"https://pith.science/api/pith-number/4AUETMRGYDVVRXG4KA3VGY3BFD/events.json","paper":"https://pith.science/paper/4AUETMRG"},"agent_actions":{"view_html":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD","download_json":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD.json","view_paper":"https://pith.science/paper/4AUETMRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3522&json=true","fetch_graph":"https://pith.science/api/pith-number/4AUETMRGYDVVRXG4KA3VGY3BFD/graph.json","fetch_events":"https://pith.science/api/pith-number/4AUETMRGYDVVRXG4KA3VGY3BFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD/action/storage_attestation","attest_author":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD/action/author_attestation","sign_citation":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD/action/citation_signature","submit_replication":"https://pith.science/pith/4AUETMRGYDVVRXG4KA3VGY3BFD/action/replication_record"}},"created_at":"2026-05-18T02:43:00.558290+00:00","updated_at":"2026-05-18T02:43:00.558290+00:00"}