Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials

DOI10.11650/tjm/190101zbMath1427.90252OpenAlexW2909763799MaRDI QIDQ2279398

Jae Hyoung Lee, Liguo Jiao

Publication date: 12 December 2019

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.twjm/1546938169

zbMATH Keywords

semidefinite programmingmulticriteria optimization\(\epsilon\)-constraint methodSOS-convex polynomials

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Multi-objective and goal programming (90C29) Convex functions and convex programs in convex geometry (52A41)

Related Items (8)

Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• A convex polynomial that is not sos-convex
• A semidefinite programming approach for solving multiobjective linear programming
• Semidefinite representation of convex sets
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Scalarization of vector optimization problems
• Extremal psd forms with few terms
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• A Frank--Wolfe type theorem for convex polynomial programs
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Primal-dual simplex method for multiobjective linear programming
• Lectures on Modern Convex Optimization
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• Multiobjective Linear Programming
• Vector Optimization
• Scalarization in vector optimization
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• Finding all efficient extreme points for multiple objective linear programs
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Multicriteria Optimization
• An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials