Exact SDP relaxation for classes of nonlinear semidefinite programming problems

von Jeyakumar, Vaithilingam
Veröffentlicht in Operations research letters (2012)

New strong duality results for convex programs with separable constraints

von Jeyakumar, V.
Veröffentlicht in European journal of operational research (2010)

Virtual Scenarios for Pedestrian Research: A Matter of Complexity?

von Schneider, Sonja
Veröffentlicht in VAMR (12. : 2020 : Online) Virtual, augmented and mixed reality ; Part 1: Design and interaction (2020)

Farkas' lemma for separable sublinear inequalities without qualifications

von Jeyakumar, V.
Veröffentlicht in Optimization letters (2009)

Characterizing robust set containments and solutions of uncertain linear programs without qualifications

von Jeyakumar, V.
Veröffentlicht in Operations research letters (2010)

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs

von Jeyakumar, Vaithilingam
Veröffentlicht in Operations research letters (2015)

Strong duality for robust minimax fractional programming problems

von Jeyakumar, Vaithilingam
Veröffentlicht in European journal of operational research (2013)

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty

von Jeyakumar, V.
Veröffentlicht in Operations research letters (2011)

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

von Jeyakumar, Vaithilingam
Veröffentlicht in Operations research letters (2014)

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality

von Chieu, N. H.
Veröffentlicht in European journal of operational research (2020)

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems

von Chieu, N. H.
Veröffentlicht in Operations research letters (2017)

Constraint qualifications for convex optimization without convexity of constraints : new connections and applications to best approximation

von Chieu, N. H.
Veröffentlicht in European journal of operational research (162018)

Robust solutions to multi-objective linear programs with uncertain data

Veröffentlicht in European journal of operational research (2015)

The radius of robust feasibility of uncertain mathematical programs : a survey and recent developments

von Goberna, Miguel A.
Veröffentlicht in European journal of operational research (2022)

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs

von Goberna, M. A.
Veröffentlicht in European journal of operational research (12018)

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints

von Chieu, N. H.
Veröffentlicht in Operations research letters (2019)