Matrix-free convex optimization modeling
From MaRDI portal
Abstract: We introduce a convex optimization modeling framework that transforms a convex optimization problem expressed in a form natural and convenient for the user into an equivalent cone program in a way that preserves fast linear transforms in the original problem. By representing linear functions in the transformation process not as matrices, but as graphs that encode composition of linear operators, we arrive at a matrix-free cone program, i.e., one whose data matrix is represented by a linear operator and its adjoint. This cone program can then be solved by a matrix-free cone solver. By combining the matrix-free modeling framework and cone solver, we obtain a general method for efficiently solving convex optimization problems involving fast linear transforms.
Recommendations
- Disciplined convex programming
- Graph-matrix calculus for computational convex analysis
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- Graph implementations for nonsmooth convex programs
- COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis
Cites work
- scientific article; zbMATH DE number 1614268 (Why is no real title available?)
- scientific article; zbMATH DE number 3874483 (Why is no real title available?)
- scientific article; zbMATH DE number 4141383 (Why is no real title available?)
- scientific article; zbMATH DE number 5485456 (Why is no real title available?)
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 4049531 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1531793 (Why is no real title available?)
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A descent approach to a class of inverse problems
- A fast algorithm for particle simulations
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A primal-dual potential reduction method for problems involving matrix inequalities
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A still better performance guarantee for approximate graph coloring
- A theory for multiresolution signal decomposition: the wavelet representation
- Algorithm 875
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Atomic Decomposition by Basis Pursuit
- Biorthogonal bases of compactly supported wavelets
- CVXGEN: a code generator for embedded convex optimization
- CVXPY: a Python-embedded modeling language for convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- Differential properties of Euclidean projection onto power cone
- Direct Methods for Sparse Linear Systems
- Disciplined convex programming
- Discrete Cosine Transform
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Fast Discrete Curvelet Transforms
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Graph implementations for nonsmooth convex programs
- Introduction to hierarchical matrices with applications.
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- Lx = b
- Matrix-free interior point method
- Matrix-free interior point method for compressed sensing problems
- Methods of conjugate gradients for solving linear systems
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- New methods to color the vertices of a graph
- Orthonormal bases of compactly supported wavelets
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Probing the Pareto frontier for basis pursuit solutions
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Stochastic matrix-free equilibration
- Templates for convex cone problems with applications to sparse signal recovery
- Ten Lectures on Wavelets
- The Fast Gauss Transform
- The Split Bregman Method for L1-Regularized Problems
- The curvelet transform for image denoising
- The finite ridgelet transform for image representation
- Towards non-symmetric conic optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(7)- An optimal-storage approach to semidefinite programming using approximate complementarity
- Stochastic matrix-free equilibration
- Graph implementations for nonsmooth convex programs
- An efficient bounded-variable nonlinear least-squares algorithm for embedded MPC
- Modeling Hessian-vector products in nonlinear optimization: new Hessian-free methods
- COAL: a generic modelling and prototyping framework for convex optimization problems of variational image analysis
- Fast Fourier optimization
Describes a project that uses
Uses Software
This page was built for publication: Matrix-free convex optimization modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957708)
