The following pages link to José Luis Morales (Q240152):
Displaying 18 items.
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- (Q1861791) (redirect page) (← links)
- A numerical study of limited memory BFGS methods (Q1861792) (← links)
- Numerical simulation of nonlinear consolidation problems by models based on the network method (Q2310565) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- A sequential quadratic programming algorithm with an additional equality constrained phase (Q2882357) (← links)
- Numerical Solutions of 2-D Linear Elastostatic Problems by Network Method (Q2964513) (← links)
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization” (Q2989144) (← links)
- On the solution of complementarity problems arising in American options pricing (Q3096882) (← links)
- On the geometry phase in model-based algorithms for derivative-free optimization (Q3603660) (← links)
- (Q3833504) (← links)
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating (Q4509752) (← links)
- (Q4654838) (← links)
- Application of the network method to simulate elastostatic problems defined by potential functions. Applications to axisymmetrical hollow bodies (Q4903472) (← links)
- New additional conditions for the numerical uniqueness of the Boussinesq and Timpe solutions of elasticity problems (Q4903473) (← links)
- Algorithm 809: PREQN (Q5460992) (← links)
- An Algorithm for Linear Complementarity and its Application in American Options Pricing (Q5851657) (← links)
- Enriched methods for large-scale unconstrained optimization (Q5960304) (← links)
