{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SPVQSZNJWTM5RDKG6BLZPXUBF2","short_pith_number":"pith:SPVQSZNJ","schema_version":"1.0","canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","source":{"kind":"arxiv","id":"2303.01722","version":4},"attestation_state":"computed","paper":{"title":"Solving Low-Rank Semidefinite Programs via Manifold Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Wang, Liangbing Hu","submitted_at":"2023-03-03T05:59:39Z","abstract_excerpt":"We propose a manifold optimization approach to solve linear semidefinite programs (SDP) with low-rank solutions, with an emphasis on SDP relaxations for polynomial optimization problems. This approach incorporates the inexact augmented Lagrangian method (ALM) and the Burer-Monteiro factorization, and features the self-adaptive strategies for updating the factorization size and the penalty parameter. We establish global convergence of the inexact ALM, despite the non-convexity brought by the Burer-Monteiro factorization. We further provide a practical algorithm building on the inexact ALM, and "},"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":"2303.01722","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"4e9d42f4391ec5da8401f2d20a6074ed20156f833cd7591e3c0baefa94d17059","abstract_canon_sha256":"78015e11c34766270cde7ff8332f7683b4bd900266658f16399ff76be962da01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:16.034771Z","signature_b64":"6p/PBiD453bbdk534B7KuFZbmhpn3yq4y6cYEIBqhCbL2xd8zdiaDBMs/eEAQMgP6Hu1S0pnngpKr3rz4jIvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","last_reissued_at":"2026-07-05T10:55:16.034296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:16.034296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Low-Rank Semidefinite Programs via Manifold Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Wang, Liangbing Hu","submitted_at":"2023-03-03T05:59:39Z","abstract_excerpt":"We propose a manifold optimization approach to solve linear semidefinite programs (SDP) with low-rank solutions, with an emphasis on SDP relaxations for polynomial optimization problems. This approach incorporates the inexact augmented Lagrangian method (ALM) and the Burer-Monteiro factorization, and features the self-adaptive strategies for updating the factorization size and the penalty parameter. We establish global convergence of the inexact ALM, despite the non-convexity brought by the Burer-Monteiro factorization. We further provide a practical algorithm building on the inexact ALM, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01722","kind":"arxiv","version":4},"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/2303.01722/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":"2303.01722","created_at":"2026-07-05T10:55:16.034362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01722v4","created_at":"2026-07-05T10:55:16.034362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01722","created_at":"2026-07-05T10:55:16.034362+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPVQSZNJWTM5","created_at":"2026-07-05T10:55:16.034362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPVQSZNJWTM5RDKG","created_at":"2026-07-05T10:55:16.034362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPVQSZNJ","created_at":"2026-07-05T10:55:16.034362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10579","citing_title":"LieIPM: Lie Group Interior Point Method for Direct Trajectory Optimization of Rigid Bodies","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2503.20142","citing_title":"Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2","json":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2.json","graph_json":"https://pith.science/api/pith-number/SPVQSZNJWTM5RDKG6BLZPXUBF2/graph.json","events_json":"https://pith.science/api/pith-number/SPVQSZNJWTM5RDKG6BLZPXUBF2/events.json","paper":"https://pith.science/paper/SPVQSZNJ"},"agent_actions":{"view_html":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2","download_json":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2.json","view_paper":"https://pith.science/paper/SPVQSZNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01722&json=true","fetch_graph":"https://pith.science/api/pith-number/SPVQSZNJWTM5RDKG6BLZPXUBF2/graph.json","fetch_events":"https://pith.science/api/pith-number/SPVQSZNJWTM5RDKG6BLZPXUBF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/action/storage_attestation","attest_author":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/action/author_attestation","sign_citation":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/action/citation_signature","submit_replication":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/action/replication_record"}},"created_at":"2026-07-05T10:55:16.034362+00:00","updated_at":"2026-07-05T10:55:16.034362+00:00"}