The Gauss-Newton direction in semidefinite programming
From MaRDI portal
Recommendations
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Some new search directions for primal-dual interior point methods in semidefinite programming
- Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
- A robust algorithm for semidefinite programming
Cited in
(12)- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
- A robust algorithm for semidefinite programming
- Solving semidefinite programs using preconditioned conjugate gradients
- Error bounds and singularity degree in semidefinite programming
- Semidefinite programming and combinatorial optimization
- Semidefinite programming for discrete optimization and matrix completion problems
This page was built for publication: The Gauss-Newton direction in semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146531)
