Philippe L. Toint

According to our database1, Philippe L. Toint authored at least 97 papers between 1981 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities.
SIAM Journal on Optimization, 2019

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy.
SIAM Journal on Optimization, 2019

2018
Approximate norm descent methods for constrained nonlinear systems.
Math. Comput., 2018

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization.
Foundations of Computational Mathematics, 2018

2017
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., 2017

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients.
Optimization Methods and Software, 2017

An interior-point trust-funnel algorithm for nonlinear optimization.
Math. Program., 2017

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization.
Math. Program., 2017

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models.
Math. Program., 2017

2016
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models.
SIAM Journal on Optimization, 2016

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints.
Optimization Methods and Software, 2016

Simple examples for the failure of Newton's method with line search for strictly convex minimization.
Math. Program., 2016

2015
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods.
SIAM J. Numerical Analysis, 2015

Quasi-Newton updates with weighted secant equations.
Optimization Methods and Software, 2015

Obituary for Mike Powell.
Optimization Methods and Software, 2015

A Stochastic and Flexible Activity Based Model for Large Population. Application to Belgium.
J. Artificial Societies and Social Simulation, 2015

Observation thinning in data assimilation computations.
EURO J. Computational Optimization, 2015

A derivative-free trust-funnel method for equality-constrained nonlinear optimization.
Comp. Opt. and Appl., 2015

CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization.
Comp. Opt. and Appl., 2015

2014
Differentiating the Method of Conjugate Gradients.
SIAM J. Matrix Analysis Applications, 2014

On the complexity of finding first-order critical points in constrained nonlinear optimization.
Math. Program., 2014

2013
Synthetic Population Generation Without a Sample.
Transportation Science, 2013

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

Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization.
Optimization Methods and Software, 2013

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
Optimization Methods and Software, 2013

Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems.
Comp. Opt. and Appl., 2013

2012
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
SIAM Journal on Optimization, 2012

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
Optimization Methods and Software, 2012

Erratum to: Nonlinear programming without a penalty function or a filter.
Math. Program., 2012

Complexity bounds for second-order optimality in unconstrained optimization.
J. Complexity, 2012

Using approximate secant equations in limited memory methods for multilevel unconstrained optimization.
Comp. Opt. and Appl., 2012

Updating the regularization parameter in the adaptive cubic regularization algorithm.
Comp. Opt. and Appl., 2012

2011
Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems.
SIAM J. Matrix Analysis Applications, 2011

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
SIAM Journal on Optimization, 2011

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization.
Optimization Methods and Software, 2011

Stopping rules and backward error analysis for bound-constrained optimization.
Numerische Mathematik, 2011

Fast regularized linear sampling for inverse scattering problems.
Numerical Lin. Alg. with Applic., 2011

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
Math. Program., 2011

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
Math. Program., 2011

Approximating Hessians in unconstrained optimization arising from discretized problems.
Comp. Opt. and Appl., 2011

2010
Estimating Nonparametric Random Utility Models with an Application to the Value of Time in Heterogeneous Populations.
Transportation Science, 2010

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares.
SIAM J. Numerical Analysis, 2010

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization.
SIAM Journal on Optimization, 2010

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
SIAM Journal on Optimization, 2010

Book review.
Optimization Methods and Software, 2010

Approximate invariant subspaces and quasi-newton optimization methods.
Optimization Methods and Software, 2010

Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization.
Optimization Methods and Software, 2010

Nonlinear programming without a penalty function or a filter.
Math. Program., 2010

A retrospective trust-region method for unconstrained optimization.
Math. Program., 2010

2009
A multilevel algorithm for solving the trust-region subproblem.
Optimization Methods and Software, 2009

Recognizing underlying sparsity in optimization.
Math. Program., 2009

2008
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization.
SIAM Journal on Optimization, 2008

Preface.
Optimization Methods and Software, 2008

2007
FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems.
ACM Trans. Math. Softw., 2007

A filter-trust-region method for simple-bound constrained optimization.
Optimization Methods and Software, 2007

2006
Exploiting problem structure in pattern search methods for unconstrained optimization.
Optimization Methods and Software, 2006

Convergence theory for nonconvex stochastic programming with an application to mixed logit.
Math. Program., 2006

An adaptive Monte Carlo algorithm for computing mixed logit estimators.
Comput. Manag. Science, 2006

2005
A Filter-Trust-Region Method for Unconstrained Optimization.
SIAM Journal on Optimization, 2005

Optimizing partially separable functions without derivatives.
Optimization Methods and Software, 2005

Sensitivity of trust-region algorithms to their parameters.
4OR, 2005

2004
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares.
SIAM Journal on Optimization, 2004

Preprocessing for quadratic programming.
Math. Program., 2004

Nonlinear programming: theory and practice.
Math. Program., 2004

2003
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited.
ACM Trans. Math. Softw., 2003

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization.
ACM Trans. Math. Softw., 2003

2002
On the Global Convergence of a Filter--SQP Algorithm.
SIAM Journal on Optimization, 2002

Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming.
SIAM Journal on Optimization, 2002

Componentwise fast convergence in the solution of full-rank systems of nonlinear equations.
Math. Program., 2002

2001
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming.
SIAM Journal on Optimization, 2001

Error analysis of signal zeros from a related companion matrix eigenvalue problem.
Appl. Math. Lett., 2001

Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming.
Proceedings of the System Modelling and Optimization XX, 2001

2000
A primal-dual trust-region algorithm for non-convex nonlinear programming.
Math. Program., 2000

1999
Solving the Trust-Region Subproblem using the Lanczos Method.
SIAM Journal on Optimization, 1999

A note on the convergence of barrier algorithms to second-order necessary points.
Math. Program., 1999

SQP Methods for Large-Scale Nonlinear Programming.
Proceedings of the System Modelling and Optimization: Methods, 1999

1997
On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants.
Transportation Science, 1997

Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints.
Math. Program., 1997

Recent progress in unconstrained nonlinear optimization without derivatives.
Math. Program., 1997

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds.
Math. Comput., 1997

On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds.
Comp. Opt. and Appl., 1997

1996
An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization.
SIAM J. Scientific Computing, 1996

Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region.
SIAM Journal on Optimization, 1996

Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints.
SIAM Journal on Optimization, 1996

Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization.
Math. Program., 1996

1995
CUTE: Constrained and Unconstrained Testing Environment.
ACM Trans. Math. Softw., 1995

1994
A note on exploiting structure when using slack variables.
Math. Program., 1994

On the use of an inverse shortest paths algorithm for recovering linearly correlated costs.
Math. Program., 1994

1993
Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints.
SIAM Journal on Optimization, 1993

1992
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems.
ACM Trans. Math. Softw., 1992

On an instance of the inverse shortest paths problem.
Math. Program., 1992

1991
Convergence of quasi-Newton matrices generated by the symmetric rank one update.
Math. Program., 1991

1990
On Large Scale Nonlinear Network Optimization.
Math. Program., 1990

1986
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization.
Math. Program., 1986

1984
On the existence of convex decompositions of partially separable functions.
Math. Program., 1984

1983
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm.
Math. Program., 1983

1981
A note about sparsity exploiting quasi-Newton updates.
Math. Program., 1981


  Loading...