Cited in
(15)- 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
- DISCO
- 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
- A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming
- 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 software: 2EBD-HPE
