A perturbation view of level-set methods for convex optimization
From MaRDI portal
Recommendations
- Level-set methods for convex optimization
- A level-set method for convex optimization with a feasible solution path
- Strong duality for standard convex programs
- Optimality conditions in convex optimization revisited
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
Cites work
- Accuracy and Stability of Numerical Algorithms
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Atomic decomposition by basis pursuit
- Atomic Decomposition by Basis Pursuit
- Convex Analysis
- scientific article; zbMATH DE number 51121 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Level-set methods for convex optimization
- New variants of bundle methods
- Phase recovery, MaxCut and complex semidefinite programming
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Probing the Pareto frontier for basis pursuit solutions
- Sparse Optimization with Least-Squares Constraints
- Trust Region Methods
- Variational Analysis
- Variational properties of value functions
Cited in
(5)- Level-set methods for convex optimization
- Strong duality for standard convex programs
- On the level set method in minimax theory
- A perturbation view of level-set methods for convex optimization
- An adaptive parameter-free and projection-free restarting level set method for constrained convex optimization under the error bound condition
This page was built for publication: A perturbation view of level-set methods for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228385)
