{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EG3I6HUR2VLPPY5O3XMMDLIQU5","short_pith_number":"pith:EG3I6HUR","schema_version":"1.0","canonical_sha256":"21b68f1e91d556f7e3aeddd8c1ad10a75aa9c0420384f20690309d0df611cf84","source":{"kind":"arxiv","id":"1505.04278","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liuqin Yang","submitted_at":"2015-05-16T14:31:39Z","abstract_excerpt":"We consider least squares semidefinite programming (LSSDP) where the primal matrix variable must satisfy given linear equality and inequality constraints, and must also lie in the intersection of the cone of symmetric positive semidefinite matrices and a simple polyhedral set. We propose an inexact accelerated block coordinate descent (ABCD) method for solving LSSDP via its dual, which can be reformulated as a convex composite minimization problem whose objective is the sum of a coupled quadratic function involving four blocks of variables and two separable non-smooth functions involving only "},"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":"1505.04278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-16T14:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"013f29dea15704b4861a6bf5bc777caccc51d315423651859a03b79332bc8a91","abstract_canon_sha256":"ceadf340c3fe229db74ee3bf9d55b36655222d361b3016113f0fa6fd2ecf1554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.948520Z","signature_b64":"b0sS6Q3RsBCXJMD5PTQLh6IvDI//8PGHNZp5pJbCG0OzlgBKdD2cbR6i9QF4090sPmGgjOaaW45Lb5aEZyjrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b68f1e91d556f7e3aeddd8c1ad10a75aa9c0420384f20690309d0df611cf84","last_reissued_at":"2026-05-18T02:03:44.947670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.947670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liuqin Yang","submitted_at":"2015-05-16T14:31:39Z","abstract_excerpt":"We consider least squares semidefinite programming (LSSDP) where the primal matrix variable must satisfy given linear equality and inequality constraints, and must also lie in the intersection of the cone of symmetric positive semidefinite matrices and a simple polyhedral set. We propose an inexact accelerated block coordinate descent (ABCD) method for solving LSSDP via its dual, which can be reformulated as a convex composite minimization problem whose objective is the sum of a coupled quadratic function involving four blocks of variables and two separable non-smooth functions involving only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04278","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":"1505.04278","created_at":"2026-05-18T02:03:44.947776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04278v2","created_at":"2026-05-18T02:03:44.947776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04278","created_at":"2026-05-18T02:03:44.947776+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG3I6HUR2VLP","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG3I6HUR2VLPPY5O","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG3I6HUR","created_at":"2026-05-18T12:29:19.899920+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/EG3I6HUR2VLPPY5O3XMMDLIQU5","json":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5.json","graph_json":"https://pith.science/api/pith-number/EG3I6HUR2VLPPY5O3XMMDLIQU5/graph.json","events_json":"https://pith.science/api/pith-number/EG3I6HUR2VLPPY5O3XMMDLIQU5/events.json","paper":"https://pith.science/paper/EG3I6HUR"},"agent_actions":{"view_html":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5","download_json":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5.json","view_paper":"https://pith.science/paper/EG3I6HUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04278&json=true","fetch_graph":"https://pith.science/api/pith-number/EG3I6HUR2VLPPY5O3XMMDLIQU5/graph.json","fetch_events":"https://pith.science/api/pith-number/EG3I6HUR2VLPPY5O3XMMDLIQU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5/action/storage_attestation","attest_author":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5/action/author_attestation","sign_citation":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5/action/citation_signature","submit_replication":"https://pith.science/pith/EG3I6HUR2VLPPY5O3XMMDLIQU5/action/replication_record"}},"created_at":"2026-05-18T02:03:44.947776+00:00","updated_at":"2026-05-18T02:03:44.947776+00:00"}