A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
From MaRDI portal
Publication:1717026
DOI10.3934/jimo.2018003zbMath1412.90115OpenAlexW2785442089MaRDI QIDQ1717026
Rui Zhao, Ya-Li Gao, Jian Lv, Fang-Fang Guo, Jie Shen
Publication date: 5 February 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018003
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A log-exponential regularization method for a mathematical program with general vertical complementarity constraints
- A new parallel splitting descent method for structured variational inequalities
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Convergence of some algorithms for convex minimization
- Efficiency of proximal bundle methods
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
- On the coderivative of the solution mapping to a second-order cone constrained parametric variational inequality
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Methods of descent for nondifferentiable optimization
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A subgradient-based convex approximations method for DC programming and its applications
- The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
This page was built for publication: A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
