Pages that link to "Item:Q4645921"
From MaRDI portal
The following pages link to Cone-LP's and semidefinite programs: Geometry and a simplex-type method (Q4645921):
Displayed 12 items.
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials (Q317123) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- Primal Newton method for the linear cone programming problem (Q1644012) (← links)
- A variant of the dual simplex method for a linear semidefinite programming problem (Q1744997) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- Two-phase simplex method for linear semidefinite optimization (Q2010151) (← links)
- A variant of the affine-scaling method for a second-order cone program (Q2424199) (← links)
- The dual simplex-type method for linear second-order cone programming problem (Q2679794) (← links)
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization (Q2802529) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- Exact Recovery with Symmetries for the Doubly Stochastic Relaxation (Q4554591) (← links)