Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
From MaRDI portal
Publication:2279398
Recommendations
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
- Determination of satisfying and efficient solutions in convex multi-objective programming
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- scientific article; zbMATH DE number 6612741
- scientific article; zbMATH DE number 5823944
- Finding a minimal efficient solution of a convex multiobjective program
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
Cites work
- A complete characterization of the gap between convexity and sos-convexity
- A convex polynomial that is not sos-convex
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A Frank--Wolfe type theorem for convex polynomial programs
- A new class of alternative theorems for SOS-convex inequalities and robust optimization
- A semidefinite programming approach for solving multiobjective linear programming
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Extremal psd forms with few terms
- Finding all efficient extreme points for multiple objective linear programs
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Moments, positive polynomials and their applications
- Multicriteria Optimization
- Multiobjective linear programming. An introduction
- Nonlinear programming
- Primal-dual simplex method for multiobjective linear programming
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite representation of convex sets
- Sums of squares characterizations of containment of convex semialgebraic sets
- Sums of squares, moment matrices and optimization over polynomials
- Vector Optimization
Cited in
(12)- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- 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
- 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
- On robust optimal solutions for a class of uncertain fractional polynomial optimization problems
- Merit function as a tool for vector polynomial optimization over an LMI constraint
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
This page was built for publication: Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279398)
