Linear programming with positive semi-definite matrices
From MaRDI portal
Recommendations
Cited in
(16)- Optimization Problems over Positive Pseudopolynomial Matrices
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- On the existence of positive non‐extreme point solutions of linear programming
- Strict Linear Programs and Tight Matrices
- Sign consistent linear programming problems
- Two-phase simplex method for linear semidefinite optimization
- Understanding badly and well-behaved linear matrix inequalities via semi-infinite optimization
- scientific article; zbMATH DE number 2063456 (Why is no real title available?)
- A pivoting procedure for a class of second-order cone programming
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
- Linear quadratic programming in oriented matroids
- Extremal problems on the set of nonnegative definite matrices
- A variant of the dual simplex method for a linear semidefinite programming problem
- A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
- Some topics in nonlinear positive semi-definite programming
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
This page was built for publication: Linear programming with positive semi-definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286269)
