An algorithm for indefinite quadratic programming based on a partial Cholesky factorization
RAIRO-Oper. Res., 27 4 (1993) 401-426
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Nonnegative control of finite-dimensional linear systems
Jérôme Lohéac, Emmanuel Trélat and Enrique ZuazuaAnnales de l'Institut Henri Poincaré C, Analyse non linéaire 38 (2) 301 (2021)
https://doi.org/10.1016/j.anihpc.2020.07.004
Bundle Relaxation and Primal Recovery in Unit Commitment Problems. The Brazilian Case
A. Belloni, A.L. Diniz Souto Lima, M.E. Piñeiro Maceira and C.A. SagastizábalAnnals of Operations Research 120 (1-4) 21 (2003)
https://doi.org/10.1023/A:1023314026477
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
J. F. Bonnans and M. BouhtouRAIRO - Operations Research 29 (2) 195 (1995)
https://doi.org/10.1051/ro/1995290201951