{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GOHX727GAJRHLQOL6VMJOTSRQN","short_pith_number":"pith:GOHX727G","schema_version":"1.0","canonical_sha256":"338f7febe6026275c1cbf558974e518373055a07244c0a769108eae134dd0df3","source":{"kind":"arxiv","id":"1903.00184","version":1},"attestation_state":"computed","paper":{"title":"Proximal algorithms for constrained composite optimization, with applications to solving low-rank SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"John Duchi, Song Mei, Yu Bai","submitted_at":"2019-03-01T07:37:55Z","abstract_excerpt":"We study a family of (potentially non-convex) constrained optimization problems with convex composite structure. Through a novel analysis of non-smooth geometry, we show that proximal-type algorithms applied to exact penalty formulations of such problems exhibit local linear convergence under a quadratic growth condition, which the compositional structure we consider ensures. The main application of our results is to low-rank semidefinite optimization with Burer-Monteiro factorizations. We precisely identify the conditions for quadratic growth in the factorized problem via structures in the se"},"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":"1903.00184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-01T07:37:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"299993a8277abbd2fac66149c1a9d6da890c747dcb4dbf952f1cc63a11a3fa47","abstract_canon_sha256":"e52a23d6f48fff39f73185aaf9bcb6b33b77b4b85e0afe3c0ae2ec898c518511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:20.630729Z","signature_b64":"jgA4RBU/52lG1dMh7VqUi/xQJLzGytT2NksJwzf1d7ipJq+3+dSvQDRFVY3sFIRNRNa6oZpevveTb/pkV9YuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"338f7febe6026275c1cbf558974e518373055a07244c0a769108eae134dd0df3","last_reissued_at":"2026-05-17T23:52:20.630124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:20.630124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal algorithms for constrained composite optimization, with applications to solving low-rank SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"John Duchi, Song Mei, Yu Bai","submitted_at":"2019-03-01T07:37:55Z","abstract_excerpt":"We study a family of (potentially non-convex) constrained optimization problems with convex composite structure. Through a novel analysis of non-smooth geometry, we show that proximal-type algorithms applied to exact penalty formulations of such problems exhibit local linear convergence under a quadratic growth condition, which the compositional structure we consider ensures. The main application of our results is to low-rank semidefinite optimization with Burer-Monteiro factorizations. We precisely identify the conditions for quadratic growth in the factorized problem via structures in the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00184","kind":"arxiv","version":1},"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":"1903.00184","created_at":"2026-05-17T23:52:20.630232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00184v1","created_at":"2026-05-17T23:52:20.630232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00184","created_at":"2026-05-17T23:52:20.630232+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOHX727GAJRH","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOHX727GAJRHLQOL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOHX727G","created_at":"2026-05-18T12:33:18.533446+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/GOHX727GAJRHLQOL6VMJOTSRQN","json":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN.json","graph_json":"https://pith.science/api/pith-number/GOHX727GAJRHLQOL6VMJOTSRQN/graph.json","events_json":"https://pith.science/api/pith-number/GOHX727GAJRHLQOL6VMJOTSRQN/events.json","paper":"https://pith.science/paper/GOHX727G"},"agent_actions":{"view_html":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN","download_json":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN.json","view_paper":"https://pith.science/paper/GOHX727G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00184&json=true","fetch_graph":"https://pith.science/api/pith-number/GOHX727GAJRHLQOL6VMJOTSRQN/graph.json","fetch_events":"https://pith.science/api/pith-number/GOHX727GAJRHLQOL6VMJOTSRQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN/action/storage_attestation","attest_author":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN/action/author_attestation","sign_citation":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN/action/citation_signature","submit_replication":"https://pith.science/pith/GOHX727GAJRHLQOL6VMJOTSRQN/action/replication_record"}},"created_at":"2026-05-17T23:52:20.630232+00:00","updated_at":"2026-05-17T23:52:20.630232+00:00"}