Douglas-Rachford splitting method for semidefinite programming

DOI10.1007/S12190-015-0920-8zbMATH Open1338.90250OpenAlexW1164814491MaRDI QIDQ295495FDOQ295495

Authors: Yunda Dong 

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

Recommendations

• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
• A Douglas-Rachford splitting method for solving equilibrium problems
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
• A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
• A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
• The strong convergence of Douglas-Rachford methods for the split feasibility problem
• A splitting method for separable convex programming
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

zbMATH Keywords

convergencesemidefinite programmingiteration complexityDouglas-Rachford splitting method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Semidefinite programming (90C22)

Cites Work

• Testing Unconstrained Optimization Software
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Title not available (Why is that?)
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A Newton-CG augmented Lagrangian method for semidefinite programming
• A Spectral Bundle Method for Semidefinite Programming
• Regularization methods for semidefinite programming
• Semidefinite Programming
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
• Computing a nearest symmetric positive semidefinite matrix
• The proximal point algorithm revisited
• Semidefinite optimization
• Alternating direction augmented Lagrangian methods for semidefinite programming
• New properties of forward-backward splitting and a practical proximal-descent algorithm
• Two-Metric Projection Methods for Constrained Optimization
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• A Dual Approach to Semidefinite Least-Squares Problems
• A simple proof for some important properties of the projection mapping
• A boundary point method to solve semidefinite programs
• Inexact implicit methods for monotone general variational inequalities
• Merit functions for semi-definite complementarity problems
• Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices
• Solving semidefinite programming problems via alternating direction methods
• Title not available (Why is that?)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• High-accuracy solution of large-scale semidefinite programs
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Matrix-free interior point method for compressed sensing problems
• A family of operator splitting methods revisited

Cited In (10)

• Anderson Accelerated Douglas--Rachford Splitting
• New inertial factors of the Krasnosel'skiĭ-Mann iteration
• Operator splitting performance estimation: tight contraction factors and optimal parameter selection
• Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
• Weak convergence of an extended splitting method for monotone inclusions
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
• Extended splitting methods for systems of three-operator monotone inclusions with continuous operators
• A new splitting method for systems of monotone inclusions in Hilbert spaces
• A new splitting method for monotone inclusions of three operators

This page was built for publication: Douglas-Rachford splitting method for semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295495)