Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
type: Item
instance of: scholarly article
title: Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
zbMATH Open document ID: 1502.90162
author: Yanyan Li
published in: Annals of Operations Research
publication date: 2022-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7634698
zbMATH Keywords: multiobjective program
zbMATH Keywords: robust optimization
zbMATH Keywords: optimality condition
zbMATH Keywords: semidefinite programming
zbMATH Keywords: relaxation
describes a project that uses: Matlab
describes a project that uses: MOEA
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s10479-021-04461-x
OpenAlex ID: W4206204751
cites work: Deriving robust counterparts of nonlinear uncertain inequalities
cites work: Q3182207
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Theory and Applications of Robust Optimization
cites work: Semidefinite Optimization and Convex Algebraic Geometry
cites work: Duality in Vector Optimization
cites work: A survey of recent developments in multiobjective optimization
cites work: Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
cites work: Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
cites work: Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
cites work: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
cites work: Robust multiobjective optimization with application to Internet routing
cites work: Multicriteria Optimization
cites work: Minmax robustness for multi-objective optimization problems
cites work: An algorithmic approach to multiobjective optimization with decision uncertainty
cites work: Pareto solutions in multicriteria optimization under uncertainty
cites work: Robust aspects of solutions in deterministic multiple objective linear programming
cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
cites work: Semidefinite representation of convex sets
cites work: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
cites work: Q4461359
cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
cites work: Strong Duality in Robust Convex Programming: Complete Characterizations
cites work: On robust multiobjective optimization
cites work: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
cites work: On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
cites work: Nonlinear multiobjective optimization
cites work: A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
cites work: Isolated efficiency in nonsmooth semi-infinite multi-objective programming
cites work: Robustness in deterministic vector optimization
cites work: Some geometric results in semidefinite programming
cites work: Convex Analysis
cites work: On general minimax theorems
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Q3815146
cites work: What is \dots a spectrahedron?
cites work: Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
cites work: Q3149262
cites work: Robustness in nonsmooth nonlinear multi-objective programming
cites work: Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality
DOI: 10.1007/S10479-021-04461-X
description: scientific article; zbMATH DE number 7634698