Skip to main content
SpringerLink
Log in

On Solvability of Convex Noncoercive Quadratic Programming Problems

  • TECHNICAL NOTE
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Frank, M., Wolfe, P.: Naval Res. Logist. Q. 3, 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  2. Eaves, B.C.: On quadratic programming. Manag. Sci. 17, 698–711 (1971)

    Article  MATH  Google Scholar 

  3. Blum, E., Oetli, W.: Direct proof of the existence theorem in quadratic programming. Oper. Res. 20, 165–167 (1971)

    Article  Google Scholar 

  4. Hlaváček, I., Haslinger, J., Nečas, J., Lovíšek, J.: Solution of Variational Inequalities in Mechanics. Springer, Berlin (1988)

    MATH  Google Scholar 

  5. Bertsekas, D.P.: Nonlinear Optimization. Athena Scientific, Belmont (1999)

    Google Scholar 

  6. Zeidler, E.: Nonlinear Functional Analysis and its Applications III: Variational Methods and Optimization. Springer, New York (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, FEECS VŠB–Technical University of Ostrava, 17, Listopadu 15, 70833, Ostrava, Czech Republic

    Z. Dostál

Authors
  1. Z. Dostál
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Z. Dostál.

Additional information

Communicated by E.F. Udwadia.

This research has been supported by the grants GA CR 201/07/0294, AS CR 1ET400300415, and the Ministry of Education of the Czech Republic No. MSM6198910027.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dostál, Z. On Solvability of Convex Noncoercive Quadratic Programming Problems. J Optim Theory Appl 143, 413–416 (2009). https://doi.org/10.1007/s10957-009-9563-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-009-9563-y

Keywords

Search

Navigation