Douglas-Rachford splitting method for semidefinite programming
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1791164 (Why is no real title available?)
- A Dual Approach to Semidefinite Least-Squares Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- A boundary point method to solve semidefinite programs
- A family of operator splitting methods revisited
- A simple proof for some important properties of the projection mapping
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices
- Computing a nearest symmetric positive semidefinite matrix
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- High-accuracy solution of large-scale semidefinite programs
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Inexact implicit methods for monotone general variational inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Matrix-free interior point method for compressed sensing problems
- Merit functions for semi-definite complementarity problems
- New properties of forward-backward splitting and a practical proximal-descent algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Regularization methods for semidefinite programming
- Semidefinite Programming
- Semidefinite optimization
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Solving semidefinite programming problems via alternating direction methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Testing Unconstrained Optimization Software
- The proximal point algorithm revisited
- Two-Metric Projection Methods for Constrained Optimization
Cited in
(10)- New inertial factors of the Krasnosel'skiĭ-Mann iteration
- Anderson Accelerated Douglas--Rachford Splitting
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Weak convergence of an extended splitting method for monotone inclusions
- Exact and inexact Douglas–Rachford splitting methods for solving large-scale sparse absolute value equations
- 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)
