The following pages link to (Q4524522):
Displaying 7 items.
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs (Q1771100) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← 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)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- Knowledge-based semidefinite linear programming classifiers (Q3423589) (← links)
