Preconditioned ADMM for a class of bilinear programming problems
From MaRDI portal
Publication:1721110
DOI10.1155/2018/5694201zbMath1427.90265OpenAlexW2782975484MaRDI QIDQ1721110
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5694201
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Related Items
Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ An objective penalty function method for biconvex programming
Uses Software
Cites Work
- Sparse solutions of linear complementarity problems
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- Optimization on low rank nonconvex structures
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Multiplier and gradient methods
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond
- Fast Alternating Direction Optimization Methods
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Proximité et dualité dans un espace hilbertien
