Items where Author is "Toint, Philippe L."

Gould, N. I. M., Orban, D., & Toint, P. L. (2015). CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Computational Optimization and Applications, 60(3), 545-557. External link

Gould, N. I. M., Orban, D., & Toint, P. L. (2014, January). An interior-point 1-penalty method for nonlinear optimization [Paper]. 3rd International Conference on Numerical Analysis and Optimization: Theory, Methods, Applications and Technology Transfer (NAOIII-2014), Muscat, Oman. External link

Gould, N. I. M., Orban, D., & Toint, P. L. (2008). LANCELOT_SIMPLE: A Simple Interface for LANCELOT-B. (Technical Report n° G-2008-11). External link

Gould, N. I. M., Orban, D., Sartenaer, A., & Toint, P. L. (2005). Sensitivity of trust-region algorithms to their parameters. 4OR, 3(3), 227-241. External link

Gould, N. I. M., Orban, D., & Toint, P. L. (2003). CUTEr and SifDec: A Constrained and Unconstrained Testing Environment, Revisited. ACM Transactions on Mathematical Software, 29(4), 373-394. External link

Gould, N. I. M., Orban, D., & Toint, P. L. (2003). GALAHAD, a Library of Thread-safe Fortran 90 Packages for Large-scale Nonlinear Optimization. ACM Transactions on Mathematical Software, 29(4), 353-372. External link

Gould, N. I. M., Orban, D., Sartenaer, A., & Toint, P. L. (2002). Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Mathematical Programming, 92(3), 481-508. External link

Gould, N. I. M., Orban, D., & Toint, P. L. (2002). Results from a Numerical Evaluation of LANCELOT B. (Technical Report n° NAGIR-2002-1). External link

Gould, N. I. M., Orban, D., Sartenaer, A., & Toint, P. L. (2001). Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM Journal on Optimization, 11(4), 974-1002. External link

Conn, A. R., Gould, N. I. M., Orban, D., & Toint, P. L. (2000). A primal-dual trust-region algorithm for non-convex nonlinear programming. Mathematical Programming, 87(2), 215-249. External link