( en | de | ru )

 

Disambiguation of "Morales, José Luis"

Author of the publication

copydeleteadd this publication to your clipboard
An algorithm for the fast solution of symmetric linear complementarity problems.

, , and . Numerische Mathematik, 111 (2): 251-266 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fabio José Morales Morales

José Vera Morales

José Morales Saravia

José Luis Morote

José Luis Rivarola

 

Other publications of authors with the same name

An algorithm for the fast solution of symmetric linear complementarity problems., , and . Numerische Mathematik, 111 (2): 251-266 (2008)Remark on älgorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization"., and . ACM Trans. Math. Softw., 38 (1): 7:1-7:4 (2011)Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method., and . ACM Trans. Math. Softw., 27 (1): 83-91 (2001)A numerical study of limited memory BFGS methods.. Appl. Math. Lett., 15 (4): 481-487 (2002)Emotional Response to Virtual Reality Exposure across Different Cultures: The Role of the Attribution Process., , , , , , , and . Cyberpsychology Behav. Soc. Netw., 12 (6): 699-705 (2009)On the solution of complementarity problems arising in American options pricing., , , and . Optim. Methods Softw., 26 (4-5): 813-825 (2011)Automatic Preconditioning by Limited Memory Quasi-Newton Updating., and . SIAM J. Optimization, 10 (4): 1079-1096 (2000)Enriched Methods for Large-Scale Unconstrained Optimization., and . Comput. Optim. Appl., 21 (2): 143-154 (2002)An interior algorithm for nonlinear optimization that combines line search and trust region steps., , , and . Math. Program., 107 (3): 391-408 (2006)On the geometry phase in model-based algorithms for derivative-free optimization., , and . Optim. Methods Softw., 24 (1): 145-154 (2009)