An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
From MaRDI portal
Publication:1665008
DOI10.1155/2015/215310zbMath1394.90561OpenAlexW1503443042WikidataQ59117637 ScholiaQ59117637MaRDI QIDQ1665008
Shu-Xin Wang, Jie Shen, Xiaoqian Liu, Fang-Fang Guo
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/215310
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
Computing proximal points of convex functions with inexact subgradients ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities
- Computing proximal points of nonconvex functions
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities
- Newton's method for convex programming and Tschebyscheff approximation
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- On a second order parallel variable transformation approach.
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- The Cutting-Plane Method for Solving Convex Programs
- A Linearization Algorithm for Nonsmooth Minimization
- Variational Analysis
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
This page was built for publication: An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions