Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty

DOI10.1007/s10479-021-04461-xzbMath1502.90162OpenAlexW4206204751MaRDI QIDQ2108799

Yanyan Li

Publication date: 20 December 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04461-x

zbMATH Keywords

semidefinite programmingrelaxationoptimality conditionrobust optimizationmultiobjective program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)

Related Items (2)

On second-order conic programming duals for robust convex quadratic optimization problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions

Uses Software

• Matlab
• MOEA
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax robustness for multi-objective optimization problems
• Robustness in nonsmooth nonlinear multi-objective programming
• A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
• On general minimax theorems
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
• Semidefinite representation of convex sets
• Nonlinear multiobjective 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
• Robust multiobjective optimization with application to Internet routing
• Robustness in deterministic vector optimization
• Some geometric results in semidefinite programming
• An algorithmic approach to multiobjective optimization with decision uncertainty
• Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
• Pareto solutions in multicriteria optimization under uncertainty
• Robust aspects of solutions in deterministic multiple objective linear programming
• On robust multiobjective optimization
• A survey of recent developments in multiobjective optimization
• Deriving robust counterparts of nonlinear uncertain inequalities
• Lectures on Modern Convex Optimization
• WHAT IS...a Spectrahedron?
• Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Theory and Applications of Robust Optimization
• Duality in Vector Optimization
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Isolated efficiency in nonsmooth semi-infinite multi-objective programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
• Multicriteria Optimization
• Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
• Convex Analysis
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

This page was built for publication: Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty