Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty

DOI10.1007/S10898-012-9857-8zbMath1288.90058OpenAlexW2017029758MaRDI QIDQ1941033

Guoyin Li, Vaithilingam Jeyakumar

Publication date: 11 March 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9857-8

zbMATH Keywords

robust optimizationglobal optimality conditionsrobust solutionssingle quadratic constraintnonconvex quadratic programming under uncertainty

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ Unnamed Item ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ Global optimality condition for quadratic optimization problems under data uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
• Robust Farkas' lemma for uncertain linear systems with applications
• Robust linear optimization under general norms.
• On the S-procedure and some variants
• On a subproblem of trust region algorithms for constrained optimization
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Stochastic programming approach to optimization under uncertainty
• Selected topics in robust convex optimization
• Handbook of global optimization. Vol. 2
• A note on quadratic forms
• Robust optimization-methodology and applications
• Convexity of quadratic transformations and its use in control and optimization
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
• Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
• Lectures on Modern Convex Optimization
• Constructing Uncertainty Sets for Robust Linear Optimization
• Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
• Lectures on Stochastic Programming
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• New Results on Quadratic Minimization
• Transmit beamforming for physical-layer multicasting
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
• A Survey of the S-Lemma
• On the mapping of quadratic forms

This page was built for publication: Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty