{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A5W44WRQ6IJ6LEDJOQPMMFIOB5","short_pith_number":"pith:A5W44WRQ","schema_version":"1.0","canonical_sha256":"076dce5a30f213e59069741ec6150e0f6232e2421edb5c75ac82a178617b08d5","source":{"kind":"arxiv","id":"1604.00543","version":1},"attestation_state":"computed","paper":{"title":"Decomposing Linearly Constrained Nonconvex Problems by a Proximal Primal Dual Approach: Algorithms, Convergence, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mingyi Hong","submitted_at":"2016-04-02T18:28:33Z","abstract_excerpt":"In this paper, we propose a new decomposition approach named the proximal primal dual algorithm (Prox-PDA) for smooth nonconvex linearly constrained optimization problems. The proposed approach is primal-dual based, where the primal step minimizes certain approximation of the augmented Lagrangian of the problem, and the dual step performs an approximate dual ascent. The approximation used in the primal step is able to decompose the variable blocks, making it possible to obtain simple subproblems by leveraging the problem structures. Theoretically, we show that whenever the penalty parameter 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":"1604.00543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-02T18:28:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"033ee592303987cb3608f4c3927f58e0dc85abaa969a35a11f7a13d174e667ed","abstract_canon_sha256":"7bb4c46ea302f037575fee7df5e7933f26d216db43a18a91de8de286bad11aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:49.275798Z","signature_b64":"x7xtb8bZ8WVz7xXzAMP/6A8u0GxPQ/HMken+R4nx+zySkZGUEy9rK2FrDCt0omYGq4o7nOpl8OMiURcdNaSKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076dce5a30f213e59069741ec6150e0f6232e2421edb5c75ac82a178617b08d5","last_reissued_at":"2026-05-18T01:17:49.275071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:49.275071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing Linearly Constrained Nonconvex Problems by a Proximal Primal Dual Approach: Algorithms, Convergence, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mingyi Hong","submitted_at":"2016-04-02T18:28:33Z","abstract_excerpt":"In this paper, we propose a new decomposition approach named the proximal primal dual algorithm (Prox-PDA) for smooth nonconvex linearly constrained optimization problems. The proposed approach is primal-dual based, where the primal step minimizes certain approximation of the augmented Lagrangian of the problem, and the dual step performs an approximate dual ascent. The approximation used in the primal step is able to decompose the variable blocks, making it possible to obtain simple subproblems by leveraging the problem structures. Theoretically, we show that whenever the penalty parameter in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00543","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":"1604.00543","created_at":"2026-05-18T01:17:49.275193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00543v1","created_at":"2026-05-18T01:17:49.275193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00543","created_at":"2026-05-18T01:17:49.275193+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5W44WRQ6IJ6","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5W44WRQ6IJ6LEDJ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5W44WRQ","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13272","citing_title":"A Momentum-based Stochastic Algorithm for Linearly Constrained Nonconvex Optimization","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5","json":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5.json","graph_json":"https://pith.science/api/pith-number/A5W44WRQ6IJ6LEDJOQPMMFIOB5/graph.json","events_json":"https://pith.science/api/pith-number/A5W44WRQ6IJ6LEDJOQPMMFIOB5/events.json","paper":"https://pith.science/paper/A5W44WRQ"},"agent_actions":{"view_html":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5","download_json":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5.json","view_paper":"https://pith.science/paper/A5W44WRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00543&json=true","fetch_graph":"https://pith.science/api/pith-number/A5W44WRQ6IJ6LEDJOQPMMFIOB5/graph.json","fetch_events":"https://pith.science/api/pith-number/A5W44WRQ6IJ6LEDJOQPMMFIOB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5/action/storage_attestation","attest_author":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5/action/author_attestation","sign_citation":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5/action/citation_signature","submit_replication":"https://pith.science/pith/A5W44WRQ6IJ6LEDJOQPMMFIOB5/action/replication_record"}},"created_at":"2026-05-18T01:17:49.275193+00:00","updated_at":"2026-05-18T01:17:49.275193+00:00"}