A first-order block-decomposition method for solving two-easy-block structured semidefinite programs

DOI10.1007/s12532-013-0062-7zbMath1342.49045OpenAlexW2058823059MaRDI QIDQ892382

Renato D. C. Monteiro, Camilo Ortiz, Benar Fux Svaiter

Publication date: 19 November 2015

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

Full work available at URL: https://doi.org/10.1007/s12532-013-0062-7

zbMATH Keywords

complexityconvex optimizationsemi-definite programmingconic optimizationextra-gradient methodblock-decomposition method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)

Related Items

Conic optimization via operator splitting and homogeneous self-dual embedding, Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), 2EBD-HPE, Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions, Covariate Regularized Community Detection in Sparse Graphs, A novel approach for solving semidefinite programs, A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints, A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis

Uses Software

• SDPT3
• SDPNAL

Cites Work

• Alternating direction augmented Lagrangian methods for semidefinite programming
• A boundary point method to solve semidefinite programs
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Enlargement of monotone operators with applications to variational inequalities
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Maximal monotone operators, convex functions and a special family of enlargements
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
• On the maximal monotonicity of subdifferential mappings
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Regularization Methods for Semidefinite Programming
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• Convex Analysis
• A family of enlargements of maximal monotone operators
• Benchmarking optimization software with performance profiles.