New Bregman proximal type algoritms for solving DC optimization problems

DOI10.1007/s10589-022-00411-wzbMath1518.90083arXiv2105.04873MaRDI QIDQ6043133

Mituhiro Fukuda, Shota Takahashi, Mirai Tanaka

Publication date: 4 May 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04873

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationBregman distancesKurdyka-Łojasiewicz inequalitydifference-of-convex optimizationBregman proximal DC algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Lectures on convex optimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Semianalytic and subanalytic sets
• On gradients of functions definable in o-minimal structures
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• A proximal difference-of-convex algorithm with extrapolation
• DC programming and DCA: thirty years of developments
• DC programming: overview.
• On DC based methods for phase retrieval
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Matrix Nearness Problems with Bregman Divergences
• Variational Analysis
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• First-Order Methods in Optimization
• Modern Nonconvex Nondifferentiable Optimization
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

This page was built for publication: New Bregman proximal type algoritms for solving DC optimization problems