{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RIJLZ5JYALYSKXBNY2HTPW6OPP","short_pith_number":"pith:RIJLZ5JY","schema_version":"1.0","canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","source":{"kind":"arxiv","id":"1905.04537","version":1},"attestation_state":"computed","paper":{"title":"On the optimal linear convergence factor of the relaxed proximal point algorithm for monotone inclusion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoyong Gu, Junfeng Yang","submitted_at":"2019-05-11T15:11:34Z","abstract_excerpt":"Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \\emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under fairly mild conditions but also asymptotically at a fast linear rate provided that the underlying inverse operator is Lipschitz continuous at the origin. These nice convergence properties are preserved by a relaxed variant of PPA. Recently, a linear convergence bound was established in [M. Tao, and X. M. Yuan, J. Sci. Comput., 74 (2018), pp. 826-850] for the"},"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":"1905.04537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"689539dd0443f70c51e27cfae86fcdf8c9e87588f399691ce058b9186fbd3244","abstract_canon_sha256":"41a78d8942c12ef6e0ca1f56349171d30f971edefb897b1e78e0fc683e0c6428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.484177Z","signature_b64":"y2OB2gWi3LSNUJ/bibHbbkeaR1GwozH67chjeh5I2yZUykfZT73UNBtk3VqJ7LgAAape/qfSqpP5OZvBZzhVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","last_reissued_at":"2026-05-17T23:46:24.483475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.483475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimal linear convergence factor of the relaxed proximal point algorithm for monotone inclusion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoyong Gu, Junfeng Yang","submitted_at":"2019-05-11T15:11:34Z","abstract_excerpt":"Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \\emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under fairly mild conditions but also asymptotically at a fast linear rate provided that the underlying inverse operator is Lipschitz continuous at the origin. These nice convergence properties are preserved by a relaxed variant of PPA. Recently, a linear convergence bound was established in [M. Tao, and X. M. Yuan, J. Sci. Comput., 74 (2018), pp. 826-850] for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04537","kind":"arxiv","version":1},"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":"1905.04537","created_at":"2026-05-17T23:46:24.483602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04537v1","created_at":"2026-05-17T23:46:24.483602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04537","created_at":"2026-05-17T23:46:24.483602+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIJLZ5JYALYS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIJLZ5JYALYSKXBN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIJLZ5JY","created_at":"2026-05-18T12:33:27.125529+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/RIJLZ5JYALYSKXBNY2HTPW6OPP","json":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP.json","graph_json":"https://pith.science/api/pith-number/RIJLZ5JYALYSKXBNY2HTPW6OPP/graph.json","events_json":"https://pith.science/api/pith-number/RIJLZ5JYALYSKXBNY2HTPW6OPP/events.json","paper":"https://pith.science/paper/RIJLZ5JY"},"agent_actions":{"view_html":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP","download_json":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP.json","view_paper":"https://pith.science/paper/RIJLZ5JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04537&json=true","fetch_graph":"https://pith.science/api/pith-number/RIJLZ5JYALYSKXBNY2HTPW6OPP/graph.json","fetch_events":"https://pith.science/api/pith-number/RIJLZ5JYALYSKXBNY2HTPW6OPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/action/storage_attestation","attest_author":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/action/author_attestation","sign_citation":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/action/citation_signature","submit_replication":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/action/replication_record"}},"created_at":"2026-05-17T23:46:24.483602+00:00","updated_at":"2026-05-17T23:46:24.483602+00:00"}