Philippe L. Toint

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Examples of slow convergence for adaptive regularization optimization methods are not isolated	2024	Philippe L. Toint
+ PDF Chat	Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(\epsilon^{-2})$ rather than $\mathcal{O}(\epsilon^{-2})$	2024	Serge Gratton Chee-Khian Sim Philippe L. Toint
+ PDF Chat	A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks	2024	Serge Gratton Valentin Mercier Elisa Riccietti Philippe L. Toint
+ PDF Chat	S2MPJ and CUTEst optimization problems for Matlab, Python and Julia	2024	Xavier Vasseur Philippe L. Toint
+ PDF Chat	A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity	2024	Serge Gratton Sadok Jerad Philippe L. Toint
+ PDF Chat	Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds and convex constraints	2024	Serge Gratton Sadok Jerad Philippe L. Toint
+	Yet another fast variant of Newton’s method for nonconvex optimization	2024	Serge Gratton Sadok Jerad Philippe L. Toint
+ PDF Chat	Complexity of a class of first-order objective-function-free optimization algorithms	2024	Serge Gratton Sadok Jerad Philippe L. Toint
+	The evaluation complexity of finding high-order minimizers of nonconvex optimization	2023	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training	2023	Serge Gratton Alena Kopaničáková Philippe L. Toint
+	Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an $\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}$ Complexity Bound	2023	Serge Gratton Sadok Jerad Philippe L. Toint
+	An adaptive regularization method in Banach spaces	2023	Serge Gratton Sadok Jerad Philippe L. Toint
+ PDF Chat	The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case	2023	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training	2023	S. Gratton A. Kopanicakova Philippe L. Toint
+	Yet another fast variant of Newton's method for nonconvex optimization	2023	Serge Gratton Sadok Jerad Philippe L. Toint
+	A Block-Coordinate Approach of Multi-level Optimization with an Application to Physics-Informed Neural Networks	2023	Serge Gratton Valentin Mercier Elisa Riccietti Philippe L. Toint
+	Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example	2023	Philippe L. Toint
+	An optimally fast objective-function-free minimization algorithm using random subspaces	2023	Stefania Bellavia Serge Gratton Benedetta Morini Philippe L. Toint
+ PDF Chat	OFFO minimization algorithms for second-order optimality and their complexity	2022	S. Gratton Philippe L. Toint
+	A Note on Inexact Inner Products in GMRES	2022	Serge Gratton Ehouarn Simon David Titley-Péloquin Philippe L. Toint
+ PDF Chat	Parametric complexity analysis for a class of first-order Adagrad-like algorithms	2022	Xavier Vasseur Sadok Jerad Philippe L. Toint
+	Adaptive regularization minimization algorithms with nonsmooth norms	2022	Serge Gratton Philippe L. Toint
+ PDF Chat	Exploiting Problem Structure in Derivative Free Optimization	2022	Margherita Porcelli Philippe L. Toint
+	Convergence properties of an Objective-Function-Free Optimization regularization algorithm, including an $\mathcal{O}(ε^{-3/2})$ complexity bound	2022	S. Gratton Sadok Jerad Philippe L. Toint
+	First-Order Objective-Function-Free Optimization Algorithms and Their Complexity	2022	S. Gratton Sadok Jerad Philippe L. Toint
+	A note on inexact inner products in GMRES	2022	Serge Gratton Ehouarn Simon David Titley-Péloquin Philippe L. Toint
+	Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques	2022	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	A note on inexact inner products in GMRES	2022	Serge Gratton Ehouarn Simon David Titley-Péloquin Philippe L. Toint
+	Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives	2022	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Complexity of a Class of First-Order Objective-Function-Free Optimization Algorithms	2022	S. Gratton Sadok Jerad Philippe L. Toint
+ PDF Chat	OPM, a collection of Optimization Problems in Matlab	2021	Xavier Vasseur Philippe L. Toint
+	An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values.	2021	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values	2021	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+ PDF Chat	Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points.	2021	Serge Gratton Sadok Jerad Philippe L. Toint
+	Adaptive Regularization Minimization Algorithms with Non-Smooth Norms and Euclidean Curvature	2021	Serge Gratton Philippe L. Toint
+	Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points	2021	Serge Gratton Sadok Jerad Philippe L. Toint
+	Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	OPM, a collection of Optimization Problems in Matlab	2021	Xavier Vasseur Philippe L. Toint
+	The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values	2021	Nicholas I. M. Gould Philippe L. Toint
+	Minimizing convex quadratics with variable precision conjugate gradients	2020	Serge Gratton Ehouarn Simon David Titley-Péloquin Philippe L. Toint
+	High-order Evaluation Complexity of a Stochastic Adaptive Regularization Algorithm for Nonconvex Optimization Using Inexact Function Evaluations and Randomly Perturbed Derivatives	2020	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+ PDF Chat	A note on solving nonlinear optimization problems in variable precision	2020	S. Gratton Philippe L. Toint
+	Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments	2020	Ziyan Luo Liqun Qi Philippe L. Toint
+	Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions.	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms	2020	Xiaojun Chen Philippe L. Toint
+ PDF Chat	An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity	2020	S. Gratton Ehouarn Simon Philippe L. Toint
+	Global and local information in structured derivative free optimization with BFO	2020	Margherita Porcelli Philippe L. Toint
+ PDF Chat	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives	2020	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	A stochastic cubic regularisation method with inexact function evaluations and random derivatives for finite sum minimisation	2020	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Exploiting problem structure in derivative free optimization	2020	Margherita Porcelli Philippe L. Toint
+ PDF Chat	A concise second-order complexity analysis for unconstrained optimization using high-order regularized models	2019	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	An algorithm for optimization with disjoint linear constraints and its application for predicting rain	2019	Tijana Janjić Yvonne Ruckstuhl Philippe L. Toint
+ PDF Chat	WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION	2019	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A Note on Using Performance and Data Profiles for Training Algorithms	2019	Margherita Porcelli Philippe L. Toint
+	High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms	2019	Xuqiang Chen Philippe L. Toint
+	Bernstein Concentration Inequalities for Tensors via Einstein Products	2019	Ziyan Luo Liqun Qi Philippe L. Toint
+ PDF Chat	Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities	2019	Xiaojun Chen Philippe L. Toint Hao Wang
+	Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity	2019	Serge Gratton Ehouarn Simon Philippe L. Toint
+	Exploiting variable precision in GMRES	2019	Serge Gratton Ehouarn Simon David Titley-Péloquin Philippe L. Toint
+ PDF Chat	Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization	2019	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+ PDF Chat	Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy	2019	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	An algorithm for optimization with disjoint linear constraints and its application for predicting rain	2019	Tijana Janjić Yvonne Ruckstuhl Philippe L. Toint
+	Universal regularization methods - varying the power, the smoothness and the accuracy	2018	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	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity.	2018	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Minimizing convex quadratic with variable precision Krylov methods	2018	Serge Gratton Ehouarn Simon Philippe L. Toint
+	Minimizing convex quadratic with variable precision Krylov methods	2018	Serge Gratton Ehouarn Simon Philippe L. Toint
+ PDF Chat	Guaranteeing the convergence of the saddle formulation for weakly constrained 4D‐Var data assimilation	2018	Serge Gratton Selime Gürol Ehouarn Simon Philippe L. Toint
+ PDF Chat	A note on preconditioning weighted linear least‐squares, with consequences for weakly constrained variational data assimilation	2018	Serge Gratton Selime Gürol Ehouarn Simon Philippe L. Toint
+ PDF Chat	Michael J. D. Powell. 29 July 1936—19 April 2015	2018	Martin Buhmann R. Fletcher Arieh Iserles Philippe L. Toint
+	Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization	2018	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Universal regularization methods - varying the power, the smoothness and the accuracy	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables	2017	Margherita Porcelli Philippe L. Toint
+	Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$.	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Approximate norm descent methods for constrained nonlinear systems	2017	Benedetta Morini Margherita Porcelli Philippe L. Toint
+	Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity	2017	Xiaojun Chen Philippe L. Toint Hong Wang
+	Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A note on using performance and data profilesfor training algorithms	2017	Margherita Porcelli Philippe L. Toint
+	Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization	2017	Coralia Cartis Nicholas 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 $χ$	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models	2016	E. G. Birgin John Lenon Cardoso Gardenghi J. M. Martı́nez Sandra A. Santos Philippe L. Toint
+ PDF Chat	Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization	2016	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	An interior-point trust-funnel algorithm for nonlinear optimization	2016	Frank E. Curtis Nicholas I. M. Gould Daniel P. Robinson Philippe L. Toint
+	Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints	2016	Ph. R. Sampaio Philippe L. Toint
+	Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models	2016	E. G. Birgin John Lenon Cardoso Gardenghi J. M. Martı́nez Sandra A. Santos Philippe L. Toint
+	Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models	2015	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Simple examples for the failure of Newton’s method with line search for strictly convex minimization	2015	Florian Jarre Philippe L. Toint
+	Obituary for Mike Powell	2015	Coralia Cartis Andreas Griewank Philippe L. Toint Ya-xiang Yuan
+ PDF Chat	On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods	2015	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization	2015	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+	A derivative-free trust-funnel method for equality-constrained nonlinear optimization	2014	Ph. R. Sampaio Philippe L. Toint
+ PDF Chat	Quasi-Newton updates with weighted secant equations	2014	Serge Gratton Vincent Malmedy Philippe L. Toint
+	CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization	2014	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+ PDF Chat	Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization	2014	Coralia Cartis Ph. R. Sampaio Philippe L. Toint
+	An interior-point trust-funnel algorithm for nonlinear optimization using a squared-violation feasibility measure	2014	Frank E. Curtis Nicholas I. M. Gould Daniel P. Robinson Philippe L. Toint
+ PDF Chat	Differentiating the Method of Conjugate Gradients	2014	Serge Gratton David Titley-Péloquin Philippe L. Toint Jean Tshimanga Ilunga
+ PDF Chat	On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization	2013	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	On the complexity of finding first-order critical points in constrained nonlinear optimization	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A model-based trust-region algorithm for DFO and its adaptation to handle noisy functions and gradients	2012	Anke Tröltzsch Serge Gratton Philippe L. Toint
+ PDF Chat	A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems	2012	Serge Gratton Selime Gürol Philippe L. Toint
+ PDF Chat	An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A Quadratic Programming Bibliography	2012	Nicholas I. M. Gould Philippe L. Toint
+	How much patience do you have? A worst-case perspective on smooth nonconvex optimization	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	On the complexity of the steepest-descent with exact linesearches	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Updating the regularization parameter in the adaptive cubic regularization algorithm	2011	Nicholas I. M. Gould Margherita Porcelli Philippe L. Toint
+ PDF Chat	Erratum to: Nonlinear programming without a penalty function or a filter	2011	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	An active-set trust-region method for derivative-free nonlinear bound-constrained optimization	2011	Serge Gratton Philippe L. Toint Anke Tröltzsch
+	Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization	2011	Philippe L. Toint
+	Complexity bounds for second-order optimality in unconstrained optimization	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Stopping rules and backward error analysis for bound-constrained optimization	2011	Serge Gratton Mélodie Mouffe Philippe L. Toint
+	Using approximate secant equations in limited memory methods for multilevel unconstrained optimization	2011	Serge Gratton Vincent Malmedy Philippe L. Toint
+	Optimal Newton-type methods for nonconvex smooth optimization problems	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	An Interior-Point l 1 -Penalty Method for Nonlinear Optimization	2010	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+	Fast regularized linear sampling for inverse scattering problems	2010	M’Barek Fares Serge Gratton Philippe L. Toint
+	Approximating Hessians in unconstrained optimization arising from discretized problems	2010	Vincent Malmedy Philippe L. Toint
+	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity	2010	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares	2010	Stefania Bellavia Coralia Cartis Nicholas I. M. Gould Benedetta Morini Philippe L. Toint
+	On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems	2010	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization	2010	Katya Scheinberg Philippe L. Toint
+	Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization	2009	Serge Gratton Mélodie Mouffe Annick Sartenaer Philippe L. Toint Dimitri Tomanos
+	SVD-tail: a new linear-sampling reconstruction method for inverse scattering problems	2009	M’Barek Fares Serge Gratton Philippe L. Toint
+	Approximate invariant subspaces and quasi-newton optimization methods	2009	Xavier Vasseur Philippe L. Toint
+ PDF Chat	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results	2009	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Trust-region and other regularisations of linear least-squares problems	2009	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A retrospective trust-region method for unconstrained optimization	2008	Fabian Bastin Vincent Malmedy Mélodie Mouffe Philippe L. Toint Dimitri Tomanos
+	A multilevel algorithm for solving the trust-region subproblem	2008	Philippe L. Toint Dimitri Tomanos Melissa Mendonça
+ PDF Chat	Nonlinear programming without a penalty function or a filter	2008	Nicholas I. M. Gould Philippe L. Toint
+	Recognizing underlying sparsity in optimization	2008	Sun‐Young Kim Masakazu Kojima Philippe L. Toint
+	A recursive Formula-trust-region method for bound-constrained nonlinear optimization	2008	Xavier Vasseur Mélodie Mouffe Philippe L. Toint Melissa Mendonça
+	Recursive Trust-Region Methods for Multiscale Nonlinear Optimization	2008	Serge Gratton Annick Sartenaer Philippe L. Toint
+	Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares	2008	Stefania Bellavia Coralia Cartis Nim Gould Benedetta Morini Philippe L. Toint
+	Adaptive cubic overestimation methods for unconstrained optimization	2007	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	A filter-trust-region method for simple-bound constrained optimization	2007	Caroline Sainvitu 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	2007	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems	2007	Nicholas I. M. Gould Philippe L. Toint
+	A brief history of filter methods.	2007	R. Fletcher Sven Leyffer Philippe L. Toint
+ PDF Chat	Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming	2006	Nicholas I. M. Gould Philippe L. Toint
+	Exploiting problem structure in pattern search methods for unconstrained optimization	2006	C. J. Price Philippe L. Toint
+	Estimating mixed logit with non-parametric random variables.	2006	Fabian Bastin Cinzia Cirillo Philippe L. Toint
+	An adaptive Monte Carlo algorithm for computing mixed logit estimators	2005	Fabian Bastin Cinzia Cirillo Philippe L. Toint
+	Application of an adaptive Monte Carlo algorithm to mixed logit estimation	2005	Fabian Bastin Cinzia Cirillo Philippe L. Toint
+ PDF Chat	Sensitivity of trust-region algorithms to their parameters	2005	Nicholas I. M. Gould Dominique Orban Annick Sartenaer Philippe L. Toint
+	Optimizing partially separable functions without derivatives	2005	Benoît Colson Philippe L. Toint
+ PDF Chat	Numerical methods for large-scale nonlinear optimization	2005	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+ PDF Chat	A Filter-Trust-Region Method for Unconstrained Optimization	2005	Nicholas I. M. Gould Caroline Sainvitu Philippe L. Toint
+ PDF Chat	Preprocessing for quadratic programming	2004	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares	2004	Nicholas I. M. Gould Sven Leyffer Philippe L. Toint
+ PDF Chat	GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization	2003	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+ PDF Chat	CUTEr and SifDec	2003	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+ PDF Chat	Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming	2003	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	An iterative working-set method for large-scale nonconvex quadratic programming	2002	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Componentwise fast convergence in the solution of full-rank systems of nonlinear equations	2002	Philippe L. Toint Dominique Orban Nicholas I. M. Gould Annick Sartenaer
+	General CUTEr documentation	2002	Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+ PDF Chat	Numerical Methods for Large-Scale Non-Convex Quadratic Programming	2002	Nicholas I. M. Gould Philippe L. Toint
+	On the Global Convergence of a Filter--SQP Algorithm	2002	R. Fletcher Sven Leyffer Philippe L. Toint
+	Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming	2002	R. Fletcher Nicholas I. M. Gould Sven Leyffer Philippe L. Toint Andreas Wächter
+	A Derivative-Free Algorithm for Sparse Unconstrained Optimization Problems	2002	Benoît Colson Philippe L. Toint
+ PDF Chat	Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming	2001	Nicholas I. M. Gould Dominique Orban Annick Sartenaer Philippe L. Toint
+	None	2001	Benoît Colson Philippe L. Toint
+	Conditioning of infinite Hankel matrices of finite rank	2000	Fermín S. V. Bazán Philippe L. Toint
+	A primal-dual trust-region algorithm for non-convex nonlinear programming	2000	Andrew R. Conn Nicholas I. M. Gould Dominique Orban Philippe L. Toint
+	Trust Region Methods	2000	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	SQP Methods for Large-Scale Nonlinear Programming	2000	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints	2000	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Exploiting negative curvature directions in linesearch methods for unconstrained optimization	2000	Nicholas I. M. Gould Stefano Lucidi Massimo Roma Philippe L. Toint
+	A note on the convergence of barrier algorithms to second-order necessary points	1999	Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Solving the Trust-Region Subproblem using the Lanczos Method	1999	Nicholas I. M. Gould Stefano Lucidi Massimo Roma Philippe L. Toint
+	A derivative free optimization algorithm in practice	1998	Andrew R. Conn Katya Scheinberg Philippe L. Toint
+ PDF Chat	A Linesearch Algorithm with Memory for Unconstrained Optimization	1998	Nicholas I. M. Gould Stefano Lucidi Massimo Roma Philippe L. Toint
+	Recent progress in unconstrained nonlinear optimization without derivatives	1997	Andrew R. Conn Katya Scheinberg Philippe L. Toint
+ PDF Chat	Methods for Nonlinear Constraints in Optimization Calculations	1997	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints	1997	Philippe L. Toint
+ PDF Chat	A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds	1997	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	None	1997	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	A numerical comparison between the Lancelot and Minos packages for large-scale nonlinear optimization: the complete results	1997	Ingrid Bongartz Andy Conn Nicholas I. M. Gould Michael A. Saunders Philippe L. Toint
+	On the convergence of derivative-free methods for unconstrained optimization	1997	Andy Conn Katya Scheinberg Philippe L. Toint
+ PDF Chat	Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region	1996	Andrew R. Conn Nicholas I. M. Gould Annick Sartenaer Philippe L. Toint
+ PDF Chat	Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints	1996	Andrew R. Conn Nicholas I. M. Gould Annick Sartenaer Philippe L. Toint
+	An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization	1996	Philippe L. Toint
+ PDF Chat	Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization	1996	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	An Algorithm using Quadratic Interpolation for Unconstrained Derivative Free Optimization	1996	Andrew R. Conn Philippe L. Toint
+ PDF Chat	CUTE	1995	Ingrid Bongartz Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	A note on exploiting structure when using slack variables	1994	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization	1994	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach	1994	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Large-scale Nonlinear Constrained Optimization: a Current Survey	1994	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Performance of a Multifrontal Scheme for Partially Separable Optimization	1994	Andrew R. Conn Nicholas I. M. Gould M. Lescrenier Philippe L. Toint
+	Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints	1993	Andrew R. Conn Nicholas I. M. Gould Annick Sartenaer Philippe L. Toint
+	CUTE: constrained and unconstrained testing environment	1993	Ingrid Bongartz AR Conn Nim Gould Philippe L. Toint
+	Large-Scale Nonlinear Constrained Optimization	1993	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems	1992	Philippe L. Toint Daniel Tuyttens
+	Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)	1992	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Large-scale nonlinear constrained optimization	1992	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	On an instance of the inverse shortest paths problem	1992	D. Burton Philippe L. Toint
+	Introduction	1992	A. R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds	1991	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Convergence of quasi-Newton matrices generated by the symmetric rank one update	1991	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	On iterative algorithms for linear least squares problems with bound constraints	1991	Michel Bierlaire Philippe L. Toint Daniel Tuyttens
+	SOME COMMENTS ON DYNAMIC TRAFFIC MODELLING IN THE PRESENCE OF ADVANCED DRIVER INFORMATION SYSTEMS	1991	P Dehoux Philippe L. Toint
+	On large scale nonlinear Network optimization	1990	Philippe L. Toint Daniel Tuyttens
+ PDF Chat	Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds	1989	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds	1988	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables	1988	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space	1988	Philippe L. Toint
+ PDF Chat	Testing a class of methods for solving minimization problems with simple bounds on the variables	1988	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint
+	On Large Scale Nonlinear Least Squares Calculations	1987	Philippe L. Toint
+	Two new methods for solving large scale least squares in geodetic surveying computations	1986	Ch. Murigande P. Pâquet Philippe L. Toint
+	Global convergence of the partitioned BFGS algorithm for convex partially separable optimization	1986	Philippe L. Toint
+	A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems	1986	Gene H. Golub Pierre Manneback Philippe L. Toint
+ PDF Chat	Numerical Solution of Large Sets of Algebraic Nonlinear Equations	1986	Philippe L. Toint
+ PDF Chat	Numerical solution of large sets of algebraic nonlinear equations	1986	Philippe L. Toint
+	A Modification of an Algorithm by Golub and Plemmons for Large Linear Least Squares in the Context of Doppler Positioning	1985	Pierre Manneback Ch. Murigande Philippe L. Toint
+ PDF Chat	Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations	1984	D. Goldfarb Philippe L. Toint
+	Numerical experiments with partially separable optimization problems	1984	Andreas Griewank Philippe L. Toint
+ PDF Chat	Optimal estimation of Jacobian and Hessian matrices that arise in finite difference calculations	1984	Donald Goldfarb Philippe L. Toint
+	On the existence of convex decompositions of partially separable functions	1984	Andreas Griewank Philippe L. Toint
+	Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm	1983	R. B. Schnabel Philippe L. Toint
+	Local convergence analysis for partitioned quasi-Newton updates	1982	Andreas Griewank Philippe L. Toint
+	Partitioned variable metric updates for large structured optimization problems	1982	Andreas Griewank Philippe L. Toint
+	On the unconstrained optimization of partially separable functions	1982	Andreas Griewank Philippe L. Toint
+	A note about sparsity exploiting quasi-Newton updates	1981	Philippe L. Toint
+ PDF Chat	A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm	1981	Philippe L. Toint
+	The Shanno-Toint Procedure for Updating Sparse Symmetric Matrices	1981	M. J. D. Powell Philippe L. Toint
+ PDF Chat	A sparse quasi-Newton update derived variationally with a nondiagonally weighted Frobenius norm	1981	Philippe L. Toint
+	Towards an Efficient Sparsity Exploiting Newton Method for Minimization	1981	Philippe L. Toint
+	On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem	1979	Philippe L. Toint
+	On the Estimation of Sparse Hessian Matrices	1979	M. J. D. Powell Philippe L. Toint
+ PDF Chat	On the accelerating property of an algorithm for function minimization without calculating derivatives	1978	F. M. Calliee Philippe L. Toint
+ PDF Chat	Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization	1978	Philippe L. Toint
+ PDF Chat	Some numerical results using a sparse matrix updating formula in unconstrained optimization	1978	Philippe L. Toint
+	On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms	1977	Philippe L. Toint Frank M. Callier
+	On the accelerating property of an algorithm for function minimization without calculating derivatives	1977	Philippe L. Toint Frank M. Callier
+ PDF Chat	On Sparse and Symmetric Matrix Updating Subject to a Linear Equation	1977	Philippe L. Toint
+ PDF Chat	On sparse and symmetric matrix updating subject to a linear equation	1977	Philippe L. Toint

Common Coauthors

Coauthor	Papers Together
Nicholas I. M. Gould	104
Coralia Cartis	46
Serge Gratton	37
Andrew R. Conn	28
Benedetta Morini	17
Stefania Bellavia	16
Gianmarco Gurioli	13
Ehouarn Simon	11
Dominique Orban	11
Margherita Porcelli	8
Annick Sartenaer	8
Sadok Jerad	7
S. Gratton	7
Andreas Griewank	6
Sadok Jerad	6
Xavier Vasseur	6
David Titley-Péloquin	6
Vincent Malmedy	4
Fabian Bastin	4
Katya Scheinberg	4
Sven Leyffer	4
Mélodie Mouffe	4
Benoît Colson	3
Stefano Lucidi	3
Dimitri Tomanos	3
Xiaojun Chen	3
R. Fletcher	3
Cinzia Cirillo	3
Selime Gürol	3
Ingrid Bongartz	3
Ph. R. Sampaio	3
Massimo Roma	3
Daniel Tuyttens	3
Caroline Sainvitu	2
Frank E. Curtis	2
Valentin Mercier	2
Liqun Qi	2
Pierre Manneback	2
Elisa Riccietti	2
Tijana Janjić	2
John Lenon Cardoso Gardenghi	2
Anke Tröltzsch	2
Sandra A. Santos	2
Melissa Mendonça	2
J. M. Martı́nez	2
Frank M. Callier	2
Ziyan Luo	2
Daniel P. Robinson	2
Yvonne Ruckstuhl	2
E. G. Birgin	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Trust Region Methods	2000	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	73
+	Numerical Methods for Unconstrained Optimization and Nonlinear Equations	1996	J. E. Dennis Robert B. Schnabel	51
+	Cubic regularization of Newton method and its global performance	2006	Yurii Nesterov B. T. Polyak	46
+	Recursive Trust-Region Methods for Multiscale Nonlinear Optimization	2008	Serge Gratton Annick Sartenaer Philippe L. Toint	41
+	Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)	1992	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	33
+	On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems	2010	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	31
+	Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds	1988	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	30
+	Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models	2016	E. G. Birgin John Lenon Cardoso Gardenghi J. M. Martı́nez Sandra A. Santos Philippe L. Toint	29
+ PDF Chat	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results	2009	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	29
+	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity	2010	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	29
+	On the unconstrained optimization of partially separable functions	1982	Andreas Griewank Philippe L. Toint	26
+ PDF Chat	The Conjugate Gradient Method and Trust Regions in Large Scale Optimization	1983	Trond Steihaug	24
+ PDF Chat	An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	23
+	A New Algorithm for Unconstrained Optimization	1970	M. J. D. Powell	23
+ PDF Chat	Solving the Trust-Region Subproblem using the Lanczos Method	1999	Nicholas I. M. Gould Stefano Lucidi Massimo Roma Philippe L. Toint	23
+ PDF Chat	CUTE	1995	Ingrid Bongartz Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	22
+	Partitioned variable metric updates for large structured optimization problems	1982	Andreas Griewank Philippe L. Toint	22
+	Towards an Efficient Sparsity Exploiting Newton Method for Minimization	1981	Philippe L. Toint	21
+ PDF Chat	Benchmarking optimization software with performance profiles	2002	Elizabeth D. Dolan Jorge J. Morè	20
+	Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space	1988	Philippe L. Toint	19
+	Affine conjugate adaptive Newton methods for nonlinear elastomechanics	2006	Martin Weiser Peter Deuflhard Bodo Erdmann	19
+	Practical Methods of Optimization	2009	R. Ian Fletcher	19
+ PDF Chat	Testing a class of methods for solving minimization problems with simple bounds on the variables	1988	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	18
+ PDF Chat	CUTEr and SifDec	2003	Nicholas I. M. Gould Dominique Orban Philippe L. Toint	18
+ PDF Chat	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	18
+ PDF Chat	GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization	2003	Nicholas I. M. Gould Dominique Orban Philippe L. Toint	17
+	Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints	1993	Andrew R. Conn Nicholas I. M. Gould Annick Sartenaer Philippe L. Toint	17
+	Iterative Solution of Nonlinear Equations in Several Variables	2000	J. M. Ortega Werner C. Rheinboldt	17
+	Recent Developments in Algorithms and Software for Trust Region Methods	1983	Jorge J. Morè	17
+ PDF Chat	Black-Box Complexity of Local Minimization	1993	Stephen A. Vavasis	16
+ PDF Chat	Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization	2019	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint	16
+ PDF Chat	On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	16
+	Iterative Solution of Nonlinear Equations in Several Variables	1971	E. I. J. M. Ortega Werner C. Rheinboldt	16
+	Nonlinear programming without a penalty function	2002	R. Fletcher Sven Leyffer	15
+ PDF Chat	Testing Unconstrained Optimization Software	1981	Jorge J. Morè B. S. Garbow K. E. Hillstrom	14
+	On the Solution of Large Quadratic Programming Problems with Bound Constraints	1991	Jorge J. Morè Gerardo Toraldo	14
+ PDF Chat	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	14
+ PDF Chat	On sparse and symmetric matrix updating subject to a linear equation	1977	Philippe L. Toint	13
+	Convergence properties of trust region methods for linear and convex constraints	1990	James V. Burke Jorge J. Morè Gerardo Toraldo	13
+	Nonlinear Programming: Sequential Unconstrained Minimization Techniques	1968	Anthony V. Fiacco Garth P. McCormick	13
+	Inexact Newton Methods	1982	Ron S. Dembo Stanley C. Eisenstat Trond Steihaug	13
+ PDF Chat	Global convergence rate analysis of unconstrained optimization methods based on probabilistic models	2017	Coralia Cartis Katya Scheinberg	13
+	Complexity bounds for second-order optimality in unconstrained optimization	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	13
+	CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization	2014	Nicholas I. M. Gould Dominique Orban Philippe L. Toint	12
+	Interior methods for constrained optimization	1992	Margaret H. Wright	12
+ PDF Chat	Trust-region and other regularisations of linear least-squares problems	2009	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	12
+	Local convergence analysis for partitioned quasi-Newton updates	1982	Andreas Griewank Philippe L. Toint	12
+	A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation	1994	M. J. D. Powell	12
+	Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming	2002	R. Fletcher Nicholas I. M. Gould Sven Leyffer Philippe L. Toint Andreas Wächter	11
+	A primal-dual trust-region algorithm for non-convex nonlinear programming	2000	Andrew R. Conn Nicholas I. M. Gould Dominique Orban Philippe L. Toint	11