| Publication | Date of Publication | Type |
|---|
| The evaluation complexity of finding high-order minimizers of nonconvex optimization | 2024-03-22 | Paper |
| Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives | 2022-09-02 | Paper |
| WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION | 2020-09-22 | Paper |
| On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces | 2020-08-17 | Paper |
| Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints | 2020-02-25 | Paper |
| Error estimates for iterative algorithms for minimizing regularized quadratic subproblems | 2020-01-21 | Paper |
| Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models | 2019-11-20 | Paper |
| Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems | 2019-06-13 | Paper |
| The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems | 2018-02-05 | Paper |
| A dual gradient-projection method for large-scale strictly convex quadratic problems | 2017-07-28 | Paper |
| A Note on Performance Profiles for Benchmarking Software | 2017-06-30 | Paper |
| An interior-point trust-funnel algorithm for nonlinear optimization | 2017-02-03 | Paper |
| A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints | 2016-12-30 | Paper |
| Adaptive augmented Lagrangian methods: algorithms and practical numerical experience | 2016-06-10 | Paper |
| A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results | 2015-10-01 | Paper |
| CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization | 2015-07-01 | Paper |
| On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods | 2015-05-27 | Paper |
| Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties | 2015-03-24 | Paper |
| A Filter Method with Unified Step Computation for Nonlinear Optimization | 2014-06-19 | Paper |
| On the complexity of finding first-order critical points in constrained nonlinear optimization | 2014-06-02 | Paper |
| On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization | 2013-12-13 | Paper |
| A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions | 2013-08-07 | Paper |
| Trajectory-following methods for large-scale degenerate convex quadratic programming | 2013-08-05 | Paper |
| A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function | 2013-06-24 | Paper |
| On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization | 2012-08-22 | Paper |
| How good are extrapolated bi-projection methods for linear feasibility problems? | 2012-06-19 | Paper |
| Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization | 2012-05-23 | Paper |
| A second-derivative SQP method with a 'trust-region-free' predictor step | 2012-05-04 | Paper |
| On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming | 2012-03-16 | Paper |
| Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity | 2011-12-14 | Paper |
| Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results | 2011-05-11 | Paper |
| Preconditioning Saddle-Point Systems with Applications in Optimization | 2011-03-02 | Paper |
| A Second Derivative SQP Method: Global Convergence | 2010-12-03 | Paper |
| A Second Derivative SQP Method: Local Convergence and Practical Issues | 2010-12-03 | Paper |
| Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks | 2010-08-19 | Paper |
| On solving trust-region and other regularised subproblems in optimization | 2010-06-21 | Paper |
| A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations | 2008-12-21 | Paper |
| How good are projection methods for convex feasibility problems? | 2008-05-13 | Paper |
| Using constraint preconditioners with regularized saddle-point problems | 2007-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393830 | 2006-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5493573 | 2006-10-23 | Paper |
| Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems | 2006-05-31 | Paper |
| On the Convergence of Successive Linear-Quadratic Programming Algorithms | 2006-05-30 | Paper |
| Sensitivity of trust-region algorithms to their parameters | 2006-03-09 | Paper |
| A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations | 2005-07-22 | Paper |
| GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization | 2005-07-21 | Paper |
| CUTEr and SifDec | 2005-07-21 | Paper |
| A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares | 2005-02-23 | Paper |
| An algorithm for nonlinear optimization using linear programming and equality constrained subproblems | 2005-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429132 | 2003-09-24 | Paper |
| An iterative working-set method for large-scale nonconvex quadratic programming | 2003-03-10 | Paper |
| Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming | 2003-01-05 | Paper |
| Componentwise fast convergence in the solution of full-rank systems of nonlinear equations | 2002-12-01 | Paper |
| On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760354 | 2001-12-19 | Paper |
| A primal-dual trust-region algorithm for non-convex nonlinear programming | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762516 | 2001-07-08 | Paper |
| Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712827 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762511 | 2001-02-22 | Paper |
| A note on the convergence of barrier algorithms to second-order necessary points | 2001-02-09 | Paper |
| Constraint Preconditioning for Indefinite Linear Systems | 2000-10-19 | Paper |
| Trust Region Methods | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945418 | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945417 | 2000-06-07 | Paper |
| Solving the Trust-Region Subproblem using the Lanczos Method | 1999-11-24 | Paper |
| On Modified Factorizations for Large-Scale Linearly Constrained Optimization | 1999-11-24 | Paper |
| Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques | 1998-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358712 | 1998-02-25 | Paper |
| Element-by-Element Preconditioners for Large Partially Separable Optimization Problems | 1998-02-10 | Paper |
| A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds | 1991-01-01 | Paper |
| An Algorithm for Large-Scale Quadratic Programming | 1991-01-01 | Paper |
| New crash procedures for large systems of linear constraints | 1989-01-01 | Paper |
| On the Convergence of a Sequential Penalty Function Method for Constrained Minimization | 1989-01-01 | Paper |
| Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables | 1988-01-01 | Paper |
| An exact penalty function for semi-infinite programming | 1987-01-01 | Paper |
| On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions | 1986-01-01 | Paper |
| On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem | 1985-01-01 | Paper |
| A weighted gram-schmidt method for convex quadratic programming | 1984-01-01 | Paper |
| On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms | 1984-01-01 | Paper |
