Philippe L. Toint

Computational Theory and Mathematics · 1988–2013

A researcher in the Science corpus: 16 papers; trusts 31 researchers and is trusted by 59 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 22 citations into it; #1,681 of 12,182 by trust here, #2,298 by citations
• Numerical Analysis — 22 citations into it; #100 of 3,586 by trust here, #72 by citations
• Mathematical Optimization — 18 citations into it; #186 of 422 by trust here, #93 by citations
• Optimization & Training — 15 citations into it
• Numerical Methods & Scientific Computing — 12 citations into it
• Computational Mechanics — 6 citations into it; #1,025 of 10,001 by trust here, #1,671 by citations

Whom Philippe L. Toint trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. John E. Dennis Jr.
2. N. Gould
3. Trond Steihaug
4. Yurii E. Nesterov
5. Coralia Cartis
6. Roger Fletcher
7. M. Powell
8. Bobby Schnabel
9. Peter Deuflhard
10. Andrew R. Conn

Who trusts Philippe L. Toint overall

1. Coralia Cartis
2. Luís Nunes Vicente
3. Ya-Xiang Yuan
4. N. Gould
5. Andreas Wächter
6. Rohollah Garmanjani
7. Saeed Ghadimi
8. Lorenz T. Biegler
9. Jorge Nocedal
10. Charles Audet

Papers from Philippe L. Toint's perspective

Ordered by how strongly the researchers Philippe L. Toint trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
2. Numerical methods for unconstrained optimization and nonlinear equations
3. Introduction to derivative-free optimization
4. Cubic regularization of Newton method and its global performance
5. A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods
6. Some NP-complete problems in quadratic and nonlinear programming
7. Benchmarking optimization software with performance profiles
8. Practical Methods of Optimization: Fletcher/Practical Methods of Optimization
9. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization (SIAM Journal on Optimization)
10. Worst case complexity of direct search

Their papers

• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (2010) — 266 citations
• Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity (2011) — 373 citations
• Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results (2011) — 458 citations
• CUTEr and SifDec: A constrained and unconstrained testing environment, revisited (2003) — 664 citations
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming (2002) — 304 citations
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization (2008) — 217 citations
• CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization (2013) — 446 citations
• Transfers to Sustain Dynamic Core-Theoretic Cooperation in International Stock Pollutant Control (2003) — 166 citations
• SIAM Journal on Optimization (2012) — 143 citations
• On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (2012) — 73 citations
• On the Global Convergence of a Filter--SQP Algorithm (2002) — 349 citations
• Trust Region Methods (2000) — 1,835 citations
• Solving the Trust-Region Subproblem using the Lanczos Method (1999)
• On the convergence of derivative-free methods for unconstrained optimization (1997)
• Convergence of quasi-Newton matrices generated by the symmetric rank one update (1991)
• Testing a class of methods for solving minimization problems with simple bounds on the variables (1988)