A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
DOI10.1007/S12532-013-0062-7zbMATH Open1342.49045OpenAlexW2058823059MaRDI QIDQ892382FDOQ892382
Authors: Renato D. C. Monteiro, Camilo Ortiz, B. F. 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
Recommendations
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- First- and second-order methods for semidefinite programming
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- An alternating direction method for solving convex nonlinear semidefinite programming problems
convex optimizationcomplexitysemi-definite programmingconic optimizationextra-gradient methodblock-decomposition method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Semidefinite programming (90C22) Decomposition methods (49M27)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Benchmarking optimization software with performance profiles.
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Regularization methods for semidefinite programming
- Convex Analysis
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- 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 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
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- On the maximal monotonicity of subdifferential mappings
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- A boundary point method to solve semidefinite programs
- Maximal monotone operators, convex functions and a special family of enlargements
- A family of enlargements of maximal monotone operators
Cited In (14)
- A novel approach for solving semidefinite programs
- A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- Covariate regularized community detection in sparse graphs
- 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
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- 2EBD-HPE
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Conic optimization via operator splitting and homogeneous self-dual embedding
- 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
Uses Software
This page was built for publication: A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892382)
