Robust second order cone conditions and duality for multiobjective problems under uncertainty data
DOI10.1007/s10898-023-01335-3OpenAlexW4391077560WikidataQ129595522 ScholiaQ129595522MaRDI QIDQ6203549
Thai Doan Chuong, Cao Thanh Tinh
Publication date: 5 April 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-023-01335-3
multiobjective optimizationoptimality conditionrobust optimizationsecond-order cone programmingconvex polynomial
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of polynomial optimization in operations research and real-time decision making
- Minmax robustness for multi-objective optimization problems
- Robustness in nonsmooth nonlinear multi-objective programming
- 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
- Portfolio optimization under partial uncertainty and incomplete information: a probability multimeasure-based approach
- 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
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Approximating Pareto curves using semidefinite relaxations
- 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
- Robust aspects of solutions in deterministic multiple objective linear programming
- Non-convex multi-objective optimization
- On robust multiobjective optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Theory and Applications of Robust Optimization
- 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
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Convex Analysis
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Optimality and duality for robust multiobjective optimization problems
This page was built for publication: Robust second order cone conditions and duality for multiobjective problems under uncertainty data
