{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SDHMSVHT3PFC6ZZWVXGFWKP33Z","short_pith_number":"pith:SDHMSVHT","schema_version":"1.0","canonical_sha256":"90cec954f3dbca2f6736adcc5b29fbde7f294169eb5e3366498c57d7ec565837","source":{"kind":"arxiv","id":"1407.0753","version":6},"attestation_state":"computed","paper":{"title":"Global convergence of splitting methods for nonconvex composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Guoyin Li, Ting Kei Pong","submitted_at":"2014-07-03T00:29:25Z","abstract_excerpt":"We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\\cal M$, with the proximal mappings of $\\tau P$, $\\tau > 0$, simple to compute. This problem is nonconvex in general and encompasses many important applications in engineering and machine learning. In this paper, we examined two types of splitting methods for solving this nonconvex optimization problem: alternating direction method of multipliers and proximal grad"},"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":"1407.0753","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T00:29:25Z","cross_cats_sorted":["cs.LG","math.NA","stat.ML"],"title_canon_sha256":"335528e230cc3977000421d82b8cfc5f9f21e47d39376a19c1ed646f9cd0b057","abstract_canon_sha256":"b4ea5f5091637a4f5f8bf25728aa0f6c5041ea0f31b16a497c46b4e23d5023a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.339911Z","signature_b64":"sUHQYFR2370FVf44qWVhW8xdC3U9hT1L4gDp9MCAed2DVHE3+2P5K3QEUuu9r0o5IY8sMIE0rTHTV+erdE0zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90cec954f3dbca2f6736adcc5b29fbde7f294169eb5e3366498c57d7ec565837","last_reissued_at":"2026-05-18T01:26:58.339290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.339290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global convergence of splitting methods for nonconvex composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Guoyin Li, Ting Kei Pong","submitted_at":"2014-07-03T00:29:25Z","abstract_excerpt":"We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\\cal M$, with the proximal mappings of $\\tau P$, $\\tau > 0$, simple to compute. This problem is nonconvex in general and encompasses many important applications in engineering and machine learning. In this paper, we examined two types of splitting methods for solving this nonconvex optimization problem: alternating direction method of multipliers and proximal grad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0753","kind":"arxiv","version":6},"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":"1407.0753","created_at":"2026-05-18T01:26:58.339379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0753v6","created_at":"2026-05-18T01:26:58.339379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0753","created_at":"2026-05-18T01:26:58.339379+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDHMSVHT3PFC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDHMSVHT3PFC6ZZW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDHMSVHT","created_at":"2026-05-18T12:28:49.207871+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/SDHMSVHT3PFC6ZZWVXGFWKP33Z","json":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z.json","graph_json":"https://pith.science/api/pith-number/SDHMSVHT3PFC6ZZWVXGFWKP33Z/graph.json","events_json":"https://pith.science/api/pith-number/SDHMSVHT3PFC6ZZWVXGFWKP33Z/events.json","paper":"https://pith.science/paper/SDHMSVHT"},"agent_actions":{"view_html":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z","download_json":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z.json","view_paper":"https://pith.science/paper/SDHMSVHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0753&json=true","fetch_graph":"https://pith.science/api/pith-number/SDHMSVHT3PFC6ZZWVXGFWKP33Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SDHMSVHT3PFC6ZZWVXGFWKP33Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z/action/storage_attestation","attest_author":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z/action/author_attestation","sign_citation":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z/action/citation_signature","submit_replication":"https://pith.science/pith/SDHMSVHT3PFC6ZZWVXGFWKP33Z/action/replication_record"}},"created_at":"2026-05-18T01:26:58.339379+00:00","updated_at":"2026-05-18T01:26:58.339379+00:00"}