Approximate level method for nonsmooth convex minimization
DOI10.1007/S10957-011-9908-1zbMATH Open1237.90183OpenAlexW1964847011MaRDI QIDQ415377FDOQ415377
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
Recommendations
- scientific article; zbMATH DE number 1292040
- Level-set methods for convex optimization
- scientific article; zbMATH DE number 503081
- scientific article; zbMATH DE number 2000125
- Publication:4955970
- scientific article; zbMATH DE number 6867317
- Nonconvex approximations in unconstrained minimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Approximate global minimization of nonconvex functions that are close to convex
- scientific article; zbMATH DE number 5653878
sensitivity analysislarge-scale optimizationnonsmooth convex minimizationapproximate projections in relative scalelevel method
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Title not available (Why is that?)
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- An aggregate subgradient method for nonsmooth convex minimization
- New variants of bundle methods
- The Cutting-Plane Method for Solving Convex Programs
- Minimization of unsmooth functionals
- Improved Algorithms for Convex Minimization in Relative Scale
- Variable target value subgradient method
- A method of projection onto an acute cone with level control in convex minimization
- 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
Cited In (8)
- A regularized simplex method
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Title not available (Why is that?)
- Machine learning algorithms of relaxation subgradient method with space extension
- Level bundle-like algorithms for convex optimization
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Generalized Level Method with Approximated Data
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
This page was built for publication: Approximate level method for nonsmooth convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415377)
