Pages that link to "Item:Q4377577"
From MaRDI portal
The following pages link to Strong Duality for Semidefinite Programming (Q4377577):
Displayed 27 items.
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- A regularized strong duality for nonsymmetric semidefinite least squares problem (Q644518) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- The minimal cone for conic linear programming (Q766252) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Characterization of the barrier parameter of homogeneous convex cones (Q1290599) (← links)
- Eigenvalue-constrained faces (Q1375525) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563) (← links)
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems (Q2466781) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- Strong duality for inexact linear programming (Q2720275) (← links)
- Embedding methods for semidefinite programming (Q2885491) (← links)
- Understanding linear semi-infinite programming via linear programming over cones (Q3066933) (← links)
- Knowledge-based semidefinite linear programming classifiers (Q3423589) (← links)
- A closedness condition and its applications to DC programs with convex constraints (Q3577846) (← links)
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION (Q3636562) (← links)
- Duality for semi-definite and semi-infinite programming (Q4467176) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)
- Duality for inexact semi-infinite linear programming (Q5466702) (← links)