Constrained nonconvex nonsmooth optimization via proximal bundle method
From MaRDI portal
Publication:481058
DOI10.1007/s10957-014-0523-9zbMath1302.90162OpenAlexW1983416243MaRDI QIDQ481058
Yang Yang, Jie Shen, Li-Ping Pang, Xue-Fei Ma
Publication date: 12 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0523-9
nonsmooth optimizationnonconvex optimizationexact penalty functionsconstrained programminglower-\(C^2\)proximal bundle methods
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ An approximate bundle method for solving nonsmooth equilibrium problems ⋮ A new global optimization technique by auxiliary function method in a directional search ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Computing proximal points of nonconvex functions
- 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
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- The Cutting-Plane Method for Solving Convex Programs
- A Linearization Algorithm for Nonsmooth Minimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- 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
- Convex Analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
This page was built for publication: Constrained nonconvex nonsmooth optimization via proximal bundle method
