Pages that link to "Item:Q1346137"
From MaRDI portal
The following pages link to Problems of distance geometry and convex properties of quadratic maps (Q1346137):
Displayed 11 items.
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- On the S-procedure and some variants (Q857821) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay (Q885768) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- On convex generalized systems (Q1573992) (← links)
- Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)