On Solvability of Convex Noncoercive Quadratic Programming Problems

Z. Dostál ()
Additional contact information
Z. Dostál: FEECS VŠB–Technical University of Ostrava

Journal of Optimization Theory and Applications, 2009, vol. 143, issue 2, No 12, 413-416

Abstract: Abstract Using a known result on minimization of convex functionals on polyhedral cones, the Frank–Wolfe theorem, and basic linear algebra, we give a simple proof that the general convex quadratic programming problem which satisfies a natural necessary condition has a solution.

Keywords: Convex quadratic programming; Existence of solution (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-009-9563-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:143:y:2009:i:2:d:10.1007_s10957-009-9563-y

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-009-9563-y

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().