scientific article; zbMATH DE number 2102031

zbMATH Open1095.90588MaRDI QIDQ4817262FDOQ4817262

Authors: Aharon Ben-Tal, Arkadi Nemirovski 

Publication date: 22 September 2004

Title of this publication is not available (Why is that?)

Recommendations

• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Robust Solutions to Uncertain Semidefinite Programs
• Robust solutions of uncertain linear programs
• Robust solutions of uncertain complex-valued quadratically constrained programs
• On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Cited In (17)

• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
• A robustification approach in unconstrained quadratic optimization
• On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
• General robust-optimization formulation for nonlinear programming
• Robust nonlinear optimization with conic representable uncertainty set
• Strong duality in robust semi-definite linear programming under data uncertainty
• Title not available (Why is that?)
• A practicable robust counterpart formulation for decomposable functions: a network congestion case study
• Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
• Robust solutions of uncertain complex-valued quadratically constrained programs
• Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
• Data-driven robust optimization using deep neural networks
• Robust and reliable portfolio optimization formulation of a chance constrained problem
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
• On quasi \(\epsilon\)-solution for robust convex optimization problems
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs

This page was built for publication:

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