{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AIJPLB5LJWZAVQ23V6CXXGVTQ4","short_pith_number":"pith:AIJPLB5L","schema_version":"1.0","canonical_sha256":"0212f587ab4db20ac35baf857b9ab3872c4497ac940843248be83797ed58416f","source":{"kind":"arxiv","id":"1603.07870","version":2},"attestation_state":"computed","paper":{"title":"A Regularized Semi-Smooth Newton Method With Projection Steps for Composite Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liwei Zhang, Xiantao Xiao, Yongfeng Li, Zaiwen Wen","submitted_at":"2016-03-25T10:40:19Z","abstract_excerpt":"The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as forward-backward splitting (FBS) and Douglas-Rachford splitting (DRS), actually define a fixed-point mapping; ii) The optimal solutions of the composite convex program and the solutions of a system of nonlinear equations derived from the fixed-point mapping are equivalent. Solving this kind of system of nonlinear equations enables us to develop second-order type methods. "},"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":"1603.07870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-25T10:40:19Z","cross_cats_sorted":[],"title_canon_sha256":"f5015a126fedc2389c8851eef2e6d6649f4f50841e4222c35fa8897bf811ae95","abstract_canon_sha256":"14548d3857a6b3fb12c5d6ce2d74b648d362e9cd491d24bfe84168aa002fcc17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:59.273228Z","signature_b64":"A48EQATQkomEYfrFpRWWd8HUg6WBKVwNFLj452kdsstc7z2T5dr8s0xMs8PHaYt9tztgE6/3O+cz5bC3el2FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0212f587ab4db20ac35baf857b9ab3872c4497ac940843248be83797ed58416f","last_reissued_at":"2026-05-18T01:03:59.272548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:59.272548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Regularized Semi-Smooth Newton Method With Projection Steps for Composite Convex Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liwei Zhang, Xiantao Xiao, Yongfeng Li, Zaiwen Wen","submitted_at":"2016-03-25T10:40:19Z","abstract_excerpt":"The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as forward-backward splitting (FBS) and Douglas-Rachford splitting (DRS), actually define a fixed-point mapping; ii) The optimal solutions of the composite convex program and the solutions of a system of nonlinear equations derived from the fixed-point mapping are equivalent. Solving this kind of system of nonlinear equations enables us to develop second-order type methods. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07870","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":"1603.07870","created_at":"2026-05-18T01:03:59.272663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07870v2","created_at":"2026-05-18T01:03:59.272663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07870","created_at":"2026-05-18T01:03:59.272663+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIJPLB5LJWZA","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIJPLB5LJWZAVQ23","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIJPLB5L","created_at":"2026-05-18T12:30:07.202191+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/AIJPLB5LJWZAVQ23V6CXXGVTQ4","json":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4.json","graph_json":"https://pith.science/api/pith-number/AIJPLB5LJWZAVQ23V6CXXGVTQ4/graph.json","events_json":"https://pith.science/api/pith-number/AIJPLB5LJWZAVQ23V6CXXGVTQ4/events.json","paper":"https://pith.science/paper/AIJPLB5L"},"agent_actions":{"view_html":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4","download_json":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4.json","view_paper":"https://pith.science/paper/AIJPLB5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07870&json=true","fetch_graph":"https://pith.science/api/pith-number/AIJPLB5LJWZAVQ23V6CXXGVTQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/AIJPLB5LJWZAVQ23V6CXXGVTQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4/action/storage_attestation","attest_author":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4/action/author_attestation","sign_citation":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4/action/citation_signature","submit_replication":"https://pith.science/pith/AIJPLB5LJWZAVQ23V6CXXGVTQ4/action/replication_record"}},"created_at":"2026-05-18T01:03:59.272663+00:00","updated_at":"2026-05-18T01:03:59.272663+00:00"}