The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

DOI10.1137/18M123339XzbMath1461.65119arXiv1812.06070OpenAlexW3013364710MaRDI QIDQ5221263

Francisco J. Aragón Artacho, Phan Tu Vuong

Publication date: 25 March 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

difference of convex functionsclustering problemKurdyka-Łojasiewicz propertyboosted difference of convex functions algorithmmultidimensional scaling problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

Alternating DC algorithm for partial DC programming problems, The ABC of DC programming, DC semidefinite programming and cone constrained DC optimization. I: Theory, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, The boosted DC algorithm for linearly constrained DC programming, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Finding robust minimizer for non-convex phase retrieval, The descent algorithm for solving the symmetric eigenvalue complementarity problem, A bundle-type method for nonsmooth DC programs, A refined inertial DC algorithm for DC programming, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Open issues and recent advances in DC programming and DCA, An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds, Incremental DC optimization algorithm for large-scale clusterwise linear regression, An augmented subgradient method for minimizing nonsmooth DC functions, Unnamed Item, Solving \(k\)-center problems involving sets based on optimization techniques, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, A unified Douglas-Rachford algorithm for generalized DC programming

Cites Work

• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A minimization method for the sum of a convex function and a continuously differentiable function
• On gradients of functions definable in o-minimal structures
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• DC programming and DCA: thirty years of developments
• Accelerating the DC algorithm for smooth functions
• Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
• A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
• An inertial algorithm for DC programming
• A general double-proximal gradient algorithm for d.c. programming
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Transactions on Computational Collective Intelligence XIII
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Clarke Subgradients of Stratifiable Functions
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• A generalized proximal point algorithm for certain non-convex minimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Variational Analysis and Applications
• Qualitative properties of the minimum sum-of-squares clustering problem
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item