An improved probability bound for the approximate S-lemma

DOI10.1016/J.ORL.2007.02.003zbMATH Open1166.60304OpenAlexW1997332715WikidataQ124827917 ScholiaQ124827917MaRDI QIDQ2467445FDOQ2467445

Authors: Kürşad Derinkuyu, Ahmet Camcı, Mustafa Ç. Pınar 

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23340

Recommendations

• scientific article; zbMATH DE number 3894191
• Improved bounds for approximations to compound distributions
• A concentration bound for stochastic approximation via Alekseev's formula
• Improved algorithms via approximations of probability distributions (extended abstract)
• Approximation error bounds via Rademacher's complexity
• Efficient computation of tight approximations to Chernoff bounds
• Concentration bounds for stochastic approximations
• A probabilistic approach to problems parameterized above or below tight bounds
• A probabilistic approach to problems parameterized above or below tight bounds
• An improved lower bound related to the Furstenberg-Sárközy theorem

zbMATH Keywords

robust optimizationS-lemma

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Distribution theory (60E99)

Cites Work

• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization

Cited In (4)

• On the S-procedure and some variants
• A note on random signs
• A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos
• A new series of conjectures and open questions in optimization and matrix analysis

This page was built for publication: An improved probability bound for the approximate S-lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467445)