Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data

Multi-objective and goal programming (90C29) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41) Robustness in mathematical programming (90C17)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Semidefinite Programming
Convex Analysis
Theory and Applications of Robust Optimization
Multicriteria Optimization
Duality in robust optimization: Primal worst equals dual best
Robust convex optimization
A convex polynomial that is not sos-convex
A Frank--Wolfe type theorem for convex polynomial programs
Improved \(\varepsilon\)-constraint method for multiobjective programming
Robust multiobjective optimization with application to Internet routing
Robust convex quadratically constrained programs
Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
Extremal psd forms with few terms
Semidefinite representation of convex sets
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
Convexity in SemiAlgebraic Geometry and Polynomial Optimization
A complete characterization of the gap between convexity and sos-convexity
Robust SOS-convex polynomial optimization problems: exact SDP relaxations
Optimality and duality for robust multiobjective optimization problems
Some robust convex programs without a duality gap
SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs

Cited In (14)

Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
Minimax programming as a tool for studying robust multi-objective optimization problems
Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
A utopia point method-based robust vector polynomial optimization scheme
Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
Well-posedness for the optimistic counterpart of uncertain vector optimization problems
Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
Multi-objective convex polynomial optimization and semidefinite programming relaxations
Characterizing a class of robust vector polynomial optimization via sum of squares conditions
Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
Robust second order cone conditions and duality for multiobjective problems under uncertainty data

Uses Software

SDPT3
CVX

This page was built for publication: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828872)