{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MDYF3RBHOWIOVV2PSPTHSSIKZD","short_pith_number":"pith:MDYF3RBH","schema_version":"1.0","canonical_sha256":"60f05dc4277590ead74f93e679490ac8ea1032f835ff1a91aa2e21a63ad30f4c","source":{"kind":"arxiv","id":"1506.00741","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Inexact Symmetric Gauss-Seidel Based Majorized ADMM for High-Dimensional Convex Composite Conic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen","submitted_at":"2015-06-02T03:35:34Z","abstract_excerpt":"In this paper, we propose an inexact multi-block ADMM-type first-order method for solving a class of high-dimensional convex composite conic optimization problems to moderate accuracy. The design of this method combines an inexact 2-block majorized semi-proximal ADMM and the recent advances in the inexact symmetric Gauss-Seidel (sGS) technique for solving a multi-block convex composite quadratic programming whose objective contains a nonsmooth term involving only the first block-variable. One distinctive feature of our proposed method (the sGS-imsPADMM) is that it only needs one cycle of an in"},"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":"1506.00741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-02T03:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"a171e8ba999c7598b546ca32c1ea3f60bf5e8f029213ff42954f4f005c9a11af","abstract_canon_sha256":"2e2adf769f4c96f6ecf825b937fecba94b8892fb46a978d69419bc28574c6391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:20.082298Z","signature_b64":"ghJjuiHeGOSRU5RBt7Eje0uA1BQsrPaH4SAHhg2E3w0ok2gbor6jqYCNibxGKPujd337jAXcDVet9VerwwO1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f05dc4277590ead74f93e679490ac8ea1032f835ff1a91aa2e21a63ad30f4c","last_reissued_at":"2026-07-05T01:08:20.081895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:20.081895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Inexact Symmetric Gauss-Seidel Based Majorized ADMM for High-Dimensional Convex Composite Conic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen","submitted_at":"2015-06-02T03:35:34Z","abstract_excerpt":"In this paper, we propose an inexact multi-block ADMM-type first-order method for solving a class of high-dimensional convex composite conic optimization problems to moderate accuracy. The design of this method combines an inexact 2-block majorized semi-proximal ADMM and the recent advances in the inexact symmetric Gauss-Seidel (sGS) technique for solving a multi-block convex composite quadratic programming whose objective contains a nonsmooth term involving only the first block-variable. One distinctive feature of our proposed method (the sGS-imsPADMM) is that it only needs one cycle of an in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1506.00741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1506.00741","created_at":"2026-07-05T01:08:20.081951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00741v2","created_at":"2026-07-05T01:08:20.081951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00741","created_at":"2026-07-05T01:08:20.081951+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDYF3RBHOWIO","created_at":"2026-07-05T01:08:20.081951+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDYF3RBHOWIOVV2P","created_at":"2026-07-05T01:08:20.081951+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDYF3RBH","created_at":"2026-07-05T01:08:20.081951+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/MDYF3RBHOWIOVV2PSPTHSSIKZD","json":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD.json","graph_json":"https://pith.science/api/pith-number/MDYF3RBHOWIOVV2PSPTHSSIKZD/graph.json","events_json":"https://pith.science/api/pith-number/MDYF3RBHOWIOVV2PSPTHSSIKZD/events.json","paper":"https://pith.science/paper/MDYF3RBH"},"agent_actions":{"view_html":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD","download_json":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD.json","view_paper":"https://pith.science/paper/MDYF3RBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00741&json=true","fetch_graph":"https://pith.science/api/pith-number/MDYF3RBHOWIOVV2PSPTHSSIKZD/graph.json","fetch_events":"https://pith.science/api/pith-number/MDYF3RBHOWIOVV2PSPTHSSIKZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD/action/storage_attestation","attest_author":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD/action/author_attestation","sign_citation":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD/action/citation_signature","submit_replication":"https://pith.science/pith/MDYF3RBHOWIOVV2PSPTHSSIKZD/action/replication_record"}},"created_at":"2026-07-05T01:08:20.081951+00:00","updated_at":"2026-07-05T01:08:20.081951+00:00"}