The boosted DC algorithm for linearly constrained DC programming

DOI10.1007/s11228-022-00656-xOpenAlexW2966789968MaRDI QIDQ2677660

Rubén Campoy, Francisco J. Aragón Artacho, Phan Tu Vuong

Publication date: 5 January 2023

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

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

zbMATH Keywords

difference of convex functionsglobal convergencetrust region subproblemboosted difference of convex functions algorithmconstrained DC programcopositivity problem

Mathematics Subject Classification ID

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

Related Items

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, A refined inertial DC algorithm for DC programming

Cites Work

• Testing copositivity with the help of difference-of-convex optimization
• Copositive optimization -- recent developments and applications
• Behavior of DCA sequences for solving the trust-region subproblem
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming
• A minimization method for the sum of a convex function and a continuously differentiable function
• 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 rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
• Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
• Proximal bundle methods for nonsmooth DC programming
• An inertial algorithm for DC programming
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Approximation of the Stability Number of a Graph via Copositive Programming
• Constructing copositive matrices from interior matrices
• A recursive Formula-trust-region method for bound-constrained nonlinear optimization
• Some NP-complete problems in quadratic and nonlinear programming
• A generalized proximal point algorithm for certain non-convex minimization problems
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Variational Analysis
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Trust Region Methods
• Nonlinear Optimization
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
• Convex analysis and monotone operator theory in Hilbert spaces