Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
type: Item
instance of: scholarly article
title: Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
zbMATH Open document ID: 0763.90070
DOI: 10.1016/0377-2217(92)90059-I
published in: European Journal of Operational Research
publication date: 1993-04-01T00:00:00Z
review text: Sufficient conditions for a convex quadratic function to be unbounded from above, and to be unbounded from below, over a feasible region defined by both convex and concave quadratic constraints, are given. It is shown that the conditions are necessary for the existence of upper bounds if the constraints are concave. A technique for checking the conditions which requires the solution of a finite number of linear programming problems is also presented.
reviewed by: Vincentiu Dumitru
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 149248
zbMATH Keywords: convex quadratic function
zbMATH Keywords: upper bounds
author: Richard J. Caron
author: W. T. Obuchowska
describes a project that uses: LINPACK
MaRDI profile type: Publication
cites work: A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
cites work: Q3932291
cites work: A Dual Method for Quadratic Programs with Quadratic Constraints
cites work: Controlled perturbations for quadratically constrained quadratic programs
cites work: Q5589748
cites work: A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
cites work: Q4039868
cites work: Quadratically constrained quadratic programming: Some applications and a method for solution
cites work: Q5638112
cites work: Numerical solution of a non-linear ill-posed problem arising in inverse scattering
full work available at URL: 0377-2217(92)90059-i
OpenAlex ID: W1994547505
description: scientific article; zbMATH DE number 149248