A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
From MaRDI portal
Publication:1984696
DOI10.1016/j.orl.2020.02.003OpenAlexW3008311013MaRDI QIDQ1984696
Liguo Jiao, Jae Hyoung Lee, Yu Ying Zhou
Publication date: 7 April 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2020.02.003
Related Items (5)
A utopia point method-based robust vector polynomial optimization scheme ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints
Uses Software
Cites Work
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- A Frank--Wolfe type theorem for convex polynomial programs
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Inequality systems and global optimization
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Characterizations of solution sets of convex vector minimization problems
- Lectures on Modern Convex Optimization
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Semidefinite Programming
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- Multicriteria Optimization
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
