Phillipe L. Toint

From MaRDI portal
Person:816576

Available identifiers

zbMath Open toint.philippe-lWikidataQ57557712 ScholiaQ57557712MaRDI QIDQ816576

List of research outcomes

PublicationDate of PublicationType
The evaluation complexity of finding high-order minimizers of nonconvex optimization2024-03-22Paper
An adaptive regularization method in Banach spaces2023-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 Training2023-10-17Paper
Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound2023-08-11Paper
Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques2023-07-12Paper
OFFO minimization algorithms for second-order optimality and their complexity2023-04-17Paper
Adaptive regularization minimization algorithms with nonsmooth norms2023-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 GMRES2022-08-31Paper
Exploiting Problem Structure in Derivative Free Optimization2022-03-29Paper
OFFO minimization algorithms for second-order optimality and their complexity2022-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 Curvature2021-05-17Paper
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity2021-04-23Paper
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms2021-04-23Paper
Minimizing convex quadratics with variable precision conjugate gradients2021-04-13Paper
The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case2021-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 OPTIMIZATION2020-09-22Paper
A note on solving nonlinear optimization problems in variable precision2020-06-26Paper
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints2020-02-25Paper
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions2020-01-29Paper
Exploiting problem structure in derivative free optimization2020-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 Algorithms2019-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 Singularities2019-05-07Paper
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy2019-03-22Paper
https://portal.mardi4nfdi.de/entity/Q45587712018-11-30Paper
Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization2018-09-27Paper
BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables2018-08-17Paper
Minimizing convex quadratic with variable precision conjugate gradients2018-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 models2017-05-15Paper
An interior-point trust-funnel algorithm for nonlinear optimization2017-02-03Paper
Simple examples for the failure of Newton's method with line search for strictly convex minimization2016-08-25Paper
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints2016-06-29Paper
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models2016-04-25Paper
A model of weekly labor participation for a Belgian synthetic population2016-03-31Paper
An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization2016-01-05Paper
Quasi-Newton updates with weighted secant equations2015-12-28Paper
Obituary for Mike Powell2015-09-04Paper
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization2015-07-01Paper
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods2015-05-27Paper
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization2015-04-28Paper
A derivative-free trust-funnel method for equality-constrained nonlinear optimization2015-04-20Paper
Observation thinning in data assimilation computations2015-03-12Paper
Differentiating the Method of Conjugate Gradients2014-08-21Paper
On the complexity of finding first-order critical points in constrained nonlinear optimization2014-06-02Paper
On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization2013-12-13Paper
A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function2013-06-24Paper
Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization2013-05-30Paper
Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems2013-02-25Paper
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization2012-08-22Paper
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization2012-06-19Paper
Fast regularized linear sampling for inverse scattering problems2012-06-07Paper
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization2012-05-23Paper
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming2012-03-16Paper
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity2011-12-14Paper
An active-set trust-region method for derivative-free nonlinear bound-constrained optimization2011-11-15Paper
Approximating Hessians in unconstrained optimization arising from discretized problems2011-11-08Paper
Stopping rules and backward error analysis for bound-constrained optimization2011-09-20Paper
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results2011-05-11Paper
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization2011-03-21Paper
Approximate invariant subspaces and quasi-newton optimization methods2010-10-12Paper
Formulation and solution strategies for nonparametric nonlinear stochastic programmes with an application in finance2010-07-26Paper
Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization2010-05-21Paper
A retrospective trust-region method for unconstrained optimization2010-04-15Paper
SVD-tail: a new linear-sampling reconstruction method for inverse scattering problems2009-10-08Paper
Recognizing underlying sparsity in optimization2009-04-24Paper
A multilevel algorithm for solving the trust-region subproblem2009-04-14Paper
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization2009-03-06Paper
A recursive Formula-trust-region method for bound-constrained nonlinear optimization2008-12-02Paper
Preface2008-11-19Paper
Transfers to sustain dynamic core-theoretic cooperation in international stock pollutant control2008-10-24Paper
An adaptive Monte Carlo algorithm for computing mixed logit estimators2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q54574542008-04-14Paper
https://portal.mardi4nfdi.de/entity/Q54405922008-02-05Paper
A filter-trust-region method for simple-bound constrained optimization2008-01-21Paper
Numerical methods for large-scale nonlinear optimization2007-03-23Paper
https://portal.mardi4nfdi.de/entity/Q53938302006-10-24Paper
Convergence theory for nonconvex stochastic programming with an application to mixed logit2006-09-12Paper
Exploiting problem structure in pattern search methods for unconstrained optimization2006-06-16Paper
A Filter-Trust-Region Method for Unconstrained Optimization2006-05-30Paper
Sensitivity of trust-region algorithms to their parameters2006-03-09Paper
Optimizing partially separable functions without derivatives2006-01-10Paper
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization2005-07-21Paper
CUTEr and SifDec2005-07-21Paper
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares2005-02-23Paper
Preface: Nonlinear programming: theory and practice. Celebrating the 65th birthday of Roger Fletcher.2005-01-03Paper
Preprocessing for quadratic programming2005-01-03Paper
https://portal.mardi4nfdi.de/entity/Q48172632004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44213562004-01-25Paper
Exploiting band structure in unconstrained optimization without derivatives2003-03-12Paper
An iterative working-set method for large-scale nonconvex quadratic programming2003-03-10Paper
On the Global Convergence of a Filter--SQP Algorithm2003-01-05Paper
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming2003-01-05Paper
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations2002-12-01Paper
Error analysis of signal zeros from a related companion matrix eigenvalue problem.2002-01-02Paper
A primal-dual trust-region algorithm for non-convex nonlinear programming2001-09-10Paper
https://portal.mardi4nfdi.de/entity/Q45242222001-07-02Paper
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q47625112001-02-22Paper
A note on the convergence of barrier algorithms to second-order necessary points2001-02-09Paper
Conditioning of infinite Hankel matrices of finite rank2000-12-12Paper
Trust Region Methods2000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q49454172000-06-07Paper
Solving the Trust-Region Subproblem using the Lanczos Method1999-11-24Paper
On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants1999-03-16Paper
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints1998-07-27Paper
Recent progress in unconstrained nonlinear optimization without derivatives1998-05-25Paper
https://portal.mardi4nfdi.de/entity/Q43587121998-02-25Paper
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems1998-02-09Paper
https://portal.mardi4nfdi.de/entity/Q31255151997-03-18Paper
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds1997-01-09Paper
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region1996-12-01Paper
An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization1996-07-02Paper
Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization1996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48405841996-01-14Paper
https://portal.mardi4nfdi.de/entity/Q43089121995-03-28Paper
A note on exploiting structure when using slack variables1994-12-11Paper
A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization1994-11-21Paper
https://portal.mardi4nfdi.de/entity/Q43119061994-10-30Paper
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40231461993-01-23Paper
On iterative algorithms for linear least squares problems with bound constraints1991-01-01Paper
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds1991-01-01Paper
On large scale nonlinear network optimization1990-01-01Paper
Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space1988-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 Calculations1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37620821987-01-01Paper
Numerical Solution of Large Sets of Algebraic Nonlinear Equations1986-01-01Paper
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization1986-01-01Paper
A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems1986-01-01Paper
A Modification of an Algorithm by Golub and Plemmons for Large Linear Least Squares in the Context of Doppler Positioning1985-01-01Paper
On the existence of convex decompositions of partially separable functions1984-01-01Paper
Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33132071984-01-01Paper
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm1983-01-01Paper
Partitioned variable metric updates for large structured optimization problems1982-01-01Paper
Local convergence analysis for partitioned quasi-Newton updates1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36775221982-01-01Paper
A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39143371981-01-01Paper
A note about sparsity exploiting quasi-Newton updates1981-01-01Paper
The Shanno-Toint Procedure for Updating Sparse Symmetric Matrices1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38690981980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39139821980-01-01Paper
On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem1979-01-01Paper
On the Estimation of Sparse Hessian Matrices1979-01-01Paper
Errata corrige to On the accelerating property of an algorithm for function minimization without calculating derivatives1978-01-01Paper
Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41750581978-01-01Paper
On the accelerating property of an algorithm for function minimization without calculating derivatives1977-01-01Paper
On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41276261977-01-01Paper
On Sparse and Symmetric Matrix Updating Subject to a Linear Equation1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Phillipe L. Toint