An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

DOI10.1007/s10107-016-1007-5zbMath1356.90105arXiv1506.00741OpenAlexW3102223204MaRDI QIDQ507319

Liang Chen, Kim-Chuan Toh, Defeng Sun

Publication date: 3 February 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00741

zbMATH Keywords

majorization alternating direction method of multipliers convex conic programming convex quadratic semidefinite programming symmetric Gauss-Seidel

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items

Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method, Fast Algorithms for LS and LAD-Collaborative Regression, An efficient algorithm for batch images alignment with adaptive rank-correction term, Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter, An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, Augmented Lagrangian methods for convex matrix optimization problems, On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems, Robust low transformed multi-rank tensor methods for image alignment, Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming, A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications, Efficient dual ADMMs for sparse compressive sensing MRI reconstruction, Inexact alternating direction methods of multipliers for separable convex optimization, An improved total variation regularized RPCA for moving object detection with dynamic background, Learning Markov Models Via Low-Rank Optimization, A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem, Unnamed Item, Unnamed Item, A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement, A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming, A linear algebra perspective on the random multi-block ADMM: the QP case, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems, A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion, A Round Trip Time Weighting Model for One-way Delay Estimation, An iDCA with sieving strategy for PDE-constrained optimization problems with $L^{1-2}$-control cost, Enhancing low-rank tensor completion via first-order and second-order total variation regularizations, A clustered virtual machine allocation strategy based on a sleep-mode with wake-up threshold in a cloud environment, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond, An Inexact Dual Alternating Direction Method of Multipliers for Image Decomposition and Restoration, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming, Convergent prediction-correction-based ADMM for multi-block separable convex programming, A dual spectral projected gradient method for log-determinant semidefinite problems, An efficient duality-based approach for PDE-constrained sparse optimization, Semidefinite programming approach for the quadratic assignment problem with a sparse graph, A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming, An algorithm for matrix recovery of high-loss-rate network traffic data, A note on the convergence of ADMM for linearly constrained convex optimization problems, Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version, On inexact ADMMs with relative error criteria, An FE-inexact heterogeneous ADMM for elliptic optimal control problems with $L^1$-control cost, Double fused Lasso penalized LAD for matrix regression, A new randomized Gauss-Seidel method for solving linear least-squares problems, Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces, Convergence rates for an inexact ADMM applied to separable convex optimization, A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems, A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing, Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination, An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems, An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation, Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem, A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications, ADMM for multiaffine constrained optimization, Double fused Lasso regularized regression with both matrix and vector valued predictors, Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), A novel scheme for multivariate statistical fault detection with application to the Tennessee Eastman process, Randomized primal-dual proximal block coordinate updates, Another Look at Distance-Weighted Discrimination, Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem, An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming, A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems, Unnamed Item, A variational approach to Gibbs artifacts removal in MRI, An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming

Uses Software

Cites Work