scientific article; zbMATH DE number 3737415
From MaRDI portal
Publication:3923971
Cited in
(19)- The nonnegative MINQUE estimate
- Explicit solutions for interval semidefinite linear programs
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Some geometric results in semidefinite programming
- A simple constraint qualification in infinite dimensional programming
- A note on the SDP relaxation of the minimum cut problem
- The minimal cone for conic linear programming
- Lagrangian duality in convex conic programming with simple proofs
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Preprocessing and regularization for degenerate semidefinite programs
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Error bounds and singularity degree in semidefinite programming
- Regularizing the abstract convex program
- Generalizations of Slater's constraint qualification for infinite convex programs
- Validating numerical semidefinite programming solvers for polynomial invariants
- A strengthened test for optimality
- Some applications of optimization in matrix theory
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- Strong duality and minimal representations for cone optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923971)
