An augmented subgradient method for minimizing nonsmooth DC functions
From MaRDI portal
Publication:2231043
DOI10.1007/s10589-021-00304-4zbMath1478.90094OpenAlexW3184658784MaRDI QIDQ2231043
Publication date: 29 September 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00304-4
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 ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- Exact penalty and error bounds in DC programming
- A DC optimization-based clustering technique for edge detection
- Codifferential method for minimizing nonsmooth DC functions
- DC models for spherical separation
- The ABC of DC programming
- Accelerating the DC algorithm for smooth functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Aggregate subgradient method for nonsmooth DC optimization
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Sequential difference-of-convex programming
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Introduction to Nonsmooth Optimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Finding the nearest point in A polytope
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Numerical Nonsmooth Optimization
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Convex analysis and global optimization
- Benchmarking optimization software with performance profiles.
