{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UINSFJEJBPGR2ZOWRRY6KWURVC","short_pith_number":"pith:UINSFJEJ","schema_version":"1.0","canonical_sha256":"a21b22a4890bcd1d65d68c71e55a91a8992556ec2ae5139bd5ff6dd5fd7b774d","source":{"kind":"arxiv","id":"2211.10942","version":1},"attestation_state":"computed","paper":{"title":"On the convergence analysis of DCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yi-Shuai Niu","submitted_at":"2022-11-20T10:37:26Z","abstract_excerpt":"In this paper, we propose a clean and general proof framework to establish the convergence analysis of the Difference-of-Convex (DC) programming algorithm (DCA) for both standard DC program and convex constrained DC program. We first discuss suitable assumptions for the well-definiteness of DCA. Then, we focus on the convergence analysis of DCA, in particular, the global convergence of the sequence $\\{x^k\\}$ generated by DCA under the Lojasiewicz subgradient inequality and the Kurdyka-Lojasiewicz property respectively. Moreover, the convergence rate for the sequences $\\{f(x^k)\\}$ and $\\{\\|x^k-"},"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":"2211.10942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-20T10:37:26Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9cf955a7d2382c2b8bd1cf83d928b9c383e78bbb74d9113b02579554e9ac6f38","abstract_canon_sha256":"0c7f98ae4c0379dc77d5cb69caacfa58970fb6a034f0c5976f9527b06edc96d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:36.759957Z","signature_b64":"vZ0LNTzlhRIl9wQd92c5MnJNMLc4vRFQPEaImZZXb0ogWcNeNyuOsiROIoaA6GYQDQ2+qEdBgKVtKWpTvIuwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21b22a4890bcd1d65d68c71e55a91a8992556ec2ae5139bd5ff6dd5fd7b774d","last_reissued_at":"2026-07-05T05:17:36.759583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:36.759583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the convergence analysis of DCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yi-Shuai Niu","submitted_at":"2022-11-20T10:37:26Z","abstract_excerpt":"In this paper, we propose a clean and general proof framework to establish the convergence analysis of the Difference-of-Convex (DC) programming algorithm (DCA) for both standard DC program and convex constrained DC program. We first discuss suitable assumptions for the well-definiteness of DCA. Then, we focus on the convergence analysis of DCA, in particular, the global convergence of the sequence $\\{x^k\\}$ generated by DCA under the Lojasiewicz subgradient inequality and the Kurdyka-Lojasiewicz property respectively. Moreover, the convergence rate for the sequences $\\{f(x^k)\\}$ and $\\{\\|x^k-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10942","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.10942/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":"2211.10942","created_at":"2026-07-05T05:17:36.759641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10942v1","created_at":"2026-07-05T05:17:36.759641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10942","created_at":"2026-07-05T05:17:36.759641+00:00"},{"alias_kind":"pith_short_12","alias_value":"UINSFJEJBPGR","created_at":"2026-07-05T05:17:36.759641+00:00"},{"alias_kind":"pith_short_16","alias_value":"UINSFJEJBPGR2ZOW","created_at":"2026-07-05T05:17:36.759641+00:00"},{"alias_kind":"pith_short_8","alias_value":"UINSFJEJ","created_at":"2026-07-05T05:17:36.759641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23550","citing_title":"RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC","json":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC.json","graph_json":"https://pith.science/api/pith-number/UINSFJEJBPGR2ZOWRRY6KWURVC/graph.json","events_json":"https://pith.science/api/pith-number/UINSFJEJBPGR2ZOWRRY6KWURVC/events.json","paper":"https://pith.science/paper/UINSFJEJ"},"agent_actions":{"view_html":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC","download_json":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC.json","view_paper":"https://pith.science/paper/UINSFJEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10942&json=true","fetch_graph":"https://pith.science/api/pith-number/UINSFJEJBPGR2ZOWRRY6KWURVC/graph.json","fetch_events":"https://pith.science/api/pith-number/UINSFJEJBPGR2ZOWRRY6KWURVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC/action/storage_attestation","attest_author":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC/action/author_attestation","sign_citation":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC/action/citation_signature","submit_replication":"https://pith.science/pith/UINSFJEJBPGR2ZOWRRY6KWURVC/action/replication_record"}},"created_at":"2026-07-05T05:17:36.759641+00:00","updated_at":"2026-07-05T05:17:36.759641+00:00"}