{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5K2AJ7QBN3GNHKHB7OYWDUCPSK","short_pith_number":"pith:5K2AJ7QB","schema_version":"1.0","canonical_sha256":"eab404fe016eccd3a8e1fbb161d04f92a816a5c023f07c93043a0bf6ed7bb647","source":{"kind":"arxiv","id":"2412.05697","version":1},"attestation_state":"computed","paper":{"title":"An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Jo\\~ao Carlos O. Souza, Orizon P. Ferreira, Wilkreffy M. S. Santos","submitted_at":"2024-12-07T16:56:09Z","abstract_excerpt":"In this paper, we introduce an inexact approach to the Boosted Difference of Convex Functions Algorithm (BDCA) for solving nonconvex and nondifferentiable problems involving the difference of two convex functions (DC functions). Specifically, when the first DC component is differentiable and the second may be nondifferentiable, BDCA utilizes the solution from the subproblem of the DC Algorithm (DCA) to define a descent direction for the objective function. A monotone linesearch is then performed to find a new point that improves the objective function relative to the subproblem solution. This "},"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":"2412.05697","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-07T16:56:09Z","cross_cats_sorted":[],"title_canon_sha256":"c97403a60591d2aa1a9aa37a9354e505cdbd6fb144adb01908a212f336109494","abstract_canon_sha256":"b380eb3ffa9b4e3c4839e74d7f0f5102f7d92421fd8d79bd738d566469a852ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:07.602050Z","signature_b64":"sRX/m1662dZCOqb9RWRz5qRKsjqAXnu1A2/T5ni7gmcVTxXXmtvB55Sx/2LsHWOEqYuixmrBVfS0WJX6kbY7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab404fe016eccd3a8e1fbb161d04f92a816a5c023f07c93043a0bf6ed7bb647","last_reissued_at":"2026-07-05T09:46:07.601543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:07.601543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boris S. Mordukhovich, Jo\\~ao Carlos O. Souza, Orizon P. Ferreira, Wilkreffy M. S. Santos","submitted_at":"2024-12-07T16:56:09Z","abstract_excerpt":"In this paper, we introduce an inexact approach to the Boosted Difference of Convex Functions Algorithm (BDCA) for solving nonconvex and nondifferentiable problems involving the difference of two convex functions (DC functions). Specifically, when the first DC component is differentiable and the second may be nondifferentiable, BDCA utilizes the solution from the subproblem of the DC Algorithm (DCA) to define a descent direction for the objective function. A monotone linesearch is then performed to find a new point that improves the objective function relative to the subproblem solution. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05697","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/2412.05697/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":"2412.05697","created_at":"2026-07-05T09:46:07.601629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.05697v1","created_at":"2026-07-05T09:46:07.601629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05697","created_at":"2026-07-05T09:46:07.601629+00:00"},{"alias_kind":"pith_short_12","alias_value":"5K2AJ7QBN3GN","created_at":"2026-07-05T09:46:07.601629+00:00"},{"alias_kind":"pith_short_16","alias_value":"5K2AJ7QBN3GNHKHB","created_at":"2026-07-05T09:46:07.601629+00:00"},{"alias_kind":"pith_short_8","alias_value":"5K2AJ7QB","created_at":"2026-07-05T09:46:07.601629+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.05609","citing_title":"Extended SQP Methods in Nonsmooth Difference Programming Applied to Problems with Variational Inequality Constraints","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK","json":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK.json","graph_json":"https://pith.science/api/pith-number/5K2AJ7QBN3GNHKHB7OYWDUCPSK/graph.json","events_json":"https://pith.science/api/pith-number/5K2AJ7QBN3GNHKHB7OYWDUCPSK/events.json","paper":"https://pith.science/paper/5K2AJ7QB"},"agent_actions":{"view_html":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK","download_json":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK.json","view_paper":"https://pith.science/paper/5K2AJ7QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.05697&json=true","fetch_graph":"https://pith.science/api/pith-number/5K2AJ7QBN3GNHKHB7OYWDUCPSK/graph.json","fetch_events":"https://pith.science/api/pith-number/5K2AJ7QBN3GNHKHB7OYWDUCPSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK/action/storage_attestation","attest_author":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK/action/author_attestation","sign_citation":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK/action/citation_signature","submit_replication":"https://pith.science/pith/5K2AJ7QBN3GNHKHB7OYWDUCPSK/action/replication_record"}},"created_at":"2026-07-05T09:46:07.601629+00:00","updated_at":"2026-07-05T09:46:07.601629+00:00"}