Solving semidefinite programming problems via alternating direction methods
From MaRDI portal
Publication:2493944
DOI10.1016/J.CAM.2005.07.002zbMATH Open1098.65069OpenAlexW2076577053MaRDI QIDQ2493944FDOQ2493944
Authors: Zhensheng Yu 
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
Recommendations
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- Projection and contraction methods for semidefinite programming
- A novel approach for solving semidefinite programs
- Solving large-scale least squares semidefinite programming by alternating direction methods
convergencealgorithmsemidefinite programmingalternating direction methodprojection equationprimal-dual optimality conditions
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semidefinite programming (90C22)
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Title not available (Why is that?)
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A new inexact alternating directions method for monotone variational inequalities
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A new method for a class of linear variational inequalities
- An approach to nonlinear programming
- A modified alternating direction method for convex minimization problems
- Merit functions for semi-definite complementarity problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Solving a class of linear projection equations
- Solving a class of asymmetric variational inequalities by a new alternating direction method
- Projection and contraction methods for semidefinite programming
Cited In (22)
- A novel approach for solving semidefinite programs
- An alternating projection algorithm for finding feasible points of block-diagonal semidefinite constraints
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- A method for weighted projections to the positive definite cone
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Douglas-Rachford splitting method for semidefinite programming
- Title not available (Why is that?)
- A unified class of directly solvable semidefinite programming problems
- Improving an alternating projection algorithm for semidefinite programming feasibility problem and an implementation for second-order cones
- Solving large-scale least squares semidefinite programming by alternating direction methods
- An alternating direction method for second-order conic programming
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
- Alternating direction method for bi-quadratic programming
- An alternating direction method for convex quadratic second-order cone programming with bounded constraints
- Applications of the alternating direction method of multipliers to the semidefinite inverse quadratic eigenvalue problem with a partial eigenstructure
- Efficient semidefinite programming with approximate ADMM
- A conjugate gradient method for solving semidefinite programming
- A note on alternating projections for ill-posed semidefinite feasibility problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Block coordinate descent methods for semidefinite programming
This page was built for publication: Solving semidefinite programming problems via alternating direction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493944)
