Solving semidefinite programming problems via alternating direction methods
From MaRDI portal
Publication:2493944
DOI10.1016/j.cam.2005.07.002zbMath1098.65069OpenAlexW2076577053MaRDI QIDQ2493944
Publication date: 16 June 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.07.002
algorithmconvergencesemidefinite programmingalternating direction methodprojection equationprimal-dual optimality conditions
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonlinear programming (90C30)
Related Items (10)
Douglas-Rachford splitting method for semidefinite programming ⋮ A method for weighted projections to the positive definite cone ⋮ An alternating direction method for second-order conic programming ⋮ An alternating direction method for convex quadratic second-order cone programming with bounded constraints ⋮ A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ An equivalency condition of nonsingularity in nonlinear semidefinite programming ⋮ Alternating direction method for bi-quadratic programming ⋮ Block Coordinate Descent Methods for Semidefinite Programming ⋮ A novel approach for solving semidefinite programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Merit functions for semi-definite complementarity problems
- Projection and contraction methods for semidefinite programming
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- Solving a class of asymmetric variational inequalities by a new alternating direction method
- A new inexact alternating directions method for monotone variational inequalities
- A modified alternating direction method for convex minimization problems
- An approach to nonlinear programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Solving semidefinite programming problems via alternating direction methods
