Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
From MaRDI portal
Publication:4571882
DOI10.1137/16M1115733zbMath1401.90170WikidataQ109595610 ScholiaQ109595610MaRDI QIDQ4571882
Marko M. Mäkelä, Napsu Karmitsa, Kaisa Joki, Adil M. Bagirov, Sona Taheri
Publication date: 3 July 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1115733
nonsmooth optimization; nonconvex optimization; bundle methods; DC functions; cutting plane model; Clarke stationarity
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
49J52: Nonsmooth analysis
Related Items
Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, A Deep Learning Method for Elliptic Hemivariational Inequalities, Essentials of numerical nonsmooth optimization, Essentials of numerical nonsmooth optimization, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, A bundle-type method for nonsmooth DC programs, The ABC of DC programming, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Aggregate subgradient method for nonsmooth DC optimization, A bundle method for nonsmooth DC programming with application to chance-constrained problems, A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data, A nonconforming virtual element method for a fourth-order hemivariational inequality in Kirchhoff plate problem, The DTC (difference of tangentially convex functions) programming: optimality conditions, DC semidefinite programming and cone constrained DC optimization. I: Theory, Classification in the multiple instance learning framework via spherical separation, Clusterwise support vector linear regression, Sequential difference-of-convex programming, Incremental DC optimization algorithm for large-scale clusterwise linear regression, An augmented subgradient method for minimizing nonsmooth DC functions, Proximal bundle methods for nonsmooth DC programming, Virtual element method for an elliptic hemivariational inequality with applications to contact mechanics, New global optimality conditions for nonsmooth DC optimization problems, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Exact penalty and error bounds in DC programming
- Codifferential method for minimizing nonsmooth DC functions
- On functions representable as a difference of convex functions
- Proximity control in bundle methods for convex nondifferentiable minimization
- A production-transportation problem with stochastic demand and concave production costs
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Margin maximization in spherical separation
- DC programming: overview.
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Methods of descent for nondifferentiable optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Introduction to Nonsmooth Optimization
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Survey of Bundle Methods for Nonsmooth Optimization
- A Method for Minimization of Quasidifferentiable Functions
- A splitting bundle approach for non-smooth non-convex minimization
- Convex Analysis
- Convex analysis and global optimization
