Pages that link to "Item:Q3146531"
From MaRDI portal
The following pages link to The Gauss-Newton direction in semidefinite programming (Q3146531):
Displaying 11 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization (Q2706359) (← links)
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision (Q4943940) (← links)
- A robust algorithm for semidefinite programming (Q5200556) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)