A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
From MaRDI portal
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)
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
Cites work
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A boundary point method to solve semidefinite programs
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A family of enlargements of maximal monotone operators
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Benchmarking optimization software with performance profiles.
- 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
- Convex Analysis
- Enlargement of monotone operators with applications to variational inequalities
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Maximal monotone operators, convex functions and a special family of enlargements
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the maximal monotonicity of subdifferential mappings
- Regularization methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Cited in
(14)- 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
- 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
- A novel approach for solving semidefinite programs
- 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
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Conic optimization via operator splitting and homogeneous self-dual embedding
- A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
- 2EBD-HPE
- Covariate regularized community detection in sparse graphs
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
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)
