An inexact proximal linearized DC algorithm with provably terminating inner loop

DOI10.1080/02331934.2024.2314241MaRDI QIDQ6987161zbMATH OpenFDO

Authors Yi Zhang, Isao Yamada

Publication date 7 May 2025

Published in Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites work

• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 4032473 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 2076851 (Why is no real title available?)
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A DC optimization-based clustering technique for edge detection
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• A production-transportation problem with stochastic demand and concave production costs
• A proximal difference-of-convex algorithm with extrapolation
• An inertial algorithm for DC programming
• Combined SVM-based feature selection and classification
• Computing B-stationary points of nonsmooth DC programs
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• DC programming: overview.
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
• Exact penalty and error bounds in DC programming
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
• Finding the nearest point in A polytope
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Global minimization of a difference of two convex functions
• On the convergence of an approximate proximal method for DC functions
• Signal Recovery by Proximal Forward-Backward Splitting
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The problem of projecting the origin of Euclidean space onto the convex polyhedron

Cited in

(2)

• An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
• An efficient asymptotic DC method for sparse and low-rank matrix recovery

This page was built for publication: An inexact proximal linearized DC algorithm with provably terminating inner loop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987161)