Philippe L. Toint

From MaRDI portal
(Redirected from Person:816576)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks
Computational Optimization and Applications
2024-10-25Paper
The evaluation complexity of finding high-order minimizers of nonconvex optimization
International Congress of Mathematicians
2024-03-22Paper
An adaptive regularization method in Banach spaces
Optimization Methods & Software
2023-12-11Paper
An optimally fast objective-function-free minimization algorithm using random subspaces2023-10-25Paper
Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training
SIAM Journal on Optimization
2023-10-17Paper
Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
SIAM Journal on Optimization
2023-08-11Paper
Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques
EURO Journal on Computational Optimization
2023-07-12Paper
OFFO minimization algorithms for second-order optimality and their complexity
Computational Optimization and Applications
2023-04-17Paper
Adaptive regularization minimization algorithms with nonsmooth norms
IMA Journal of Numerical Analysis
2023-04-12Paper
Yet another fast variant of Newton's method for nonconvex optimization2023-02-20Paper
Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives2022-09-02Paper
A Note on Inexact Inner Products in GMRES
SIAM Journal on Matrix Analysis and Applications
2022-08-31Paper
Exploiting Problem Structure in Derivative Free Optimization
ACM Transactions on Mathematical Software
2022-03-29Paper
OFFO minimization algorithms for second-order optimality and their complexity
(available as arXiv preprint)
2022-03-07Paper
First-Order Objective-Function-Free Optimization Algorithms and Their Complexity2022-03-03Paper
OPM, a collection of Optimization Problems in Matlab2021-12-10Paper
An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values2021-11-28Paper
Adaptive Regularization Minimization Algorithms with Non-Smooth Norms and Euclidean Curvature
(available as arXiv preprint)
2021-05-17Paper
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Mathematical Programming. Series A. Series B
2021-04-23Paper
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Mathematical Programming. Series A. Series B
2021-04-23Paper
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
Mathematical Programming. Series A. Series B
2021-04-23Paper
Minimizing convex quadratics with variable precision conjugate gradients
Numerical Linear Algebra with Applications
2021-04-13Paper
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case
(available as arXiv preprint)
2021-04-06Paper
Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation2021-03-30Paper
Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization2020-11-02Paper
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Proceedings of the International Congress of Mathematicians (ICM 2018)
2020-09-22Paper
A note on solving nonlinear optimization problems in variable precision
Computational Optimization and Applications
2020-06-26Paper
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
SIAM Journal on Optimization
2020-02-25Paper
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions2020-01-29Paper
Exploiting problem structure in derivative free optimization
(available as arXiv preprint)
2020-01-14Paper
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models2019-11-20Paper
A note on using performance and data profiles for training algorithms
ACM Transactions on Mathematical Software
2019-10-18Paper
An algorithm for optimization with disjoint linear constraints and its application for predicting rain2019-09-11Paper
Exploiting variable precision in GMRES2019-07-24Paper
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
SIAM Journal on Optimization
2019-05-07Paper
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
SIAM Journal on Optimization
2019-03-22Paper
scientific article; zbMATH DE number 6987048 (Why is no real title available?)2018-11-30Paper
Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
Foundations of Computational Mathematics
2018-09-27Paper
BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
ACM Transactions on Mathematical Software
2018-08-17Paper
Minimizing convex quadratic with variable precision conjugate gradients
(available as arXiv preprint)
2018-07-17Paper
A note on preconditioning weighted linear least squares, with consequences for weakly-constrained variational data assimilation2017-09-26Paper
On the use of the saddle formulation in weakly-constrained 4D-VAR data assimilation2017-09-19Paper
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Mathematical Programming. Series A. Series B
2017-05-15Paper
An interior-point trust-funnel algorithm for nonlinear optimization
Mathematical Programming. Series A. Series B
2017-02-03Paper
Simple examples for the failure of Newton's method with line search for strictly convex minimization
Mathematical Programming. Series A. Series B
2016-08-25Paper
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
Optimization Methods & Software
2016-06-29Paper
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
SIAM Journal on Optimization
2016-04-25Paper
A model of weekly labor participation for a Belgian synthetic population
Networks and Spatial Economics
2016-03-31Paper
An interior-point \(\ell_1\)-penalty method for nonlinear optimization
Numerical Analysis and Optimization
2016-01-05Paper
Quasi-Newton updates with weighted secant equations
Optimization Methods & Software
2015-12-28Paper
Obituary for Mike Powell
Optimization Methods & Software
2015-09-04Paper
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
Computational Optimization and Applications
2015-07-01Paper
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
SIAM Journal on Numerical Analysis
2015-05-27Paper
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Optimization
2015-04-28Paper
A derivative-free trust-funnel method for equality-constrained nonlinear optimization
Computational Optimization and Applications
2015-04-20Paper
Observation thinning in data assimilation computations
EURO Journal on Computational Optimization
2015-03-12Paper
Differentiating the method of conjugate gradients
SIAM Journal on Matrix Analysis and Applications
2014-08-21Paper
On the complexity of finding first-order critical points in constrained nonlinear optimization
Mathematical Programming. Series A. Series B
2014-06-02Paper
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
SIAM Journal on Optimization
2013-12-13Paper
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Optimization Methods & Software
2013-06-24Paper
Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
Optimization Methods & Software
2013-05-30Paper
Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems
Computational Optimization and Applications
2013-02-25Paper
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
SIAM Journal on Optimization
2012-08-22Paper
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
Computational Optimization and Applications
2012-06-19Paper
Fast regularized linear sampling for inverse scattering problems.
Numerical Linear Algebra with Applications
2012-06-07Paper
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Optimization Methods & Software
2012-05-23Paper
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
SIAM Journal on Optimization
2012-03-16Paper
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
Mathematical Programming. Series A. Series B
2011-12-14Paper
An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
Optimization Methods & Software
2011-11-15Paper
Approximating Hessians in unconstrained optimization arising from discretized problems
Computational Optimization and Applications
2011-11-08Paper
Stopping rules and backward error analysis for bound-constrained optimization
Numerische Mathematik
2011-09-20Paper
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
Mathematical Programming. Series A. Series B
2011-05-11Paper
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
SIAM Journal on Optimization
2011-03-21Paper
Approximate invariant subspaces and quasi-Newton optimization methods
Optimization Methods & Software
2010-10-12Paper
Formulation and solution strategies for nonparametric nonlinear stochastic programmes with an application in finance
Optimization
2010-07-26Paper
Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
Optimization Methods & Software
2010-05-21Paper
A retrospective trust-region method for unconstrained optimization
Mathematical Programming. Series A. Series B
2010-04-15Paper
SVD-tail: a new linear-sampling reconstruction method for inverse scattering problems
Inverse Problems
2009-10-08Paper
Recognizing underlying sparsity in optimization
Mathematical Programming. Series A. Series B
2009-04-24Paper
A multilevel algorithm for solving the trust-region subproblem
Optimization Methods & Software
2009-04-14Paper
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
SIAM Journal on Optimization
2009-03-06Paper
A recursive Formula-trust-region method for bound-constrained nonlinear optimization
IMA Journal of Numerical Analysis
2008-12-02Paper
Preface
Optimization Methods & Software
2008-11-19Paper
Transfers to sustain dynamic core-theoretic cooperation in international stock pollutant control
Journal of Economic Dynamics and Control
2008-10-24Paper
An adaptive Monte Carlo algorithm for computing mixed logit estimators
Computational Management Science
2008-05-27Paper
How mature is nonlinear optimization?2008-04-14Paper
scientific article; zbMATH DE number 5232303 (Why is no real title available?)2008-02-05Paper
A filter-trust-region method for simple-bound constrained optimization
Optimization Methods & Software
2008-01-21Paper
Numerical methods for large-scale nonlinear optimization
Acta Numerica
2007-03-23Paper
Global convergence of a non-monotone trust-region filter algorithm for nonlinear programming2006-10-24Paper
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Mathematical Programming. Series A. Series B
2006-09-12Paper
Exploiting problem structure in pattern search methods for unconstrained optimization
Optimization Methods & Software
2006-06-16Paper
A Filter-Trust-Region Method for Unconstrained Optimization
SIAM Journal on Optimization
2006-05-30Paper
Sensitivity of trust-region algorithms to their parameters
4OR
2006-03-09Paper
Optimizing partially separable functions without derivatives
Optimization Methods & Software
2006-01-10Paper
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
ACM Transactions on Mathematical Software
2005-07-21Paper
CUTEr and SifDec
ACM Transactions on Mathematical Software
2005-07-21Paper
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
SIAM Journal on Optimization
2005-02-23Paper
Preface: Nonlinear programming: theory and practice. Celebrating the 65th birthday of Roger Fletcher.
Mathematical Programming. Series A. Series B
2005-01-03Paper
Preprocessing for quadratic programming
Mathematical Programming. Series A. Series B
2005-01-03Paper
scientific article; zbMATH DE number 2102032 (Why is no real title available?)2004-09-22Paper
scientific article; zbMATH DE number 1971709 (Why is no real title available?)2004-01-25Paper
Exploiting band structure in unconstrained optimization without derivatives
Optimization and Engineering
2003-03-12Paper
An iterative working-set method for large-scale nonconvex quadratic programming
Applied Numerical Mathematics
2003-03-10Paper
On the Global Convergence of a Filter--SQP Algorithm
SIAM Journal on Optimization
2003-01-05Paper
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
SIAM Journal on Optimization
2003-01-05Paper
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
Mathematical Programming. Series A. Series B
2002-12-01Paper
Error analysis of signal zeros from a related companion matrix eigenvalue problem.
Applied Mathematics Letters
2002-01-02Paper
A primal-dual trust-region algorithm for non-convex nonlinear programming
Mathematical Programming. Series A. Series B
2001-09-10Paper
scientific article; zbMATH DE number 1552017 (Why is no real title available?)2001-07-02Paper
Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
SIAM Journal on Optimization
2001-06-21Paper
scientific article; zbMATH DE number 1568981 (Why is no real title available?)2001-02-22Paper
A note on the convergence of barrier algorithms to second-order necessary points
Mathematical Programming. Series A. Series B
2001-02-09Paper
Conditioning of infinite Hankel matrices of finite rank
Systems & Control Letters
2000-12-12Paper
Trust Region Methods2000-10-10Paper
scientific article; zbMATH DE number 1424213 (Why is no real title available?)2000-06-07Paper
Solving the Trust-Region Subproblem using the Lanczos Method
SIAM Journal on Optimization
1999-11-24Paper
On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants
Transportation Science
1999-03-16Paper
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
Mathematical Programming. Series A. Series B
1998-07-27Paper
Recent progress in unconstrained nonlinear optimization without derivatives
Mathematical Programming. Series A. Series B
1998-05-25Paper
scientific article; zbMATH DE number 1069183 (Why is no real title available?)1998-02-25Paper
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
ACM Transactions on Mathematical Software
1998-02-09Paper
scientific article; zbMATH DE number 992793 (Why is no real title available?)1997-03-18Paper
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
Mathematics of Computation
1997-01-09Paper
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
SIAM Journal on Optimization
1996-12-01Paper
An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
SIAM Journal on Scientific Computing
1996-07-02Paper
Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
Mathematical Programming. Series A. Series B
1996-07-01Paper
scientific article; zbMATH DE number 778135 (Why is no real title available?)1996-01-14Paper
scientific article; zbMATH DE number 653037 (Why is no real title available?)1995-03-28Paper
A note on exploiting structure when using slack variables
Mathematical Programming. Series A. Series B
1994-12-11Paper
A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization
Numerische Mathematik
1994-11-21Paper
scientific article; zbMATH DE number 679859 (Why is no real title available?)1994-10-30Paper
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
SIAM Journal on Optimization
1993-06-29Paper
scientific article; zbMATH DE number 107545 (Why is no real title available?)1993-01-23Paper
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
SIAM Journal on Numerical Analysis
1991-01-01Paper
On iterative algorithms for linear least squares problems with bound constraints
Linear Algebra and its Applications
1991-01-01Paper
On large scale nonlinear network optimization
Mathematical Programming. Series A. Series B
1990-01-01Paper
Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
IMA Journal of Numerical Analysis
1988-01-01Paper
Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables1988-01-01Paper
On Large Scale Nonlinear Least Squares Calculations
SIAM Journal on Scientific and Statistical Computing
1987-01-01Paper
scientific article; zbMATH DE number 4012327 (Why is no real title available?)1987-01-01Paper
Numerical Solution of Large Sets of Algebraic Nonlinear Equations1986-01-01Paper
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
Mathematical Programming
1986-01-01Paper
A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems
SIAM Journal on Scientific and Statistical Computing
1986-01-01Paper
A Modification of an Algorithm by Golub and Plemmons for Large Linear Least Squares in the Context of Doppler Positioning
IMA Journal of Numerical Analysis
1985-01-01Paper
On the existence of convex decompositions of partially separable functions
Mathematical Programming
1984-01-01Paper
scientific article; zbMATH DE number 3843081 (Why is no real title available?)1984-01-01Paper
Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations1984-01-01Paper
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm
Mathematical Programming
1983-01-01Paper
Partitioned variable metric updates for large structured optimization problems
Numerische Mathematik
1982-01-01Paper
Local convergence analysis for partitioned quasi-Newton updates
Numerische Mathematik
1982-01-01Paper
scientific article; zbMATH DE number 3898623 (Why is no real title available?)1982-01-01Paper
A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm1981-01-01Paper
scientific article; zbMATH DE number 3725604 (Why is no real title available?)1981-01-01Paper
A note about sparsity exploiting quasi-Newton updates
Mathematical Programming
1981-01-01Paper
The Shanno-Toint Procedure for Updating Sparse Symmetric Matrices
IMA Journal of Numerical Analysis
1981-01-01Paper
scientific article; zbMATH DE number 3725181 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3672028 (Why is no real title available?)1980-01-01Paper
On the Estimation of Sparse Hessian Matrices
SIAM Journal on Numerical Analysis
1979-01-01Paper
On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
SIAM Journal on Numerical Analysis
1979-01-01Paper
Errata corrige to On the accelerating property of an algorithm for function minimization without calculating derivatives
Journal of Optimization Theory and Applications
1978-01-01Paper
scientific article; zbMATH DE number 3611088 (Why is no real title available?)1978-01-01Paper
Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization1978-01-01Paper
On the accelerating property of an algorithm for function minimization without calculating derivatives
Journal of Optimization Theory and Applications
1977-01-01Paper
On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms
Journal of Optimization Theory and Applications
1977-01-01Paper
scientific article; zbMATH DE number 3554011 (Why is no real title available?)1977-01-01Paper
On Sparse and Symmetric Matrix Updating Subject to a Linear Equation1977-01-01Paper


Research outcomes over time


This page was built for person: Philippe L. Toint