A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
From MaRDI portal
Publication:1983659
DOI10.1515/jnma-2019-0049zbMath1469.90144OpenAlexW3179597857MaRDI QIDQ1983659
Jie Shen, Jia-Tong Li, Na Xu, Fang-Fang Guo
Publication date: 10 September 2021
Published in: Journal of Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jnma-2019-0049
DC programminglocally Lipschitz continuousnonlinear nonsmooth optimizationredistributed bundle method
Cites Work
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Codifferential method for minimizing nonsmooth DC functions
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- A production-transportation problem with stochastic demand and concave production costs
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- 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 proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- Introduction to Nonsmooth Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Variational Analysis
- 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
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Convex Analysis
- Convex analysis and global optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
