LANS Informal Seminar Talks Network
"An algorithm for the approximate and fast solution of mixed"
DATE: March 21, 2007
TIME: - Description: More Information:
SPEAKER: Jose Luis Morales, ITAM (on sabbatical at Northwestern)
LOCATION: MCS, Building 221, Room A-261, Argonne
HOST: Sven Leyffer
In this talk we discuss an algorithm for the solution of large scale LCPs. The proposed algorithm combines iterations of projected Gauss-Seidel method with subspace minimization steps.
Goodies provided by: Matt Knepley
Coffee: Arbor Vitae Surprise Roast
Please send questions or suggestions to Jeffrey Larson: jmlarson at anl dot gov.