Exploiting low-rank structure in semidefinite programming by approximate operator splitting
From MaRDI portal
Publication:5034932
DOI10.1080/02331934.2020.1823387zbMath1486.90141arXiv1810.05231OpenAlexW3154076173MaRDI QIDQ5034932
Mario Souto, Alvaro Veiga, Joaquim Dias Garcia
Publication date: 21 February 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.05231
convex optimizationsemidefinite programmingoperator splitting methodslow-rank matrix approximationapproximate proximal pointinexact fixed point iteration
Related Items
ProxSDP ⋮ An interior point-proximal method of multipliers for linear positive semi-definite programming ⋮ Efficient semidefinite programming with approximate ADMM
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
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- MathOptInterface.jl
- Conic optimization via operator splitting and homogeneous self-dual embedding
- An approximation theory of matrix rank minimization and its application to quadratic equations
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A new polynomial-time algorithm for linear programming
- Theory of semidefinite programming for sensor network localization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Applications of semidefinite programming
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Problems of distance geometry and convex properties of quadratic maps
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An implementation of Karmarkar's algorithm for linear programming
- Computational complexity of optimum multiuser detection
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Distributionally robust joint chance constraints with second-order moment information
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Efficient semidefinite programming with approximate ADMM
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Robust Convex Optimization
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Proximal Splitting Methods in Signal Processing
- Julia: A Fresh Approach to Numerical Computing
- Robust Sparse Analysis Regularization
- On the power of unique 2-prover 1-round games
- The Diversity Order of the Semidefinite Relaxation Detector
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Monotone Operators and the Proximal Point Algorithm
- Basic Linear Algebra Subprograms for Fortran Usage
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Robust Truss Topology Design via Semidefinite Programming
- ARPACK Users' Guide
- Solving Graph Bisection Problems with Semidefinite Programming
- SDPLIB 1.2, a library of semidefinite programming test problems
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis
- Log-determinant relaxation for approximate inference in discrete Markov random fields
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Towards a proof of the 2-to-1 games conjecture?
- Signal Recovery by Proximal Forward-Backward Splitting
- JuMP: A Modeling Language for Mathematical Optimization
- Phase Retrieval via Matrix Completion
- Convex analysis and monotone operator theory in Hilbert spaces
