Lagrange multipliers method and quadratic programming in Hilbert space
Page 1
Displaying 1 – 7 of 7
Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres.
Pham Dinh Tao, Le Thi Hoai An (1995)
Journal of Convex Analysis
Large quadratic programming problems generated by rigid body simulation.
Gavrea, Bogdan, Petra, Cosmin (2008)
General Mathematics
Le problème des signes de Thurstone. Une application de la méthode SEP
Jean De Smet (1968)
RAIRO - Operations Research - Recherche Opérationnelle
Limited memory solution of bound constrained convex quadratic problems arising in video games
Michael C. Ferris, Andrew J. Wathen, Paul Armand (2007)
RAIRO - Operations Research
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
Roland Griesse, Nataliya Metla, Arnd Rösch (2010)
Control and Cybernetics
Lösungsalgorithmen für quadratische Optimierungsaufgaben mit nicht notwendig konvexer Zielfunktion
Klaus Lommatzsch (1974)
Aplikace matematiky
Currently displaying 1 – 7 of 7
Page 1