Improving ADMMs for solving doubly nonnegative programs through dual factorization
From MaRDI portal
Publication:2240675
DOI10.1007/s10288-020-00454-xzbMath1479.90153arXiv1912.09851OpenAlexW3104719376MaRDI QIDQ2240675
Elisabeth Gaar, Martina Cerulli, Angelika Wiegele, Marianna De Santis
Publication date: 4 November 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.09851
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A bundle approach for SDPs with exact subgraph constraints
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
- Matrix Relaxations in Combinatorial Optimization
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- A comparison of the Delsarte and Lovász bounds
- Reducibility among Combinatorial Problems
- Regularization Methods for Semidefinite Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent