Level-set methods for convex optimization
From MaRDI portal
Publication:1739042
DOI10.1007/s10107-018-1351-8zbMath1421.90111arXiv1602.01506OpenAlexW2963600869WikidataQ128822459 ScholiaQ128822459MaRDI QIDQ1739042
Scott Roy, James V. Burke, Aleksandr Y. Aravkin, Michael P. Friedlander, Dmitriy Drusvyatskiy
Publication date: 24 April 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.01506
Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Unnamed Item, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier, Doubly iteratively reweighted algorithm for constrained compressed sensing models, A dual active set method for \(\ell1\)-regularized problem, Stochastic first-order methods for convex and nonconvex functional constrained optimization, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, Symmetric matrices whose entries are linear functions, A perturbation view of level-set methods for convex optimization, Adapting Regularized Low-Rank Models for Parallel Architectures, Low-Rank Spectral Optimization via Gauge Duality, Relaxation algorithms for matrix completion, with applications to seismic travel-time data interpolation, Accelerated Iterative Regularization via Dual Diagonal Descent, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Smooth minimization of non-smooth functions
- Latent variable graphical model selection via convex optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An O(n) algorithm for quadratic knapsack problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Nonlinear multiobjective optimization
- Introductory lectures on convex optimization. A basic course.
- Convex analysis and nonlinear optimization. Theory and examples
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- New variants of bundle methods
- Linear programming, complexity theory and elementary functional analysis
- TILT: transform invariant low-rank textures
- Phase recovery, MaxCut and complex semidefinite programming
- Lectures on Modern Convex Optimization
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Variational Properties of Value Functions
- Duality Between Subgradient and Conditional Gradient Methods
- Robust principal component analysis?
- Analysis and Generalizations of the Linearized Bregman Method
- Sparse Optimization with Least-Squares Constraints
- Self-calibration and biconvex compressive sensing
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Atomic Decomposition by Basis Pursuit
- ARPACK Users' Guide
- A new approach to variable selection in least squares problems
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Sparse Reconstruction by Separable Approximation
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Gauge Optimization and Duality
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Regularization and Variable Selection Via the Elastic Net
- Euclidean Distance Geometry and Applications
- Convex Analysis
- Computer algebra recipes. A gourmet's guide to the mathematical models of science. Incl. 1 CD-ROM
