Alternating direction augmented Lagrangian methods for semidefinite programming

DOI10.1007/S12532-010-0017-1zbMath1206.90088OpenAlexW2142333440MaRDI QIDQ621749

Donald Goldfarb, Wotao Yin, ZaiWen Wen

Publication date: 28 January 2011

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/102142

zbMATH Keywords

semidefinite programmingaugmented Lagrangian methodalternating direction method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (only showing first 100 items - show all)

A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Learning task-driving affinity matrix for accurate multi-view clustering through tensor subspace learning ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs ⋮ Partitioning through projections: strong SDP bounds for large graph partition problems ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ Ellipsoidal classification via semidefinite programming ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance ⋮ Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Alternating direction method of multipliers for real and complex polynomial optimization models ⋮ IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming ⋮ The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ Fast algorithms for sparse inverse covariance estimation ⋮ Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ Modularity maximization using completely positive programming ⋮ Conic relaxations for semi-supervised support vector machines ⋮ A proximal quadratic surface support vector machine for semi-supervised binary classification ⋮ Douglas-Rachford splitting method for semidefinite programming ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ An alternating direction method for second-order conic programming ⋮ Applications of gauge duality in robust principal component analysis and semidefinite programming ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations ⋮ A proximal alternating linearization method for nonconvex optimization problems ⋮ Unnamed Item ⋮ Alternating proximal gradient method for convex minimization ⋮ An alternating direction method for convex quadratic second-order cone programming with bounded constraints ⋮ Global convergence of unmodified 3-block ADMM for a class of convex minimization problems ⋮ Fast alternating linearization methods for minimizing the sum of two convex functions ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ An alternating direction and projection algorithm for structure-enforced matrix factorization ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ A first-order block-decomposition method for solving two-easy-block structured semidefinite programs ⋮ Block-wise ADMM with a relaxation factor for multiple-block convex programming ⋮ \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers ⋮ On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization ⋮ Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ An ADM-based splitting method for separable convex programming ⋮ Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems ⋮ Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations ⋮ Analysis on a superlinearly convergent augmented Lagrangian method ⋮ A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem ⋮ A novel neural network for solving semidefinite programming problems with some applications ⋮ Alternating direction method of multipliers for sparse principal component analysis ⋮ Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming ⋮ Sensitivity analysis of the proximal-based parallel decomposition methods ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ An implementable first-order primal-dual algorithm for structured convex optimization ⋮ A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints ⋮ A class of linearized proximal alternating direction methods ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ A guide to conic optimisation and its applications ⋮ \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ A branch-and-bound algorithm for solving max-\(k\)-cut problem ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks ⋮ A new algorithm for positive semidefinite matrix completion ⋮ A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming ⋮ ADMM for the SDP relaxation of the QAP ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ Improving ADMMs for solving doubly nonnegative programs through dual factorization ⋮ A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming ⋮ Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization ⋮ An extragradient-based alternating direction method for convex minimization ⋮ On inexact ADMMs with relative error criteria ⋮ An alternating direction algorithm for matrix completion with nonnegative factors ⋮ A simple and efficient algorithm for fused lasso signal approximator with convex loss function ⋮ On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems ⋮ Optimizing a polyhedral-semidefinite relaxation of completely positive programs ⋮ On the convergence analysis of the alternating direction method of multipliers with three blocks ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ A proximal DC approach for quadratic assignment problem ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ An oracle for the discrete-time integral quadratic constraint problem ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ High dimensional covariance matrix estimation using multi-factor models from incomplete information ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ Using a factored dual in augmented Lagrangian methods for semidefinite programming ⋮ An iterative approach to the optimal co-design of linear control systems ⋮ Chordal decomposition in operator-splitting methods for sparse semidefinite programs ⋮ A proximal augmented method for semidefinite programming problems

Uses Software

• Unnamed Item
• SDPLR
• DIMACS
• SDPNAL
• Biq Mac
• Yall1
• RecPF
• FTVd
• BiqMac
• dsyevx

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast alternating linearization methods for minimizing the sum of two convex functions
• A boundary point method to solve semidefinite programs
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A variable-penalty alternating directions method for convex optimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• Local minima and convergence in low-rank semidefinite programming
• Solving semidefinite programming problems via alternating direction methods
• Fast Multiple-Splitting Algorithms for Convex Optimization
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Semidefinite optimization
• An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• Proximal Decomposition Via Alternating Linearization
• Semidefinite Programming
• Regularization Methods for Semidefinite Programming
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• A descent method for structured monotone variational inequalities
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Benchmarking optimization software with performance profiles.

This page was built for publication: Alternating direction augmented Lagrangian methods for semidefinite programming