Pages that link to "Item:Q4377577"
From MaRDI portal
The following pages link to Strong Duality for Semidefinite Programming (Q4377577):
Displaying 50 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- 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)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← 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)
- Modularity maximization using completely positive programming (Q1620447) (← links)
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach (Q1695816) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming (Q1781864) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
- A note on the minimal cone for conic linear programming (Q2018866) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Strong duality for standard convex programs (Q2074838) (← links)
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (Q2115314) (← links)
- On strong duality in linear copositive programming (Q2149604) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- Reduction of SISO H-infinity output feedback control problem (Q2228115) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← 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)
- An exact explicit dual for the linear copositive programming problem (Q2679002) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- Strong duality for inexact linear programming (Q2720275) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Embedding methods for semidefinite programming (Q2885491) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← 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)
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method (Q4645921) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
