{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7EBGVBV47OT5U3SH3LFPFKAOQ3","short_pith_number":"pith:7EBGVBV4","schema_version":"1.0","canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","source":{"kind":"arxiv","id":"1212.6492","version":1},"attestation_state":"computed","paper":{"title":"Canonical Primal-Dual Method for Solving Non-convex Minimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.NA","authors_text":"Changzhi Wu, Chaojie Li, David Yang Gao","submitted_at":"2012-12-28T09:30:57Z","abstract_excerpt":"A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance."},"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":"1212.6492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"0ca530c302d6c1b1d1abee4391f1111ddf0dfc3de516edcfcd4154a028d660ec","abstract_canon_sha256":"bece11814cce09dd24bd5e5c8594223c81dca57f0480b1692702725528f3bc13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.799223Z","signature_b64":"3ahgyF0pZyKbgJSun5GLwFMy1l9eR0LTNPTD1f5QoxIhd14PFhGbBXJdhEDlg/S0SFcY0toDY4kXZB5gDheoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","last_reissued_at":"2026-05-18T03:37:31.798524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.798524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonical Primal-Dual Method for Solving Non-convex Minimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.NA","authors_text":"Changzhi Wu, Chaojie Li, David Yang Gao","submitted_at":"2012-12-28T09:30:57Z","abstract_excerpt":"A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6492","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":"1212.6492","created_at":"2026-05-18T03:37:31.798619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6492v1","created_at":"2026-05-18T03:37:31.798619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6492","created_at":"2026-05-18T03:37:31.798619+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EBGVBV47OT5","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EBGVBV47OT5U3SH","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EBGVBV4","created_at":"2026-05-18T12:26:56.085431+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/7EBGVBV47OT5U3SH3LFPFKAOQ3","json":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3.json","graph_json":"https://pith.science/api/pith-number/7EBGVBV47OT5U3SH3LFPFKAOQ3/graph.json","events_json":"https://pith.science/api/pith-number/7EBGVBV47OT5U3SH3LFPFKAOQ3/events.json","paper":"https://pith.science/paper/7EBGVBV4"},"agent_actions":{"view_html":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3","download_json":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3.json","view_paper":"https://pith.science/paper/7EBGVBV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6492&json=true","fetch_graph":"https://pith.science/api/pith-number/7EBGVBV47OT5U3SH3LFPFKAOQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/7EBGVBV47OT5U3SH3LFPFKAOQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/action/storage_attestation","attest_author":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/action/author_attestation","sign_citation":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/action/citation_signature","submit_replication":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/action/replication_record"}},"created_at":"2026-05-18T03:37:31.798619+00:00","updated_at":"2026-05-18T03:37:31.798619+00:00"}