Robust second order cone conditions and duality for multiobjective problems under uncertainty data

Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

Approximating Pareto curves using semidefinite relaxations
Convex Analysis
Nonlinear multiobjective optimization
Title not available (Why is that?)
Theory and Applications of Robust Optimization
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Multicriteria Optimization
Semidefinite Optimization and Convex Algebraic Geometry
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
On general minimax theorems
Some applications of polynomial optimization in operations research and real-time decision making
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
On robust multiobjective optimization
Minmax robustness for multi-objective optimization problems
Robust aspects of solutions in deterministic multiple objective linear programming
Robustness in nonsmooth nonlinear multi-objective programming
Semidefinite representation of convex sets
Portfolio optimization under partial uncertainty and incomplete information: a probability multimeasure-based approach
A complete characterization of the gap between convexity and sos-convexity
Deriving robust counterparts of nonlinear uncertain inequalities
Approximating the Pareto set of multiobjective linear programs via robust optimization
Optimality and duality for robust multiobjective optimization problems
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
Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
Title not available (Why is that?)
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
Non-convex multi-objective optimization
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
Second-order cone programming relaxations for a class of multiobjective convex polynomial problems

This page was built for publication: Robust second order cone conditions and duality for multiobjective problems under uncertainty data

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