default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe L. Toint
Person information
- affiliation: University of Namur, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j115]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. Comput. Optim. Appl. 89(2): 385-417 (2024)- [j114]Serge Gratton, Philippe L. Toint, Jacek Gondzio, Yurii E. Nesterov, Ya-xiang Yuan:
Preface for the special edition of optimization methods and software. Optim. Methods Softw. 39(3): 457-458 (2024) - [i20]Serge Gratton, Philippe L. Toint:
S2MPJ and CUTEst optimization problems for Matlab, Python and Julia. CoRR abs/2407.07812 (2024) - [i19]Serge Gratton, Chee-Khian Sim, Philippe L. Toint:
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε-2) rather than 𝒪(ε-2). CoRR abs/2408.09124 (2024) - [i18]Philippe L. Toint:
Examples of slow convergence for adaptive regularization optimization methods are not isolated. CoRR abs/2409.16047 (2024) - 2023
- [j113]Serge Gratton, Philippe L. Toint:
OFFO minimization algorithms for second-order optimality and their complexity. Comput. Optim. Appl. 84(2): 573-607 (2023) - [j112]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): 700-729 (2023) - [j111]Serge Gratton, Sadok Jerad, Philippe L. Toint:
An adaptive regularization method in Banach spaces. Optim. Methods Softw. 38(6): 1163-1179 (2023) - [j110]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): 1621-1646 (2023) - [j109]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): 2772-2800 (2023) - [i17]Serge Gratton, Alena Kopanicáková, Philippe L. Toint:
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. CoRR abs/2302.07049 (2023) - [i16]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 abs/2305.14477 (2023) - [i15]Philippe L. Toint:
Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example. CoRR abs/2308.00720 (2023) - 2022
- [j108]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: 100043 (2022) - [j107]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: 101591 (2022) - [j106]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): 1406-1422 (2022) - [j105]Margherita Porcelli, Philippe L. Toint:
Exploiting Problem Structure in Derivative Free Optimization. ACM Trans. Math. Softw. 48(1): 6:1-6:25 (2022) - [i14]Serge Gratton, Sadok Jerad, Philippe L. Toint:
Parametric complexity analysis for a class of first-order Adagrad-like algorithms. CoRR abs/2203.01647 (2022) - 2021
- [j104]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): 1-24 (2021) - [j103]Xiaojun Chen, Philippe L. Toint:
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. Math. Program. 187(1): 47-78 (2021) - [j102]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) - [c3]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: 258-267 - [i13]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 abs/2104.00592 (2021) - [i12]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. CoRR abs/2104.02519 (2021) - [i11]Serge Gratton, Sadok Jerad, Philippe L. Toint:
Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points. CoRR abs/2104.02564 (2021) - 2020
- [j101]Serge Gratton, Philippe L. Toint:
A note on solving nonlinear optimization problems in variable precision. Comput. Optim. Appl. 76(3): 917-933 (2020) - [j100]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): 243-256 (2020) - [j99]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): 513-541 (2020)
2010 – 2019
- 2019
- [j98]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: 68-94 (2019) - [j97]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): 595-615 (2019) - [j96]Xiaojun Chen, Philippe L. Toint, Hong Wang:
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. SIAM J. Optim. 29(1): 874-903 (2019) - [j95]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. SIAM J. Optim. 29(4): 2881-2915 (2019) - [j94]Margherita Porcelli, Philippe L. Toint:
A Note on Using Performance and Data Profiles for Training Algorithms. ACM Trans. Math. Softw. 45(2): 20:1-20:10 (2019) - [i10]Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint:
Exploiting variable precision in GMRES. CoRR abs/1907.10550 (2019) - 2018
- [j93]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): 1073-1107 (2018) - [j92]Benedetta Morini, Margherita Porcelli, Philippe L. Toint:
Approximate norm descent methods for constrained nonlinear systems. Math. Comput. 87(311): 1327-1351 (2018) - [i9]Serge Gratton, Ehouarn Simon, Philippe L. Toint:
Minimizing convex quadratic with variable precision Krylov methods. CoRR abs/1807.07476 (2018) - [i8]Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR abs/1811.01220 (2018) - [i7]Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint:
Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. CoRR abs/1811.03831 (2018) - [i6]Serge Gratton, Philippe L. Toint:
A note on solving nonlinear optimization problems in variable precision. CoRR abs/1812.03467 (2018) - 2017
- [j91]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): 73-134 (2017) - [j90]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): 611-626 (2017) - [j89]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): 359-368 (2017) - [j88]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): 1273-1298 (2017) - [j87]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): 6:1-6:25 (2017) - [i5]Xiaojun Chen, Philippe L. Toint, Hong Wang:
Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity. CoRR abs/1704.06919 (2017) - [i4]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 abs/1705.04895 (2017) - [i3]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 abs/1705.07285 (2017) - [i2]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR abs/1708.04044 (2017) - [i1]Margherita Porcelli, Philippe L. Toint:
A note on using performance and data profilesfor training algorithms. CoRR abs/1711.09407 (2017) - 2016
- [j86]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): 23-34 (2016) - [j85]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): 511-534 (2016) - [j84]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): 951-967 (2016) - 2015
- [j83]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): 545-557 (2015) - [j82]Phillipe Rodrigues Sampaio, Philippe L. Toint:
A derivative-free trust-funnel method for equality-constrained nonlinear optimization. Comput. Optim. Appl. 61(1): 25-49 (2015) - [j81]Serge Gratton, M. Monserrat Rincon-Camacho, Ehouarn Simon, Philippe L. Toint:
Observation thinning in data assimilation computations. EURO J. Comput. Optim. 3(1): 31-51 (2015) - [j80]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) - [j79]Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan:
Obituary for Mike Powell. Optim. Methods Softw. 30(3): 669-671 (2015) - [j78]Serge Gratton, Vincent Malmedy, Philippe L. Toint:
Quasi-Newton updates with weighted secant equations. Optim. Methods Softw. 30(4): 748-755 (2015) - [j77]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): 836-851 (2015) - 2014
- [j76]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): 93-106 (2014) - [j75]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): 110-126 (2014) - 2013
- [j74]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): 1-25 (2013) - [j73]Philippe L. Toint:
Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. 28(1): 82-95 (2013) - [j72]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): 451-457 (2013) - [j71]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): 1553-1574 (2013) - [j70]Johan Barthélemy, Philippe L. Toint:
Synthetic Population Generation Without a Sample. Transp. Sci. 47(2): 266-279 (2013) - 2012
- [j69]Serge Gratton, Vincent Malmedy, Philippe L. Toint:
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization. Comput. Optim. Appl. 51(3): 967-979 (2012) - [j68]Nicholas I. M. Gould, Margherita Porcelli, Philippe L. Toint:
Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53(1): 1-22 (2012) - [j67]Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1): 93-108 (2012) - [j66]Nick I. M. Gould, Philippe L. Toint:
Erratum to: Nonlinear programming without a penalty function or a filter. Math. Program. 131(1-2): 403-404 (2012) - [j65]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): 197-219 (2012) - [j64]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): 66-86 (2012) - 2011
- [j63]Vincent Malmedy, Philippe L. Toint:
Approximating Hessians in unconstrained optimization arising from discretized problems. Comput. Optim. Appl. 50(1): 1-22 (2011) - [j62]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): 245-295 (2011) - [j61]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): 295-319 (2011) - [j60]M'Barek Fares, Serge Gratton, Philippe L. Toint:
Fast regularized linear sampling for inverse scattering problems. Numer. Linear Algebra Appl. 18(1): 55-68 (2011) - [j59]Serge Gratton, Mélodie Mouffe, Philippe L. Toint:
Stopping rules and backward error analysis for bound-constrained optimization. Numerische Mathematik 119(1): 163-187 (2011) - [j58]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): 873-894 (2011) - [j57]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): 1721-1739 (2011) - [j56]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): 969-986 (2011) - 2010
- [j55]Nicholas I. M. Gould, Philippe L. Toint:
Nonlinear programming without a penalty function or a filter. Math. Program. 122(1): 155-196 (2010) - [j54]Fabian Bastin, Vincent Malmedy, Mélodie Mouffe, Philippe L. Toint, Dimitri Tomanos:
A retrospective trust-region method for unconstrained optimization. Math. Program. 123(2): 395-418 (2010) - [j53]Philippe L. Toint:
Book review. Optim. Methods Softw. 25(2): 333-334 (2010) - [j52]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): 359-386 (2010) - [j51]Serge Gratton, Philippe L. Toint:
Approximate invariant subspaces and quasi-newton optimization methods. Optim. Methods Softw. 25(4): 507-529 (2010) - [j50]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): 2833-2852 (2010) - [j49]Katya Scheinberg, Philippe L. Toint:
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. SIAM J. Optim. 20(6): 3512-3532 (2010) - [j48]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): 1-29 (2010) - [j47]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): 537-549 (2010)
2000 – 2009
- 2009
- [j46]Sunyoung Kim, Masakazu Kojima, Philippe L. Toint:
Recognizing underlying sparsity in optimization. Math. Program. 119(2): 273-303 (2009) - [j45]Philippe L. Toint, Dimitri Tomanos, M. Weber-Mendonça:
A multilevel algorithm for solving the trust-region subproblem. Optim. Methods Softw. 24(2): 299-311 (2009) - 2008
- [j44]Philippe L. Toint, Ya-Xiang Yuan:
Preface. Optim. Methods Softw. 23(2): 175-176 (2008) - [j43]Serge Gratton, Annick Sartenaer, Philippe L. Toint:
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization. SIAM J. Optim. 19(1): 414-444 (2008) - 2007
- [j42]Caroline Sainvitu, Philippe L. Toint:
A filter-trust-region method for simple-bound constrained optimization. Optim. Methods Softw. 22(5): 835-848 (2007) - [j41]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): 3 (2007) - 2006
- [j40]Fabian Bastin, Cinzia Cirillo, Philippe L. Toint:
An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. 3(1): 55-79 (2006) - [j39]Fabian Bastin, Cinzia Cirillo, Philippe L. Toint:
Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108(2-3): 207-234 (2006) - [j38]Christopher John Price, Philippe L. Toint:
Exploiting problem structure in pattern search methods for unconstrained optimization. Optim. Methods Softw. 21(3): 479-491 (2006) - 2005
- [j37]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Sensitivity of trust-region algorithms to their parameters. 4OR 3(3): 227-241 (2005) - [j36]Benoît Colson, Philippe L. Toint:
Optimizing partially separable functions without derivatives. Optim. Methods Softw. 20(4-5): 493-508 (2005) - [j35]Nick I. M. Gould, Caroline Sainvitu, Philippe L. Toint:
A Filter-Trust-Region Method for Unconstrained Optimization. SIAM J. Optim. 16(2): 341-357 (2005) - 2004
- [j34]Nick I. M. Gould, Sven Leyffer, Philippe L. Toint:
Nonlinear programming: theory and practice. Math. Program. 100(1): 1-2 (2004) - [j33]Nick I. M. Gould, Philippe L. Toint:
Preprocessing for quadratic programming. Math. Program. 100(1): 95-132 (2004) - [j32]Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint:
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares. SIAM J. Optim. 15(1): 17-38 (2004) - 2003
- [j31]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4): 353-372 (2003) - [j30]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4): 373-394 (2003) - 2002
- [j29]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. 92(3): 481-508 (2002) - [j28]Roger Fletcher, Sven Leyffer, Philippe L. Toint:
On the Global Convergence of a Filter--SQP Algorithm. SIAM J. Optim. 13(1): 44-59 (2002) - [j27]Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter:
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. SIAM J. Optim. 13(3): 635-659 (2002) - 2001
- [j26]Fermín S. V. Bazán, Philippe L. Toint:
Error analysis of signal zeros from a related companion matrix eigenvalue problem. Appl. Math. Lett. 14(7): 859-866 (2001) - [j25]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. 11(4): 974-1002 (2001) - [c2]Nicholas I. M. Gould, Philippe L. Toint:
Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. System Modelling and Optimization 2001: 23-54 - 2000
- [b1]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Trust Region Methods. MOS-SIAM Series on Optimization, SIAM 2000, ISBN 978-0-89871-460-9, pp. 1-942 - [j24]Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87(2): 215-249 (2000)
1990 – 1999
- 1999
- [j23]Nicholas I. M. Gould, Philippe L. Toint:
A note on the convergence of barrier algorithms to second-order necessary points. Math. Program. 85(2): 433-438 (1999) - [j22]Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Philippe L. Toint:
Solving the Trust-Region Subproblem using the Lanczos Method. SIAM J. Optim. 9(2): 504-525 (1999) - [c1]Nicholas I. M. Gould, Philippe L. Toint:
SQP Methods for Large-Scale Nonlinear Programming. System Modelling and Optimization 1999: 149-178 - 1997
- [j21]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds. Comput. Optim. Appl. 7(1): 41-69 (1997) - [j20]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Math. Comput. 66(217): 261-288 (1997) - [j19]Philippe L. Toint:
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Math. Program. 77: 69-94 (1997) - [j18]Andrew R. Conn, Katya Scheinberg, Philippe L. Toint:
Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79: 397-414 (1997) - [j17]Michel Bierlaire, Tsippy Lotan, Philippe L. Toint:
On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants. Transp. Sci. 31(4): 363-371 (1997) - 1996
- [j16]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Math. Program. 73: 73-110 (1996) - [j15]Andrew R. Conn, Nicholas I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. 6(3): 674-703 (1996) - [j14]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. SIAM J. Optim. 6(4): 1059-1086 (1996) - [j13]Philippe L. Toint:
An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization. SIAM J. Sci. Comput. 17(3): 725-739 (1996) - 1995
- [j12]Ingrid Bongartz, Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Softw. 21(1): 123-160 (1995) - 1994
- [j11]D. Burton, Philippe L. Toint:
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program. 63: 1-22 (1994) - [j10]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
A note on exploiting structure when using slack variables. Math. Program. 67: 89-97 (1994) - 1993
- [j9]Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint:
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. SIAM J. Optim. 3(1): 164-221 (1993) - 1992
- [j8]D. Burton, Philippe L. Toint:
On an instance of the inverse shortest paths problem. Math. Program. 53: 45-61 (1992) - [j7]Philippe L. Toint, Daniel Tuyttens:
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. ACM Trans. Math. Softw. 18(3): 308-328 (1992) - 1991
- [j6]Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint:
Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. 50: 177-195 (1991) - 1990
- [j5]Philippe L. Toint, Daniel Tuyttens:
On Large Scale Nonlinear Network Optimization. Math. Program. 48: 125-159 (1990)
1980 – 1989
- 1986
- [j4]Philippe L. Toint:
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization. Math. Program. 36(3): 290-306 (1986) - 1984
- [j3]Andreas Griewank, Philippe L. Toint:
On the existence of convex decompositions of partially separable functions. Math. Program. 28(1): 25-49 (1984) - 1983
- [j2]Robert B. Schnabel, Philippe L. Toint:
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm. Math. Program. 25(1): 125-129 (1983) - 1981
- [j1]Philippe L. Toint:
A note about sparsity exploiting quasi-Newton updates. Math. Program. 21(1): 172-181 (1981)
Coauthor Index
Andrew Conn 0001
aka: Andrew R. Conn
aka: Andrew R. Conn
Nicholas I. M. Gould
aka: Nick I. M. Gould
aka: Nick I. M. Gould
[j100] [j99] [j98] [j97] [j93] [i8] [j91] [j90] [j88] [i4] [i3] [i2] [j83] [j77] [j76] [j72] [j71] [j68] [j67] [j66] [j65] [j64] [j62] [j61] [j57] [j55] [j50] [j48] [j41] [j37] [j35] [j34] [j33] [j32] [j31] [j30] [j29] [j27] [j25] [c2] [b1] [j24] [j23] [j22] [c1] [j21] [j20] [j16] [j15] [j14] [j12] [j10] [j9] [j6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
