Taiwanese Journal of Mathematics
- Taiwanese J. Math.
- Advance publication (2020), 13 pages.
Extension of Eaves Theorem for Determining the Boundedness of Convex Quadratic Programming Problems
It is known that the boundedness of a convex quadratic function over a convex quadratic constraint (c-QP) can be determined by algorithms. In 1985, Terlaky transformed the said boundedness problem into an $l_p$ programming problem and then apply linear programming, while Caron and Obuchowska in 1995 proposed another iterative procedure that checks, repeatedly, the existence of the implicit equality constraints. Theoretical characterization about the boundedness of (c-QP), however, does not have a complete result so far, except for Eaves' theorem, first by Eaves and later by Dostál, which answered the boundedness question only partially for a polyhedral-type of constraints. In this paper, Eaves' theorem is generalized to answer, necessarily and sufficiently, when the general (c-QP) with a convex quadratic constraint (not just a polyhedron) can be bounded from below, with a new insight that it can only be unbounded within an affine subspace.
Taiwanese J. Math., Advance publication (2020), 13 pages.
First available in Project Euclid: 7 May 2020
Permanent link to this document
Digital Object Identifier
Nguyen, Huu-Quang; Nguyen, Van-Bong; Sheu, Ruey-Lin. Extension of Eaves Theorem for Determining the Boundedness of Convex Quadratic Programming Problems. Taiwanese J. Math., advance publication, 7 May 2020. doi:10.11650/tjm/200501. https://projecteuclid.org/euclid.twjm/1588838410