A perturbation view of level-set methods for convex optimization
From MaRDI portal
Publication:2228385
DOI10.1007/S11590-020-01609-9OpenAlexW3034736270MaRDI QIDQ2228385FDOQ2228385
Authors: Ron Estrin, Michael P. Friedlander 
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.06511
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
- Sparse Optimization with Least-Squares Constraints
- Probing the Pareto frontier for basis pursuit solutions
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Convex Analysis
- Title not available (Why is that?)
- Trust Region Methods
- New variants of bundle methods
- Accuracy and Stability of Numerical Algorithms
- Atomic decomposition by basis pursuit
- Phase recovery, MaxCut and complex semidefinite programming
- Variational properties of value functions
- Level-set methods for convex optimization
Cited In (4)
Uses Software
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)
