Matrix-Free Convex Optimization Modeling
From MaRDI portal
Publication:2957708
DOI10.1007/978-3-319-42056-1_7zbMath1354.90092arXiv1506.00760OpenAlexW608274465MaRDI QIDQ2957708
Steven Diamond, Stephen P. Boyd
Publication date: 27 January 2017
Published in: Optimization and Its Applications in Control and Data Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.00760
Related Items
Stochastic matrix-free equilibration, An efficient bounded-variable nonlinear least-squares algorithm for embedded MPC, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Conic optimization via operator splitting and homogeneous self-dual embedding
- CVXGEN: a code generator for embedded convex optimization
- Matrix-free interior point method
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Matrix-free interior point method for compressed sensing problems
- Differential properties of Euclidean projection onto power cone
- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- A still better performance guarantee for approximate graph coloring
- A descent approach to a class of inverse problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Introduction to hierarchical matrices with applications.
- Templates for convex cone problems with applications to sparse signal recovery
- A primal-dual potential reduction method for problems involving matrix inequalities
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Stochastic matrix-free equilibration
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
- Graph Implementations for Nonsmooth Convex Programs
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- The Split Bregman Method for L1-Regularized Problems
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Direct Methods for Sparse Linear Systems
- A theory for multiresolution signal decomposition: the wavelet representation
- The finite ridgelet transform for image representation
- The curvelet transform for image denoising
- Algorithm 875
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Orthonormal bases of compactly supported wavelets
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Ten Lectures on Wavelets
- Biorthogonal bases of compactly supported wavelets
- New methods to color the vertices of a graph
- Atomic Decomposition by Basis Pursuit
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- Discrete Cosine Transform
- Towards non-symmetric conic optimization
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Lx = b
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- The Fast Gauss Transform
- Fast Discrete Curvelet Transforms
- Methods of conjugate gradients for solving linear systems
- A fast algorithm for particle simulations
