The ABC of DC programming
From MaRDI portal
Publication:829493
DOI10.1007/s11228-020-00566-wzbMath1467.90037OpenAlexW3095693947MaRDI QIDQ829493
Publication date: 6 May 2021
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-020-00566-w
Nonconvex programming, global optimization (90C26) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems, 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, An augmented subgradient method for minimizing nonsmooth DC functions, Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley, Essentials of numerical nonsmooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- How to regularize a difference of convex functions
- Duality in nonconvex optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A parametric characterization of local optimality
- Introductory lectures on convex optimization. A basic course.
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- DC programming and DCA: thirty years of developments
- Accelerating the DC algorithm for smooth functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Beyond canonical dc-optimization: the single reverse polar problem
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Sequential difference-of-convex programming
- Solving polyhedral d.c. optimization problems via concave minimization
- Minimizing a sum of clipped convex functions
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A general double-proximal gradient algorithm for d.c. programming
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Computing B-Stationary Points of Nonsmooth DC Programs
- On difference convexity of locally Lipschitz functions
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Numerical Nonsmooth Optimization
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Convex Analysis
- Convex analysis and global optimization
