The following pages link to Phillipe L. Toint (Q816576):
Displaying 50 items.
- (Q218722) (redirect page) (← links)
- A model of weekly labor participation for a Belgian synthetic population (Q262896) (← links)
- Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
- (Q429493) (redirect page) (← links)
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
- An interior-point trust-funnel algorithm for nonlinear optimization (Q507313) (← links)
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
- Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Sensitivity of trust-region algorithms to their parameters (Q816577) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- An adaptive Monte Carlo algorithm for computing mixed logit estimators (Q926315) (← links)
- (Q951436) (redirect page) (← links)
- Transfers to sustain dynamic core-theoretic cooperation in international stock pollutant control (Q951437) (← links)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Partitioned variable metric updates for large structured optimization problems (Q1162795) (← links)
- (Q1234557) (redirect page) (← links)
- On the accelerating property of an algorithm for function minimization without calculating derivatives (Q1234558) (← links)
- On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms (Q1234559) (← links)
- Errata corrige to ''On the accelerating property of an algorithm for function minimization without calculating derivatives'' (Q1255769) (← links)
- A note on the convergence of barrier algorithms to second-order necessary points (Q1300281) (← links)
- A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization (Q1338822) (← links)
- A note on exploiting structure when using slack variables (Q1340068) (← links)
- Recent progress in unconstrained nonlinear optimization without derivatives (Q1365064) (← links)
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints (Q1373760) (← links)
- Conditioning of infinite Hankel matrices of finite rank (Q1589568) (← links)
- A primal-dual trust-region algorithm for non-convex nonlinear programming (Q1591480) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Local convergence analysis for partitioned quasi-Newton updates (Q1836466) (← links)
- Componentwise fast convergence in the solution of full-rank systems of nonlinear equations (Q1849502) (← links)
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- Exploiting band structure in unconstrained optimization without derivatives (Q1863865) (← links)
- Preface: Nonlinear programming: theory and practice. Celebrating the 65th birthday of Roger Fletcher. (Q1890301) (← links)
- Preprocessing for quadratic programming (Q1890305) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems (Q1938916) (← links)
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
- Observation thinning in data assimilation computations (Q2260913) (← links)
- Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models (Q2337587) (← links)
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization (Q2340488) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
- Convergence theory for nonconvex stochastic programming with an application to mixed logit (Q2502199) (← links)
- OFFO minimization algorithms for second-order optimality and their complexity (Q2696918) (← links)
