Douglas-Rachford splitting method for semidefinite programming
From MaRDI portal
Publication:295495
DOI10.1007/s12190-015-0920-8zbMath1338.90250OpenAlexW1164814491MaRDI QIDQ295495
Publication date: 13 June 2016
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-015-0920-8
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
New inertial factors of the Krasnosel'skiĭ-Mann iteration ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ A new splitting method for monotone inclusions of three operators ⋮ Weak convergence of an extended splitting method for monotone inclusions ⋮ A new splitting method for systems of monotone inclusions in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Matrix-free interior point method for compressed sensing problems
- A boundary point method to solve semidefinite programs
- A family of operator splitting methods revisited
- Computing a nearest symmetric positive semidefinite matrix
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Merit functions for semi-definite complementarity problems
- Inexact implicit methods for monotone general variational inequalities
- The proximal point algorithm revisited
- Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Solving semidefinite programming problems via alternating direction methods
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Two-Metric Projection Methods for Constrained Optimization
- Semidefinite optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Testing Unconstrained Optimization Software
- A Spectral Bundle Method for Semidefinite Programming
- A Dual Approach to Semidefinite Least-Squares Problems
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- A simple proof for some important properties of the projection mapping
- Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- High-accuracy solution of large-scale semidefinite programs
- Solving Lift-and-Project Relaxations of Binary Integer Programs
