Multi-objective convex polynomial optimization and semidefinite programming relaxations

DOI10.1007/s10898-020-00969-xzbMath1475.90093arXiv1903.10137OpenAlexW3120476505MaRDI QIDQ2038921

Nithirat Sisarat, Jae Hyoung Lee, Liguo Jiao

Publication date: 7 July 2021

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

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

zbMATH Keywords

multi-objective optimizationsemidefinite programminghybrid methodconvex polynomial optimizationflat truncation conditionsum-of-squares of polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Multi-objective and goal programming (90C29) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Related Items (4)

Solvability of a regular polynomial vector optimization problem without convexity ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ A utopia point method-based robust vector polynomial optimization scheme ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints

Uses Software

• GloptiPoly
• ParetoImageSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A convex polynomial that is not sos-convex
• A semidefinite programming approach for solving multiobjective linear programming
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
• Semidefinite representation of convex sets
• A note on boundaries of open polynomial images of \(\mathbb R^2\)
• The \(K\)-moment problem for compact semi-algebraic sets
• Sums of squares on real algebraic curves
• A Frank--Wolfe type theorem for convex polynomial programs
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
• Approximating the Pareto set of multiobjective linear programs via robust optimization
• Approximating Pareto curves using semidefinite relaxations
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
• Existence of efficient and properly efficient solutions to problems of constrained vector optimization
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
• On the existence of Pareto solutions for polynomial vector optimization problems
• Distinguished representations of non-negative polynomials
• Linear programming using MATLAB
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Polynomial and regular images of \(\mathbb R^n\)
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
• Global Optimization with Polynomials and the Problem of Moments
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• On Complements of Convex Polyhedra as Polynomial and Regular Images of ℝn
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Multiobjective Linear Programming
• Genericity in Polynomial Optimization
• GloptiPoly 3: moments, optimization and semidefinite programming
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• Positive polynomials on semi-algebraic sets
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Optimality Conditions for Minimizers at Infinity in Polynomial Programming
• Algebraic Degree of Polynomial Optimization
• Multicriteria Optimization
• Optimization of Polynomials on Compact Semialgebraic Sets

This page was built for publication: Multi-objective convex polynomial optimization and semidefinite programming relaxations