A utopia point method-based robust vector polynomial optimization scheme

DOI10.1007/s10898-023-01321-9arXiv2209.04885MaRDI QIDQ6154404

Jun-ping Yin, Tianyi Han, Jae Hyoung Lee, Liguo Jiao

Publication date: 15 February 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.04885

zbMATH Keywords

vector optimizationpolynomial optimizationrobust counterpartSDP relaxationsutopia point method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Min-max and robust polynomial optimization
• Linear optimization with cones of moments and nonnegative polynomials
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
• Selected topics in robust convex optimization
• Duality in robust optimization: Primal worst equals dual best
• Theory of multiobjective optimization
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
• Robust optimization-methodology and applications
• An algorithm for semi-infinite polynomial optimization
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
• Multi-objective convex polynomial optimization and semidefinite programming relaxations
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
• Certifying convergence of Lasserre's hierarchy via flat truncation
• On robust multiobjective optimization
• Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Graph Implementations for Nonsmooth Convex Programs
• A “Joint+Marginal” Approach to Parametric Polynomial Optimization
• Vector Optimization
• Theory and Applications of Robust Optimization
• GloptiPoly 3: moments, optimization and semidefinite programming
• Linear Multiple Objective Problems with Interval Coefficients
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Multicriteria Optimization
• Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• A new scheme for approximating the weakly efficient solution set of vector rational optimization problems

This page was built for publication: A utopia point method-based robust vector polynomial optimization scheme