Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
type: Item
instance of: scholarly article
title: Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
zbMATH Open document ID: 1288.90058
author: G. Li
author: V. Jeyakumar
published in: Journal of Global Optimization
publication date: 2013-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6143166
zbMATH Keywords: nonconvex quadratic programming under uncertainty
zbMATH Keywords: robust optimization
zbMATH Keywords: single quadratic constraint
zbMATH Keywords: robust solutions
zbMATH Keywords: global optimality conditions
MaRDI profile type: Publication
full work available at URL: s10898-012-9857-8
OpenAlex ID: W2017029758
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Robust optimization-methodology and applications
cites work: Q3182207
cites work: Selected topics in robust convex optimization
cites work: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
cites work: Constructing Uncertainty Sets for Robust Linear Optimization
cites work: Robust linear optimization under general norms.
cites work: Q4821526
cites work: On the S-procedure and some variants
cites work: On the mapping of quadratic forms
cites work: Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
cites work: Characterizing robust set containments and solutions of uncertain linear programs without qualifications
cites work: Robust Farkas' lemma for uncertain linear systems with applications
cites work: Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
cites work: A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: Handbook of global optimization. Vol. 2
cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
cites work: A Survey of the S-Lemma
cites work: Convexity of quadratic transformations and its use in control and optimization
cites work: Stochastic programming approach to optimization under uncertainty
cites work: Lectures on Stochastic Programming
cites work: Transmit beamforming for physical-layer multicasting
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: Q5641059
cites work: New Results on Quadratic Minimization
cites work: On a subproblem of trust region algorithms for constrained optimization
cites work: A note on quadratic forms
DOI: 10.1007/S10898-012-9857-8
description: scientific article; zbMATH DE number 6143166