A perturbation view of level-set methods for convex optimization

DOI10.1007/s11590-020-01609-9OpenAlexW3034736270MaRDI QIDQ2228385

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

zbMATH Keywords

dualityconvex analysislevel-set methods

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Strong duality for standard convex programs

Uses Software

• mctoolbox
• PDCO
• SPGL1
• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Level-set methods for convex optimization
• New variants of bundle methods
• Phase recovery, MaxCut and complex semidefinite programming
• Atomic Decomposition by Basis Pursuit
• Lectures on Modern Convex Optimization
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Variational Properties of Value Functions
• Sparse Optimization with Least-Squares Constraints
• Probing the Pareto Frontier for Basis Pursuit Solutions
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Atomic Decomposition by Basis Pursuit
• Variational Analysis
• Trust Region Methods
• Accuracy and Stability of Numerical Algorithms
• Convex Analysis

This page was built for publication: A perturbation view of level-set methods for convex optimization