Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
From MaRDI portal
Recommendations
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
Cited in
(11)- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- A utopia point method-based robust vector polynomial optimization scheme
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
- Optimality and solutions for conic robust multiobjective programs
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
This page was built for publication: Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045850)
