Philippe L. Toint

ORCID

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 49

Top Venues

CoRR

SIAM J. Optim.

Math. Program.

Optim. Methods Softw.

Publications

Serge Gratton, Philippe L. Toint
S2MPJ and CUTEst optimization problems for Matlab, Python and Julia. CoRR (2024)
Serge Gratton, Sadok Jerad, Philippe L. Toint
An adaptive regularization method in Banach spaces. Optim. Methods Softw. 38 (6) (2023)
Serge Gratton, Philippe L. Toint
OFFO minimization algorithms for second-order optimality and their complexity. Comput. Optim. Appl. 84 (2) (2023)
Serge Gratton, Alena Kopanicáková, Philippe L. Toint
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. SIAM J. Optim. 33 (4) (2023)
Serge Gratton, Valentin Mercier, Elisa Riccietti, Philippe L. Toint
A Block-Coordinate Approach of Multi-level Optimization with an Application to Physics-Informed Neural Networks. CoRR (2023)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. J. Optim. Theory Appl. 196 (2) (2023)
Serge Gratton, Sadok Jerad, Philippe L. Toint
Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an $\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}$ Complexity Bound. SIAM J. Optim. 33 (3) (2023)
Serge Gratton, Alena Kopanicakova, Philippe L. Toint
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. CoRR (2023)
Philippe L. Toint
Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example. CoRR (2023)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques. EURO J. Comput. Optim. 10 (2022)
Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
A Note on Inexact Inner Products in GMRES. SIAM J. Matrix Anal. Appl. 43 (3) (2022)
Serge Gratton, Sadok Jerad, Philippe L. Toint
Parametric complexity analysis for a class of first-order Adagrad-like algorithms. CoRR (2022)
Margherita Porcelli, Philippe L. Toint
Exploiting Problem Structure in Derivative Free Optimization. ACM Trans. Math. Softw. 48 (1) (2022)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. J. Complex. 68 (2022)
Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
Minimizing convex quadratics with variable precision conjugate gradients. Numer. Linear Algebra Appl. 28 (1) (2021)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. CoRR (2021)
Serge Gratton, Ehouarn Simon, Philippe L. Toint
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. 187 (1) (2021)
Serge Gratton, Sadok Jerad, Philippe L. Toint
Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points. CoRR (2021)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. CoRR (2021)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. ICCSA (Workshops) (2021)
Xiaojun Chen, Philippe L. Toint
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. Math. Program. 187 (1) (2021)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35 (2) (2020)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30 (1) (2020)
Serge Gratton, Philippe L. Toint
A note on solving nonlinear optimization problems in variable precision. Comput. Optim. Appl. 76 (3) (2020)
Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
Exploiting variable precision in GMRES. CoRR (2019)
Xiaojun Chen, Philippe L. Toint, Hong Wang
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. SIAM J. Optim. 29 (1) (2019)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. 29 (1) (2019)
Margherita Porcelli, Philippe L. Toint
A Note on Using Performance and Data Profiles for Training Algorithms. ACM Trans. Math. Softw. 45 (2) (2019)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. SIAM J. Optim. 29 (4) (2019)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53 (2019)
Benedetta Morini, Margherita Porcelli, Philippe L. Toint
Approximate norm descent methods for constrained nonlinear systems. Math. Comput. 87 (311) (2018)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR (2018)
Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. CoRR (2018)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. 18 (5) (2018)
Serge Gratton, Philippe L. Toint
A note on solving nonlinear optimization problems in variable precision. CoRR (2018)
Serge Gratton, Ehouarn Simon, Philippe L. Toint
Minimizing convex quadratic with variable precision Krylov methods. CoRR (2018)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161 (1-2) (2017)
Margherita Porcelli, Philippe L. Toint
A note on using performance and data profilesfor training algorithms. CoRR (2017)
Xiaojun Chen, Philippe L. Toint, Hong Wang
Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity. CoRR (2017)
Margherita Porcelli, Philippe L. Toint
BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables. ACM Trans. Math. Softw. 44 (1) (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. 32 (6) (2017)
Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra Augusta Santos, Philippe L. Toint
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163 (1-2) (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR (2017)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR (2017)
Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR (2017)
Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint
An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. 161 (1-2) (2017)
Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra A. Santos, Philippe L. Toint
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models. SIAM J. Optim. 26 (2) (2016)
Phillipe Rodrigues Sampaio, Philippe L. Toint
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints. Optim. Methods Softw. 31 (3) (2016)
Florian Jarre, Philippe L. Toint
Simple examples for the failure of Newton's method with line search for strictly convex minimization. Math. Program. 158 (1-2) (2016)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. 53 (2) (2015)
Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan
Obituary for Mike Powell. Optim. Methods Softw. 30 (3) (2015)
Serge Gratton, M. Monserrat Rincon-Camacho, Ehouarn Simon, Philippe L. Toint
Observation thinning in data assimilation computations. EURO J. Comput. Optim. 3 (1) (2015)
Phillipe Rodrigues Sampaio, Philippe L. Toint
A derivative-free trust-funnel method for equality-constrained nonlinear optimization. Comput. Optim. Appl. 61 (1) (2015)
Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60 (3) (2015)
Johan Barthélemy, Philippe L. Toint
A Stochastic and Flexible Activity Based Model for Large Population. Application to Belgium. J. Artif. Soc. Soc. Simul. 18 (3) (2015)
Serge Gratton, Vincent Malmedy, Philippe L. Toint
Quasi-Newton updates with weighted secant equations. Optim. Methods Softw. 30 (4) (2015)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144 (1-2) (2014)
Serge Gratton, David Titley-Péloquin, Philippe L. Toint, Jean Tshimanga Ilunga
Differentiating the Method of Conjugate Gradients. SIAM J. Matrix Anal. Appl. 35 (1) (2014)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. SIAM J. Optim. 23 (3) (2013)
Philippe L. Toint
Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. 28 (1) (2013)
Johan Barthélemy, Philippe L. Toint
Synthetic Population Generation Without a Sample. Transp. Sci. 47 (2) (2013)
Serge Gratton, Selime Gürol, Philippe L. Toint
Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems. Comput. Optim. Appl. 54 (1) (2013)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. 28 (3) (2013)
Nick I. M. Gould, Philippe L. Toint
Erratum to: Nonlinear programming without a penalty function or a filter. Math. Program. 131 (1-2) (2012)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. 22 (1) (2012)
Nicholas I. M. Gould, Margherita Porcelli, Philippe L. Toint
Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53 (1) (2012)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. 27 (2) (2012)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28 (1) (2012)
Serge Gratton, Vincent Malmedy, Philippe L. Toint
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization. Comput. Optim. Appl. 51 (3) (2012)
Serge Gratton, Philippe L. Toint, Jean Tshimanga Ilunga
Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems. SIAM J. Matrix Anal. Appl. 32 (3) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. 21 (4) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127 (2) (2011)
M'Barek Fares, Serge Gratton, Philippe L. Toint
Fast regularized linear sampling for inverse scattering problems. Numer. Linear Algebra Appl. 18 (1) (2011)
Vincent Malmedy, Philippe L. Toint
Approximating Hessians in unconstrained optimization arising from discretized problems. Comput. Optim. Appl. 50 (1) (2011)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130 (2) (2011)
Serge Gratton, Philippe L. Toint, Anke Tröltzsch
An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. Optim. Methods Softw. 26 (4-5) (2011)
Serge Gratton, Mélodie Mouffe, Philippe L. Toint
Stopping rules and backward error analysis for bound-constrained optimization. Numerische Mathematik 119 (1) (2011)
Serge Gratton, Mélodie Mouffe, Annick Sartenaer, Philippe L. Toint, Dimitri Tomanos
Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization. Optim. Methods Softw. 25 (3) (2010)
Nicholas I. M. Gould, Philippe L. Toint
Nonlinear programming without a penalty function or a filter. Math. Program. 122 (1) (2010)
Philippe L. Toint
Book review. Optim. Methods Softw. 25 (2) (2010)
Fabian Bastin, Vincent Malmedy, Mélodie Mouffe, Philippe L. Toint, Dimitri Tomanos
A retrospective trust-region method for unconstrained optimization. Math. Program. 123 (2) (2010)
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
Estimating Nonparametric Random Utility Models with an Application to the Value of Time in Heterogeneous Populations. Transp. Sci. 44 (4) (2010)
Serge Gratton, Philippe L. Toint
Approximate invariant subspaces and quasi-newton optimization methods. Optim. Methods Softw. 25 (4) (2010)
Katya Scheinberg, Philippe L. Toint
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. SIAM J. Optim. 20 (6) (2010)
Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint
Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. 48 (1) (2010)
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. 20 (6) (2010)
Sunyoung Kim, Masakazu Kojima, Philippe L. Toint
Recognizing underlying sparsity in optimization. Math. Program. 119 (2) (2009)
Philippe L. Toint, Dimitri Tomanos, M. Weber-Mendonça
A multilevel algorithm for solving the trust-region subproblem. Optim. Methods Softw. 24 (2) (2009)
Serge Gratton, Annick Sartenaer, Philippe L. Toint
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization. SIAM J. Optim. 19 (1) (2008)
Philippe L. Toint, Ya-Xiang Yuan
Preface. Optim. Methods Softw. 23 (2) (2008)
Nicholas I. M. Gould, Philippe L. Toint
FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. ACM Trans. Math. Softw. 33 (1) (2007)
Caroline Sainvitu, Philippe L. Toint
A filter-trust-region method for simple-bound constrained optimization. Optim. Methods Softw. 22 (5) (2007)
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. 3 (1) (2006)
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108 (2-3) (2006)
Christopher John Price, Philippe L. Toint
Exploiting problem structure in pattern search methods for unconstrained optimization. Optim. Methods Softw. 21 (3) (2006)
Benoît Colson, Philippe L. Toint
Optimizing partially separable functions without derivatives. Optim. Methods Softw. 20 (4-5) (2005)
Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
Sensitivity of trust-region algorithms to their parameters. 4OR 3 (3) (2005)
Nick I. M. Gould, Caroline Sainvitu, Philippe L. Toint
A Filter-Trust-Region Method for Unconstrained Optimization. SIAM J. Optim. 16 (2) (2005)
Nick I. M. Gould, Philippe L. Toint
Preprocessing for quadratic programming. Math. Program. 100 (1) (2004)
Nick I. M. Gould, Sven Leyffer, Philippe L. Toint
Nonlinear programming: theory and practice. Math. Program. 100 (1) (2004)

Philippe L. Toint.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Philippe L. Toint