Limited memory solution of bound constrained convex quadratic problems arising in video games
RAIRO-Oper. Res., 41 1 (2007) 19-34
Published online: 2007-06-15
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):
A new conjugate gradient method for acceleration of gradient descent algorithms
Noureddine Rahali, Mohammed Belloufi and Rachid BenzineMoroccan Journal of Pure and Applied Analysis 7 (1) 1 (2021)
https://doi.org/10.2478/mjpaa-2021-0001
An RLT approach for solving the binary-constrained mixed linear complementarity problem
Franklin Djeumou Fomeni, Steven A. Gabriel and Miguel F. AnjosComputers & Operations Research 110 48 (2019)
https://doi.org/10.1016/j.cor.2019.05.008
Quantitative Methods in Supply Chain Management
Ioannis T. ChristouQuantitative Methods in Supply Chain Management 1 (2012)
https://doi.org/10.1007/978-0-85729-766-2_1
Local path-following property of inexact interior methods in nonlinear programming
Paul Armand, Joël Benoist and Jean-Pierre DussaultComputational Optimization and Applications 52 (1) 209 (2012)
https://doi.org/10.1007/s10589-011-9406-2
An algorithm for the fast solution of symmetric linear complementarity problems
José Luis Morales, Jorge Nocedal and Mikhail SmelyanskiyNumerische Mathematik 111 (2) 251 (2008)
https://doi.org/10.1007/s00211-008-0183-5