Philippe L. Toint

145 papers Journal 141Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	prunAdag: an adaptive pruning-aware gradient method. Comput. Optim. Appl. Margherita Porcelli, Giovanni Seraghiti, Philippe L. Toint
2025	J	`jnl`	A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity. Open J. Math. Optim. Serge Gratton, Sadok Jerad, Philippe L. Toint
2025	J	`jnl`	Complexity and performance for two classes of noise-tolerant first-order algorithms. Optim. Methods Softw. Serge Gratton, Sadok Jerad, Philippe L. Toint
2025	J	`jnl`	Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization. CoRR Serge Gratton, Alena Kopanicáková, Philippe L. Toint
2025	J	`jnl`	Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε Comput. Optim. Appl. Serge Gratton, Chee-Khian Sim, Philippe L. Toint
2025	J	`jnl`	S2MPJ and CUTEst optimization problems for Matlab, Python and Julia. Optim. Methods Softw. Serge Gratton, Philippe L. Toint
2024	J	`jnl`	A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks. Comput. Optim. Appl. Serge Gratton, Valentin Mercier, Elisa Riccietti, Philippe L. Toint
2024	J	`jnl`	Examples of slow convergence for adaptive regularization optimization methods are not isolated. CoRR Philippe L. Toint
2024	J	`jnl`	Preface for the special edition of optimization methods and software. Optim. Methods Softw. Serge Gratton, Philippe L. Toint, Jacek Gondzio, Yurii E. Nesterov, Yaxiang Yuan
2024	J	`jnl`	Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε CoRR Serge Gratton, Chee-Khian Sim, Philippe L. Toint
2024	J	`jnl`	S2MPJ and CUTEst optimization problems for Matlab, Python and Julia. CoRR Serge Gratton, Philippe L. Toint
2023	J	`jnl`	A Block-Coordinate Approach of Multi-level Optimization with an Application to Physics-Informed Neural Networks. CoRR Serge Gratton, Valentin Mercier, Elisa Riccietti, Philippe L. Toint
2023	J	`jnl`	An adaptive regularization method in Banach spaces. Optim. Methods Softw. Serge Gratton, Sadok Jerad, Philippe L. Toint
2023	J	`jnl`	Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an $\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}$ Complexity Bound. SIAM J. Optim. Serge Gratton, Sadok Jerad, Philippe L. Toint
2023	J	`jnl`	Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example. CoRR Philippe L. Toint
2023	J	`jnl`	Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. CoRR Serge Gratton, Alena Kopanicáková, Philippe L. Toint
2023	J	`jnl`	Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. SIAM J. Optim. Serge Gratton, Alena Kopanicáková, Philippe L. Toint
2023	J	`jnl`	OFFO minimization algorithms for second-order optimality and their complexity. Comput. Optim. Appl. Serge Gratton, Philippe L. Toint
2023	J	`jnl`	The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. J. Optim. Theory Appl. Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2022	J	`jnl`	A Note on Inexact Inner Products in GMRES. SIAM J. Matrix Anal. Appl. Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
2022	J	`jnl`	Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. J. Complex. Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2022	J	`jnl`	Exploiting Problem Structure in Derivative Free Optimization. ACM Trans. Math. Softw. Margherita Porcelli, Philippe L. Toint
2022	J	`jnl`	Parametric complexity analysis for a class of first-order Adagrad-like algorithms. CoRR Serge Gratton, Sadok Jerad, Philippe L. Toint
2022	J	`jnl`	Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques. EURO J. Comput. Optim. Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2021	J	`jnl`	An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. Serge Gratton, Ehouarn Simon, Philippe L. Toint
2021	J	`jnl`	High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. Math. Program. Xiaojun Chen, Philippe L. Toint
2021	J	`jnl`	Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points. CoRR Serge Gratton, Sadok Jerad, Philippe L. Toint
2021	J	`jnl`	Minimizing convex quadratics with variable precision conjugate gradients. Numer. Linear Algebra Appl. Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
2021	—	`conf`	Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. ICCSA (Workshops) Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2021	J	`jnl`	Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. CoRR Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2021	J	`jnl`	The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. CoRR Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2020	J	`jnl`	A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2020	J	`jnl`	A note on solving nonlinear optimization problems in variable precision. Comput. Optim. Appl. Serge Gratton, Philippe L. Toint
2020	J	`jnl`	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2019	J	`jnl`	A Note on Using Performance and Data Profiles for Training Algorithms. ACM Trans. Math. Softw. Margherita Porcelli, Philippe L. Toint
2019	J	`jnl`	Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. SIAM J. Optim. Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2019	J	`jnl`	Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. SIAM J. Optim. Xiaojun Chen, Philippe L. Toint, Hong Wang
2019	J	`jnl`	Exploiting variable precision in GMRES. CoRR Serge Gratton, Ehouarn Simon, David Titley-Péloquin, Philippe L. Toint
2019	J	`jnl`	Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2019	J	`jnl`	Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2018	J	`jnl`	A note on solving nonlinear optimization problems in variable precision. CoRR Serge Gratton, Philippe L. Toint
2018	J	`jnl`	Approximate norm descent methods for constrained nonlinear systems. Math. Comput. Benedetta Morini, Margherita Porcelli, Philippe L. Toint
2018	J	`jnl`	Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. CoRR Stefania Bellavia, Gianmarco Gurioli, Benedetta Morini, Philippe L. Toint
2018	J	`jnl`	Minimizing convex quadratic with variable precision Krylov methods. CoRR Serge Gratton, Ehouarn Simon, Philippe L. Toint
2018	J	`jnl`	Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2018	J	`jnl`	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2017	J	`jnl`	A note on using performance and data profilesfor training algorithms. CoRR Margherita Porcelli, Philippe L. Toint
2017	J	`jnl`	An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint
2017	J	`jnl`	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. Margherita Porcelli, Philippe L. Toint
2017	J	`jnl`	Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity. CoRR Xiaojun Chen, Philippe L. Toint, Hong Wang
2017	J	`jnl`	Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra Augusta Santos, Philippe L. Toint
2017	J	`jnl`	Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2016	J	`jnl`	Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models. SIAM J. Optim. Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra A. Santos, Philippe L. Toint
2016	J	`jnl`	Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints. Optim. Methods Softw. Phillipe Rodrigues Sampaio, Philippe L. Toint
2016	J	`jnl`	Simple examples for the failure of Newton's method with line search for strictly convex minimization. Math. Program. Florian Jarre, Philippe L. Toint
2015	J	`jnl`	A Stochastic and Flexible Activity Based Model for Large Population. Application to Belgium. J. Artif. Soc. Soc. Simul. Johan Barthélemy, Philippe L. Toint
2015	J	`jnl`	A derivative-free trust-funnel method for equality-constrained nonlinear optimization. Comput. Optim. Appl. Phillipe Rodrigues Sampaio, Philippe L. Toint
2015	J	`jnl`	CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Comput. Optim. Appl. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2015	J	`jnl`	Obituary for Mike Powell. Optim. Methods Softw. Coralia Cartis, Andreas Griewank, Philippe L. Toint, Ya-Xiang Yuan
2015	J	`jnl`	Observation thinning in data assimilation computations. EURO J. Comput. Optim. Serge Gratton, M. Monserrat Rincon-Camacho, Ehouarn Simon, Philippe L. Toint
2015	J	`jnl`	On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2015	J	`jnl`	Quasi-Newton updates with weighted secant equations. Optim. Methods Softw. Serge Gratton, Vincent Malmedy, Philippe L. Toint
2014	J	`jnl`	Differentiating the Method of Conjugate Gradients. SIAM J. Matrix Anal. Appl. Serge Gratton, David Titley-Péloquin, Philippe L. Toint, Jean Tshimanga Ilunga
2014	J	`jnl`	On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. Philippe L. Toint
2013	J	`jnl`	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. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems. Comput. Optim. Appl. Serge Gratton, Selime Gürol, Philippe L. Toint
2013	J	`jnl`	Synthetic Population Generation Without a Sample. Transp. Sci. Johan Barthélemy, Philippe L. Toint
2012	J	`jnl`	Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Erratum to: Nonlinear programming without a penalty function or a filter. Math. Program. Nick I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. Nicholas I. M. Gould, Margherita Porcelli, Philippe L. Toint
2012	J	`jnl`	Using approximate secant equations in limited memory methods for multilevel unconstrained optimization. Comput. Optim. Appl. Serge Gratton, Vincent Malmedy, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. Optim. Methods Softw. Serge Gratton, Philippe L. Toint, Anke Tröltzsch
2011	J	`jnl`	Approximating Hessians in unconstrained optimization arising from discretized problems. Comput. Optim. Appl. Vincent Malmedy, Philippe L. Toint
2011	J	`jnl`	Fast regularized linear sampling for inverse scattering problems. Numer. Linear Algebra Appl. M'Barek Fares, Serge Gratton, Philippe L. Toint
2011	J	`jnl`	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems. SIAM J. Matrix Anal. Appl. Serge Gratton, Philippe L. Toint, Jean Tshimanga Ilunga
2011	J	`jnl`	Stopping rules and backward error analysis for bound-constrained optimization. Numerische Mathematik Serge Gratton, Mélodie Mouffe, Philippe L. Toint
2010	J	`jnl`	A retrospective trust-region method for unconstrained optimization. Math. Program. Fabian Bastin, Vincent Malmedy, Mélodie Mouffe, Philippe L. Toint, Dimitri Tomanos
2010	J	`jnl`	Approximate invariant subspaces and quasi-newton optimization methods. Optim. Methods Softw. Serge Gratton, Philippe L. Toint
2010	J	`jnl`	Book review. Optim. Methods Softw. Philippe L. Toint
2010	J	`jnl`	Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint
2010	J	`jnl`	Estimating Nonparametric Random Utility Models with an Application to the Value of Time in Heterogeneous Populations. Transp. Sci. Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
2010	J	`jnl`	Nonlinear programming without a penalty function or a filter. Math. Program. Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization. Optim. Methods Softw. Serge Gratton, Mélodie Mouffe, Annick Sartenaer, Philippe L. Toint, Dimitri Tomanos
2010	J	`jnl`	On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. SIAM J. Optim. Katya Scheinberg, Philippe L. Toint
2009	J	`jnl`	A multilevel algorithm for solving the trust-region subproblem. Optim. Methods Softw. Philippe L. Toint, Dimitri Tomanos, M. Weber-Mendonça
2009	J	`jnl`	Recognizing underlying sparsity in optimization. Math. Program. Sunyoung Kim, Masakazu Kojima, Philippe L. Toint
2008	J	`jnl`	Preface. Optim. Methods Softw. Philippe L. Toint, Ya-Xiang Yuan
2008	J	`jnl`	Recursive Trust-Region Methods for Multiscale Nonlinear Optimization. SIAM J. Optim. Serge Gratton, Annick Sartenaer, Philippe L. Toint
2007	J	`jnl`	A filter-trust-region method for simple-bound constrained optimization. Optim. Methods Softw. Caroline Sainvitu, Philippe L. Toint
2007	J	`jnl`	FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. ACM Trans. Math. Softw. Nicholas I. M. Gould, Philippe L. Toint
2006	J	`jnl`	An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
2006	J	`jnl`	Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
2006	J	`jnl`	Exploiting problem structure in pattern search methods for unconstrained optimization. Optim. Methods Softw. Christopher John Price, Philippe L. Toint
2005	J	`jnl`	A Filter-Trust-Region Method for Unconstrained Optimization. SIAM J. Optim. Nick I. M. Gould, Caroline Sainvitu, Philippe L. Toint
2005	J	`jnl`	Optimizing partially separable functions without derivatives. Optim. Methods Softw. Benoît Colson, Philippe L. Toint
2005	J	`jnl`	Sensitivity of trust-region algorithms to their parameters. 4OR Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2004	J	`jnl`	A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares. SIAM J. Optim. Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint
2004	J	`jnl`	Nonlinear programming: theory and practice. Math. Program. Nick I. M. Gould, Sven Leyffer, Philippe L. Toint
2004	J	`jnl`	Preprocessing for quadratic programming. Math. Program. Nick I. M. Gould, Philippe L. Toint
2003	J	`jnl`	CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2003	J	`jnl`	GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2002	J	`jnl`	Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2002	J	`jnl`	Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. SIAM J. Optim. Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter
2002	J	`jnl`	On the Global Convergence of a Filter--SQP Algorithm. SIAM J. Optim. Roger Fletcher, Sven Leyffer, Philippe L. Toint
2001	J	`jnl`	Error analysis of signal zeros from a related companion matrix eigenvalue problem. Appl. Math. Lett. Fermín S. V. Bazán, Philippe L. Toint
2001	—	`conf`	Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. System Modelling and Optimization Nicholas I. M. Gould, Philippe L. Toint
2001	J	`jnl`	Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2000	J	`jnl`	A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2000	—	`book`	Trust Region Methods Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1999	J	`jnl`	A note on the convergence of barrier algorithms to second-order necessary points. Math. Program. Nicholas I. M. Gould, Philippe L. Toint
1999	—	`conf`	SQP Methods for Large-Scale Nonlinear Programming. System Modelling and Optimization Nicholas I. M. Gould, Philippe L. Toint
1999	J	`jnl`	Solving the Trust-Region Subproblem using the Lanczos Method. SIAM J. Optim. Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Philippe L. Toint
1997	J	`jnl`	A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Math. Comput. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1997	J	`jnl`	Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Math. Program. Philippe L. Toint
1997	J	`jnl`	On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants. Transp. Sci. Michel Bierlaire, Tsippy Lotan, Philippe L. Toint
1997	J	`jnl`	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. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1997	J	`jnl`	Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. Andrew R. Conn, Katya Scheinberg, Philippe L. Toint
1996	J	`jnl`	An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization. SIAM J. Sci. Comput. Philippe L. Toint
1996	J	`jnl`	Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. SIAM J. Optim. Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint
1996	J	`jnl`	Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. Andrew R. Conn, Nicholas I. M. Gould, Annick Sartenaer, Philippe L. Toint
1996	J	`jnl`	Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1995	J	`jnl`	CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Softw. Ingrid Bongartz, Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1994	J	`jnl`	A note on exploiting structure when using slack variables. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1994	J	`jnl`	On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program. D. Burton, Philippe L. Toint
1993	J	`jnl`	Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. SIAM J. Optim. Andrew R. Conn, Nick I. M. Gould, Annick Sartenaer, Philippe L. Toint
1992	J	`jnl`	LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. ACM Trans. Math. Softw. Philippe L. Toint, Daniel Tuyttens
1992	J	`jnl`	On an instance of the inverse shortest paths problem. Math. Program. D. Burton, Philippe L. Toint
1991	J	`jnl`	Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1990	J	`jnl`	On Large Scale Nonlinear Network Optimization. Math. Program. Philippe L. Toint, Daniel Tuyttens
1986	J	`jnl`	Global convergence of the partitioned BFGS algorithm for convex partially separable optimization. Math. Program. Philippe L. Toint
1984	J	`jnl`	On the existence of convex decompositions of partially separable functions. Math. Program. Andreas Griewank, Philippe L. Toint
1983	J	`jnl`	Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm. Math. Program. Robert B. Schnabel, Philippe L. Toint
1981	J	`jnl`	A note about sparsity exploiting quasi-Newton updates. Math. Program. Philippe L. Toint