A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos

DOI10.1007/s40305-012-0001-8zbMath1277.90088OpenAlexW1988924863WikidataQ123283121 ScholiaQ123283121MaRDI QIDQ384218

Ya-Xiang Yuan

Publication date: 27 November 2013

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-012-0001-8

zbMATH Keywords

conjecturecounter-examplerobust solutionquadratic constrained optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Probability Bounds for Polynomial Functions in Random Variables

Cites Work

• An improved probability bound for the approximate S-lemma
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

This page was built for publication: A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos