Approximate level method for nonsmooth convex minimization
From MaRDI portal
Publication:415377
DOI10.1007/s10957-011-9908-1zbMath1237.90183OpenAlexW1964847011MaRDI QIDQ415377
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9908-1
sensitivity analysislarge-scale optimizationnonsmooth convex minimizationapproximate projections in relative scalelevel method
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
A regularized simplex method ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization ⋮ Level bundle-like algorithms for convex optimization ⋮ Machine learning algorithms of relaxation subgradient method with space extension
Cites Work
- Unnamed Item
- Unnamed Item
- Variable target value subgradient method
- Introductory lectures on convex optimization. A basic course.
- A method of projection onto an acute cone with level control in convex minimization
- New variants of bundle methods
- An aggregate subgradient method for nonsmooth convex minimization
- Improved Algorithms for Convex Minimization in Relative Scale
- The Cutting-Plane Method for Solving Convex Programs
- Residual Selection in A Projection Method for Convex Minimization Problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- Minimization of unsmooth functionals
This page was built for publication: Approximate level method for nonsmooth convex minimization
