{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/new-bregman-proximal-type-algorithms-for","title":"New Bregman proximal type algorithms for solving DC optimization problems","arxiv_id":"2105.04873","date":"2021-05-11","proceeding":null,"authors":["Shota Takahashi","Mituhiro Fukuda","Mirai Tanaka"],"abstract":"Difference of Convex (DC) optimization problems have objective functions that are differences between two convex functions. Representative ways of solving these problems are the proximal DC algorithms, which require that the convex part of the objective function have $L$-smoothness. In this article, we propose the Bregman Proximal DC Algorithm (BPDCA) for solving large-scale DC optimization problems that do not possess $L$-smoothness. Instead, it requires that the convex part of the objective function has the $L$-smooth adaptable property that is exploited in Bregman proximal gradient algorithms. In addition, we propose an accelerated version, the Bregman Proximal DC Algorithm with extrapolation (BPDCAe), with a new restart scheme. We show the global convergence of the iterates generated by BPDCA(e) to a limiting critical point under the assumption of the Kurdyka-{\\L}ojasiewicz property or subanalyticity of the objective function and other weaker conditions than those of the existing methods. We applied our algorithms to phase retrieval, which can be described both as a nonconvex optimization problem and as a DC optimization problem. Numerical experiments showed that BPDCAe outperformed existing Bregman proximal-type algorithms because the DC formulation allows for larger admissible step sizes.","url_abs":"https://arxiv.org/abs/2105.04873v3","url_pdf":"https://arxiv.org/pdf/2105.04873v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"new-bregman-proximal-type-algorithms-for","repo_url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2105.04873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04873"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm","reach":null}],"summary":{"ran_violates":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"b112c27dc1cc9393","entry":"gradient_kernel","repo":"ShotaTakahashi/bregman-proximal-dc-algorithm","repo_kind":"official","path":"example/example.py","file_url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm/blob/HEAD/example/example.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b112c27dc1cc9393"}},{"code_sha256_prefix":"85cbefbf5281ae8f","entry":"gradient","repo":"ShotaTakahashi/bregman-proximal-dc-algorithm","repo_kind":"official","path":"example/example.py","file_url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm/blob/HEAD/example/example.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"85cbefbf5281ae8f"}},{"code_sha256_prefix":"12cebf8cff22c79e","entry":"objective_function","repo":"ShotaTakahashi/bregman-proximal-dc-algorithm","repo_kind":"official","path":"example/example.py","file_url":"https://github.com/ShotaTakahashi/bregman-proximal-dc-algorithm/blob/HEAD/example/example.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"12cebf8cff22c79e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}