Primal–dual first-order methods for a class of cone programming
From MaRDI portal
Publication:2867434
DOI10.1080/10556788.2012.697901zbMath1310.65067MaRDI QIDQ2867434
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.697901
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C25: Convex programming
65K10: Numerical optimization and variational techniques
90C05: Linear programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Statistical learning from a regression perspective
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Quantitative robust uncertainty principles and optimally sparse decompositions
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Probing the Pareto Frontier for Basis Pursuit Solutions
- An Augmented Primal-Dual Method for Linear Conic Programs
- Eigenvalues and Condition Numbers of Random Matrices
- On the Shannon capacity of a graph
- Atomic Decomposition by Basis Pursuit
- A Spectral Bundle Method for Semidefinite Programming
- Sparse Reconstruction by Separable Approximation
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Stable signal recovery from incomplete and inaccurate measurements
