Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Pault T. Boggs"'
Publikováno v:
Annals of Operations Research. 62:419-437
In this paper, we present an interior point algorithm for solving both convex and nonconvex quadratic programs. The method, which is an extension of our interior point work on linear programming problems efficiently solves a wide class of largescale
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::593c6eb0bb07e7e01d903f6e977b69c2
https://doi.org/10.1007/bf02206825
https://doi.org/10.1007/bf02206825
