Bregman primal-dual first-order method and application to sparse semidefinite programming
From MaRDI portal
Publication:2070334
DOI10.1007/s10589-021-00339-7zbMath1484.90065OpenAlexW4200490012MaRDI QIDQ2070334
Lieven Vandenberghe, Xin Jiang
Publication date: 24 January 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00339-7
Related Items
Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems, Resolvent of the parallel composition and the proximity operator of the infimal postcomposition, Bregman three-operator splitting methods
Uses Software
Cites Work
- 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
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A three-operator splitting scheme and its optimization applications
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Lectures on convex optimization
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
- Positive definite completions of partial Hermitian matrices
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- 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 splitting algorithm for dual monotone inclusions involving cocoercive operators
- An interior point-proximal method of multipliers for convex quadratic programming
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Decomposition in Conic Optimization with Partially Separable Structure
- Decomposition Methods for Sparse Matrix Nearness Problems
- Algorithm 875
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- SDPLIB 1.2, a library of semidefinite programming test problems
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis
- A First-Order Primal-Dual Algorithm with Linesearch
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- An Approximate Minimum Degree Ordering Algorithm
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- An ADMM-based interior-point method for large-scale linear programming
- Logarithmic barriers for sparse matrix cones
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Proximité et dualité dans un espace hilbertien
- An introduction to continuous optimization for imaging
