Lagrange multipliers method and quadratic programming in Hilbert space
Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres.
Large quadratic programming problems generated by rigid body simulation.
Le problème des signes de Thurstone. Une application de la méthode SEP
Limited memory solution of bound constrained convex quadratic problems arising in video games
We describe the solution of a bound constrained convex quadratic problem with limited memory resources. The problem arises from physical simulations occurring within video games. The motivating problem is outlined, along with a simple interior point approach for its solution. Various linear algebra issues arising in the implementation are explored, including preconditioning, ordering and a number of ways of solving an equivalent augmented system. Alternative approaches are briefly surveyed, ...
Local quadratic convergence of SQP for elliptic optimal control problems with mixed control-state constraints
Lösungsalgorithmen für quadratische Optimierungsaufgaben mit nicht notwendig konvexer Zielfunktion