4.6 Article Proceedings Paper

Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems

Jae Hyoung Lee et al.

ANNALS OF OPERATIONS RESEARCH (2018)

Article Operations Research & Management Science

Robust multiobjective optimization with application to Internet routing

Erin K. Doolittle et al.

ANNALS OF OPERATIONS RESEARCH (2018)

Article Operations Research & Management Science

Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data

Jae Hyoung Lee et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2018)

Article Operations Research & Management Science

Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization

Thai Doan Chuong

OPERATIONS RESEARCH LETTERS (2017)

Article Operations Research & Management Science

Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

Jonas Ide et al.

OR SPECTRUM (2016)

Article Mathematics, Applied

Optimality and duality for robust multiobjective optimization problems

Thai Doan Chuong

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS (2016)

Article Operations Research & Management Science

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

V. Jeyakumar et al.

OPTIMIZATION LETTERS (2015)

Article Mathematics, Applied

A COMPLETE CHARACTERIZATION OF THE GAP BETWEEN CONVEXITY AND SOS-CONVEXITY

Amir Ali Ahmadi et al.

SIAM JOURNAL ON OPTIMIZATION (2013)

Article Computer Science, Software Engineering

A convex polynomial that is not sos-convex

Amir Ali Ahmadi et al.

MATHEMATICAL PROGRAMMING (2012)

Article Mathematics, Applied

Theory and Applications of Robust Optimization

Dimitris Bertsimas et al.

SIAM REVIEW (2011)

Article Computer Science, Software Engineering

Semidefinite representation of convex sets

J. William Helton et al.

MATHEMATICAL PROGRAMMING (2010)

Article Operations Research & Management Science

Duality in robust optimization: Primal worst equals dual best

Amir Beck et al.

OPERATIONS RESEARCH LETTERS (2009)

Article Mathematics, Applied

CONVEXITY IN SEMIALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION

Jean B. Lasserre

SIAM JOURNAL ON OPTIMIZATION (2009)

Article Operations Research & Management Science

Improved ε-constraint method for multiobjective programming

M. Ehrgott et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2008)

Article Computer Science, Software Engineering

Robust convex quadratically constrained programs

D Goldfarb et al.

MATHEMATICAL PROGRAMMING (2003)

Article Operations Research & Management Science

A Frank-Wolfe type theorem for convex polynomial programs

EG Belousov et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2002)