Solving semidefinite programming problems via alternating direction methods
From MaRDI portal
(Redirected from Publication:2493944)
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
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3919744 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A modified alternating direction method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- A new method for a class of linear variational inequalities
- An Interior-Point Method for Semidefinite Programming
- An approach to nonlinear programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Merit functions for semi-definite complementarity problems
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Projection and contraction methods for semidefinite programming
- Semidefinite Programming
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Solving a class of asymmetric variational inequalities by a new alternating direction method
- Solving a class of linear projection equations
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
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A method for weighted projections to the positive definite cone
- Douglas-Rachford splitting method for semidefinite programming
- scientific article; zbMATH DE number 1559105 (Why is no real title available?)
- 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 note on alternating projections for ill-posed semidefinite feasibility problems
- A conjugate gradient method for solving semidefinite programming
- 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)
