A note about sparsity exploiting quasi-Newton updates. - Philippe L. Toint (Math. Program., 1981)

Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm. - Robert B. Schnabel; Philippe L. Toint (Math. Program., 1983)

On the existence of convex decompositions of partially separable functions. - Andreas Griewank; Philippe L. Toint (Math. Program., 1984)

Global convergence of the partitioned BFGS algorithm for convex partially separable optimization. - Philippe L. Toint (Math. Program., 1986)

On Large Scale Nonlinear Network Optimization. - Philippe L. Toint; Daniel Tuyttens (Math. Program., 1990)

Convergence of quasi-Newton matrices generated by the symmetric rank one update. - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 1991)

On an instance of the inverse shortest paths problem. - D. Burton; Philippe L. Toint (Math. Program., 1992)

LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. - Philippe L. Toint; Daniel Tuyttens (ACM Trans. Math. Softw., 1992)

Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints. - Andrew R. Conn; Nick I. M. Gould; Annick Sartenaer; Philippe L. Toint (SIAM J. Optim., 1993)

On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. - D. Burton; Philippe L. Toint (Math. Program., 1994)

A note on exploiting structure when using slack variables. - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 1994)

CUTE: Constrained and Unconstrained Testing Environment. - Ingrid Bongartz; Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (ACM Trans. Math. Softw., 1995)

Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 1996)

Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. - Andrew R. Conn; Nicholas I. M. Gould; Annick Sartenaer; Philippe L. Toint (SIAM J. Optim., 1996)

Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region. - Andrew R. Conn; Nick I. M. Gould; Annick Sartenaer; Philippe L. Toint (SIAM J. Optim., 1996)

An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization. - Philippe L. Toint (SIAM J. Sci. Comput., 1996)

On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds. - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (Comput. Optim. Appl., 1997)

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (Math. Comput., 1997)

Recent progress in unconstrained nonlinear optimization without derivatives. - Andrew R. Conn; Katya Scheinberg; Philippe L. Toint (Math. Program., 1997)

Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. - Philippe L. Toint (Math. Program., 1997)

On The Overspecification of Multinomial and Nested Logit Models Due to Alternative Specific Constants. - Michel Bierlaire; Tsippy Lotan; Philippe L. Toint (Transp. Sci., 1997)

SQP Methods for Large-Scale Nonlinear Programming. - Nicholas I. M. Gould; Philippe L. Toint (System Modelling and Optimization, 1999)

A note on the convergence of barrier algorithms to second-order necessary points. - Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 1999)

Solving the Trust-Region Subproblem using the Lanczos Method. - Nicholas I. M. Gould; Stefano Lucidi; Massimo Roma; Philippe L. Toint (SIAM J. Optim., 1999)

Trust Region Methods - Andrew R. Conn; Nicholas I. M. Gould; Philippe L. Toint (SIAM, 2000)

A primal-dual trust-region algorithm for non-convex nonlinear programming. - Andrew R. Conn; Nicholas I. M. Gould; Dominique Orban; Philippe L. Toint (Math. Program., 2000)

Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. - Nicholas I. M. Gould; Philippe L. Toint (System Modelling and Optimization, 2001)

Error analysis of signal zeros from a related companion matrix eigenvalue problem. - Fermín S. V. Bazán; Philippe L. Toint (Appl. Math. Lett., 2001)

Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. - Nicholas I. M. Gould; Dominique Orban; Annick Sartenaer; Philippe L. Toint (SIAM J. Optim., 2001)

Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. - Nicholas I. M. Gould; Dominique Orban; Annick Sartenaer; Philippe L. Toint (Math. Program., 2002)

Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. - Roger Fletcher; Nicholas I. M. Gould; Sven Leyffer; Philippe L. Toint; Andreas Wächter (SIAM J. Optim., 2002)

On the Global Convergence of a Filter–SQP Algorithm. - Roger Fletcher; Sven Leyffer; Philippe L. Toint (SIAM J. Optim., 2002)

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. - Nicholas I. M. Gould; Dominique Orban; Philippe L. Toint (ACM Trans. Math. Softw., 2003)

CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. - Nicholas I. M. Gould; Dominique Orban; Philippe L. Toint (ACM Trans. Math. Softw., 2003)

Nonlinear programming: theory and practice. - Nick I. M. Gould; Sven Leyffer; Philippe L. Toint (Math. Program., 2004)

Preprocessing for quadratic programming. - Nick I. M. Gould; Philippe L. Toint (Math. Program., 2004)

A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares. - Nicholas I. M. Gould; Sven Leyffer; Philippe L. Toint (SIAM J. Optim., 2004)

Sensitivity of trust-region algorithms to their parameters. - Nicholas I. M. Gould; Dominique Orban; Annick Sartenaer; Philippe L. Toint (4OR, 2005)

Optimizing partially separable functions without derivatives. - Benoît Colson; Philippe L. Toint (Optim. Methods Softw., 2005)

A Filter-Trust-Region Method for Unconstrained Optimization. - Nick I. M. Gould; Caroline Sainvitu; Philippe L. Toint (SIAM J. Optim., 2005)

An adaptive Monte Carlo algorithm for computing mixed logit estimators. - Fabian Bastin; Cinzia Cirillo; Philippe L. Toint (Comput. Manag. Sci., 2006)

Convergence theory for nonconvex stochastic programming with an application to mixed logit. - Fabian Bastin; Cinzia Cirillo; Philippe L. Toint (Math. Program., 2006)

Exploiting problem structure in pattern search methods for unconstrained optimization. - Christopher John Price; Philippe L. Toint (Optim. Methods Softw., 2006)

A filter-trust-region method for simple-bound constrained optimization. - Caroline Sainvitu; Philippe L. Toint (Optim. Methods Softw., 2007)

FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. - Nicholas I. M. Gould; Philippe L. Toint (ACM Trans. Math. Softw., 2007)

Preface. - Philippe L. Toint; Ya-Xiang Yuan (Optim. Methods Softw., 2008)

Recursive Trust-Region Methods for Multiscale Nonlinear Optimization. - Serge Gratton; Annick Sartenaer; Philippe L. Toint (SIAM J. Optim., 2008)

Recognizing underlying sparsity in optimization. - Sunyoung Kim; Masakazu Kojima; Philippe L. Toint (Math. Program., 2009)

A multilevel algorithm for solving the trust-region subproblem. - Philippe L. Toint; Dimitri Tomanos; M. Weber-Mendonça (Optim. Methods Softw., 2009)

A retrospective trust-region method for unconstrained optimization. - Fabian Bastin; Vincent Malmedy; Mélodie Mouffe; Philippe L. Toint; Dimitri Tomanos (Math. Program., 2010)

Nonlinear programming without a penalty function or a filter. - Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2010)

Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization. - Serge Gratton; Mélodie Mouffe; Annick Sartenaer; Philippe L. Toint; Dimitri Tomanos (Optim. Methods Softw., 2010)

Approximate invariant subspaces and quasi-newton optimization methods. - Serge Gratton; Philippe L. Toint (Optim. Methods Softw., 2010)

Book review. - Philippe L. Toint (Optim. Methods Softw., 2010)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2010)

Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. - Katya Scheinberg; Philippe L. Toint (SIAM J. Optim., 2010)

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. - Stefania Bellavia; Coralia Cartis; Nicholas I. M. Gould; Benedetta Morini; Philippe L. Toint (SIAM J. Numer. Anal., 2010)

Estimating Nonparametric Random Utility Models with an Application to the Value of Time in Heterogeneous Populations. - Fabian Bastin; Cinzia Cirillo; Philippe L. Toint (Transp. Sci., 2010)

Approximating Hessians in unconstrained optimization arising from discretized problems. - Vincent Malmedy; Philippe L. Toint (Comput. Optim. Appl., 2011)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2011)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2011)

Fast regularized linear sampling for inverse scattering problems. - M'Barek Fares; Serge Gratton; Philippe L. Toint (Numer. Linear Algebra Appl., 2011)

Stopping rules and backward error analysis for bound-constrained optimization. - Serge Gratton; Mélodie Mouffe; Philippe L. Toint (Numerische Mathematik, 2011)

An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. - Serge Gratton; Philippe L. Toint; Anke Tröltzsch (Optim. Methods Softw., 2011)

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2011)

Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems. - Serge Gratton; Philippe L. Toint; Jean Tshimanga Ilunga (SIAM J. Matrix Anal. Appl., 2011)

Updating the regularization parameter in the adaptive cubic regularization algorithm. - Nicholas I. M. Gould; Margherita Porcelli; Philippe L. Toint (Comput. Optim. Appl., 2012)

Using approximate secant equations in limited memory methods for multilevel unconstrained optimization. - Serge Gratton; Vincent Malmedy; Philippe L. Toint (Comput. Optim. Appl., 2012)

Complexity bounds for second-order optimality in unconstrained optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (J. Complex., 2012)

Erratum to: Nonlinear programming without a penalty function or a filter. - Nick I. M. Gould; Philippe L. Toint (Math. Program., 2012)

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2012)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2012)

Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems. - Serge Gratton; Selime Gürol; Philippe L. Toint (Comput. Optim. Appl., 2013)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2013)

Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. - Philippe L. Toint (Optim. Methods Softw., 2013)

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2013)

Synthetic Population Generation Without a Sample. - Johan Barthélemy; Philippe L. Toint (Transp. Sci., 2013)

On the complexity of finding first-order critical points in constrained nonlinear optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2014)

Differentiating the Method of Conjugate Gradients. - Serge Gratton; David Titley-Péloquin; Philippe L. Toint; Jean Tshimanga Ilunga (SIAM J. Matrix Anal. Appl., 2014)

CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. - Nicholas I. M. Gould; Dominique Orban; Philippe L. Toint (Comput. Optim. Appl., 2015)

A derivative-free trust-funnel method for equality-constrained nonlinear optimization. - Phillipe Rodrigues Sampaio; Philippe L. Toint (Comput. Optim. Appl., 2015)

Observation thinning in data assimilation computations. - Serge Gratton; M. Monserrat Rincon-Camacho; Ehouarn Simon; Philippe L. Toint (EURO J. Comput. Optim., 2015)

A Stochastic and Flexible Activity Based Model for Large Population. Application to Belgium. - Johan Barthélemy; Philippe L. Toint (J. Artif. Soc. Soc. Simul., 2015)

Obituary for Mike Powell. - Coralia Cartis; Andreas Griewank; Philippe L. Toint; Ya-Xiang Yuan (Optim. Methods Softw., 2015)

Quasi-Newton updates with weighted secant equations. - Serge Gratton; Vincent Malmedy; Philippe L. Toint (Optim. Methods Softw., 2015)

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Numer. Anal., 2015)

Simple examples for the failure of Newton's method with line search for strictly convex minimization. - Florian Jarre; Philippe L. Toint (Math. Program., 2016)

Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints. - Phillipe Rodrigues Sampaio; Philippe L. Toint (Optim. Methods Softw., 2016)

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models. - Ernesto G. Birgin; John Lenon Cardoso Gardenghi; José Mario Martínez; Sandra A. Santos 001; Philippe L. Toint (SIAM J. Optim., 2016)

Partially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity. - Xiaojun Chen 001; Philippe L. Toint; Hong Wang (CoRR, 2017)

Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (CoRR, 2017)

Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (CoRR, 2017)

A note on using performance and data profilesfor training algorithms. - Margherita Porcelli; Philippe L. Toint (CoRR, 2017)

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. - Ernesto G. Birgin; John Lenon Cardoso Gardenghi; José Mario Martínez; Sandra Augusta Santos; Philippe L. Toint (Math. Program., 2017)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Math. Program., 2017)

An interior-point trust-funnel algorithm for nonlinear optimization. - Frank E. Curtis; Nicholas I. M. Gould; Daniel P. Robinson; Philippe L. Toint (Math. Program., 2017)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2017)

BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables. - Margherita Porcelli; Philippe L. Toint (ACM Trans. Math. Softw., 2017)

Minimizing convex quadratic with variable precision Krylov methods. - Serge Gratton; Ehouarn Simon; Philippe L. Toint (CoRR, 2018)

Deterministic and stochastic inexact regularization algorithms for nonconvex optimization with optimal complexity. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (CoRR, 2018)

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (Found. Comput. Math., 2018)

Approximate norm descent methods for constrained nonlinear systems. - Benedetta Morini; Margherita Porcelli; Philippe L. Toint (Math. Comput., 2018)

Exploiting variable precision in GMRES. - Serge Gratton; Ehouarn Simon; David Titley-Péloquin; Philippe L. Toint (CoRR, 2019)

Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (J. Complex., 2019)

Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (SIAM J. Optim., 2019)

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2019)

Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities. - Xiaojun Chen 001; Philippe L. Toint; Hong Wang (SIAM J. Optim., 2019)

A Note on Using Performance and Data Profiles for Training Algorithms. - Margherita Porcelli; Philippe L. Toint (ACM Trans. Math. Softw., 2019)

A note on solving nonlinear optimization problems in variable precision. - Serge Gratton; Philippe L. Toint (Comput. Optim. Appl., 2020)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. - Coralia Cartis; Nick I. M. Gould; Philippe L. Toint (Optim. Methods Softw., 2020)

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. - Coralia Cartis; Nicholas I. M. Gould; Philippe L. Toint (SIAM J. Optim., 2020)

Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (ICCSA (Workshops), 2021)

Hölder Gradient Descent and Adaptive Regularization Methods in Banach Spaces for First-Order Points. - Serge Gratton; Sadok Jerad; Philippe L. Toint (CoRR, 2021)

High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. - Xiaojun Chen 001; Philippe L. Toint (Math. Program., 2021)

An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. - Serge Gratton; Ehouarn Simon; Philippe L. Toint (Math. Program., 2021)

Minimizing convex quadratics with variable precision conjugate gradients. - Serge Gratton; Ehouarn Simon; David Titley-Péloquin; Philippe L. Toint (Numer. Linear Algebra Appl., 2021)

Parametric complexity analysis for a class of first-order Adagrad-like algorithms. - Serge Gratton; Sadok Jerad; Philippe L. Toint (CoRR, 2022)

Trust-region algorithms: Probabilistic complexity and intrinsic noise with applications to subsampling techniques. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (EURO J. Comput. Optim., 2022)

Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (J. Complex., 2022)

Exploiting Problem Structure in Derivative Free Optimization. - Margherita Porcelli; Philippe L. Toint (ACM Trans. Math. Softw., 2022)

A Note on Inexact Inner Products in GMRES. - Serge Gratton; Ehouarn Simon; David Titley-Péloquin; Philippe L. Toint (SIAM J. Matrix Anal. Appl., 2022)

Divergence of the ADAM algorithm with fixed-stepsize: a (very) simple example. - Philippe L. Toint (CoRR, 2023)

The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case. - Stefania Bellavia; Gianmarco Gurioli; Benedetta Morini; Philippe L. Toint (J. Optim. Theory Appl., 2023)

OFFO minimization algorithms for second-order optimality and their complexity. - Serge Gratton; Philippe L. Toint (Comput. Optim. Appl., 2023)

Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an ( boldsymbol{ mathcal{O}( epsilon^{-3/2})} ) Complexity Bound. - Serge Gratton; Sadok Jerad; Philippe L. Toint (SIAM J. Optim., 2023)

An adaptive regularization method in Banach spaces. - Serge Gratton; Sadok Jerad; Philippe L. Toint (Optim. Methods Softw., 2023)

Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training. - Serge Gratton; Alena Kopanicáková; Philippe L. Toint (SIAM J. Optim., 2023)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia. - Serge Gratton; Philippe L. Toint (CoRR, 2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε-2) rather than 𝒪(ε-2). - Serge Gratton; Chee-Khian Sim; Philippe L. Toint (CoRR, 2024)

Examples of slow convergence for adaptive regularization optimization methods are not isolated. - Philippe L. Toint (CoRR, 2024)

Preface for the special edition of optimization methods and software. - Serge Gratton; Philippe L. Toint; Jacek Gondzio; Yurii E. Nesterov; Yaxiang Yuan (Optim. Methods Softw., 2024)

A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks. - Serge Gratton; Valentin Mercier; Elisa Riccietti; Philippe L. Toint (Comput. Optim. Appl., 2024)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity. - Serge Gratton; Sadok Jerad; Philippe L. Toint (Open J. Math. Optim., 2025)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization. - Serge Gratton; Alena Kopanicáková; Philippe L. Toint (CoRR, 2025)