The following pages link to ParetoImageSDP (Q39908):
Displaying 13 items.
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- On the existence of Pareto solutions for polynomial vector optimization problems (Q2316622) (← links)
- Operator systems and convex sets with many normal cones (Q4609974) (← links)
- Time-Varying Semidefinite Programs (Q4958555) (← links)
- Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (Q5232243) (← links)
- Volume of Sublevel Sets of Homogeneous Polynomials (Q5234531) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
