A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
From MaRDI portal
Publication:2399479
DOI10.1007/s10898-016-0488-3zbMath1369.90137OpenAlexW2561526916WikidataQ109595613 ScholiaQ109595613MaRDI QIDQ2399479
Kaisa Joki, Marko M. Mäkelä, Napsu Karmitsa, Adil M. Bagirov
Publication date: 24 August 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0488-3
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ Alternating DC algorithm for partial DC programming problems ⋮ The ABC of DC programming ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ Classification in the multiple instance learning framework via spherical separation ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Clusterwise support vector linear regression ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A bundle-type method for nonsmooth DC programs ⋮ A refined inertial DC algorithm for DC programming ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ Sequential difference-of-convex programming ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ An inertial algorithm for DC programming ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ A difference of convex optimization algorithm for piecewise linear regression ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ Polyhedral separation via difference of convex (DC) programming
Uses Software
Cites Work
- Exact penalty and error bounds in DC programming
- Codifferential method for minimizing nonsmooth DC functions
- DC models for spherical separation
- On functions representable as a difference of convex functions
- Optimization of upper semidifferentiable 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
- Variable metric methods for unconstrained optimization and nonlinear least squares
- 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.
- Methods of descent for nondifferentiable optimization
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Introduction to Nonsmooth Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- A quasisecant method for minimizing nonsmooth functions
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Survey of Bundle Methods for Nonsmooth Optimization
- A Method for Minimization of Quasidifferentiable Functions
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- A splitting bundle approach for non-smooth non-convex minimization
- Convex Analysis
- Convex analysis and global optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
