A utopia point method-based robust vector polynomial optimization scheme
From MaRDI portal
Publication:6154404
DOI10.1007/S10898-023-01321-9arXiv2209.04885MaRDI QIDQ6154404FDOQ6154404
Authors: Tianyi Han, Liguo Jiao, Jae Hyoung Lee, Junping Yin 
Publication date: 15 February 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: In this paper, we focus on a class of robust vector polynomial optimization problems (RVPOP in short) without any convex assumptions. By combining/improving the utopia point method (a nonlinear scalarization) for vector optimization and "joint+marginal" relaxation method for polynomial optimization, we solve the RVPOP successfully. Both theoratical and computational aspects are considered.
Full work available at URL: https://arxiv.org/abs/2209.04885
Recommendations
- scientific article; zbMATH DE number 2190135
- Robust vector optimization with a variable domination structure
- scientific article; zbMATH DE number 2143160
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Theory of multiobjective optimization
- Graph implementations for nonsmooth convex programs
- Theory and applications of robust optimization
- Robust optimization
- Linear Multiple Objective Problems with Interval Coefficients
- Multicriteria Optimization
- Duality in robust optimization: Primal worst equals dual best
- Vector Optimization
- Moments, positive polynomials and their applications
- GloptiPoly 3: moments, optimization and semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Selected topics in robust convex optimization
- Robust optimization-methodology and applications
- Optimality conditions and finite convergence of Lasserre's hierarchy
- A ``joint+marginal approach to parametric polynomial optimization
- On robust multiobjective optimization
- Linear optimization with cones of moments and nonnegative polynomials
- An introduction to polynomial and semi-algebraic optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Min-max and robust polynomial optimization
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- 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
- Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154404)
