Limited memory solution of bound constrained convex quadratic problems arising in video games
From MaRDI portal
Publication:4600610
DOI10.1051/ro:2007009zbMath1377.90064OpenAlexW2155104777MaRDI QIDQ4600610
Paul Armand, Michael C. Ferris, Andrew J. Wathen
Publication date: 12 January 2018
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/710fe856b98aa54b04010a4870bce1fd5a78bb63
interior point methodnonlinear complementarity problemlimited memory methodbound constrained problem
Applications of mathematical programming (90C90) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items
Local path-following property of inexact interior methods in nonlinear programming, An RLT approach for solving the binary-constrained mixed linear complementarity problem, An algorithm for the fast solution of symmetric linear complementarity problems