CUTEst

swMATH11893MaRDI QIDQ23829

No author found.

Described by source

• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization

Related Items (only showing first 100 items - show all)

A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization ⋮ On the numerical performance of finite-difference-based methods for derivative-free optimization ⋮ Full-low evaluation methods for derivative-free optimization ⋮ An inexact first-order method for constrained nonlinear optimization ⋮ On the complexity of solving feasibility problems with regularized models ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results ⋮ An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A symmetric grouped and ordered multi-secant Quasi-Newton update formula ⋮ Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ On the Performance of SQP Methods for Nonlinear Optimization ⋮ A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization ⋮ Gradient methods exploiting spectral properties ⋮ A comparative study of null‐space factorizations for sparse symmetric saddle point systems ⋮ trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ A globally convergent gradient-like method based on the Armijo line search ⋮ An efficient hybrid conjugate gradient method for unconstrained optimization ⋮ A sequential quadratic programming algorithm for equality-constrained optimization without derivatives ⋮ Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ The Conjugate Residual Method in Linesearch and Trust-Region Methods ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ A Tridiagonalization Method for Symmetric Saddle-Point Systems ⋮ Unnamed Item ⋮ Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization ⋮ Complexity and performance of an Augmented Lagrangian algorithm ⋮ A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice ⋮ Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property ⋮ Unnamed Item ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method ⋮ Adaptive trust-region algorithms for unconstrained optimization ⋮ The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization ⋮ A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS ⋮ A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization ⋮ Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ A limited memory quasi-Newton trust-region method for box constrained optimization ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ An active-set algorithm for norm constrained quadratic problems ⋮ Sequential equality-constrained optimization for nonlinear programming ⋮ Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method ⋮ An augmented Lagrangian method exploiting an active-set strategy and second-order information ⋮ A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ Two globally convergent nonmonotone trust-region methods for unconstrained optimization ⋮ LMBOPT: a limited memory method for bound-constrained optimization ⋮ Efficient unconstrained black box optimization ⋮ Best practices for comparing optimization algorithms ⋮ Speeding up the convergence of the Polyak's heavy ball algorithm ⋮ Limited-memory BFGS with displacement aggregation ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization ⋮ An active set trust-region method for bound-constrained optimization ⋮ Learning to steer nonlinear interior-point methods ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables ⋮ A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds ⋮ A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results ⋮ An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization ⋮ Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation ⋮ Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems ⋮ A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ An interior-point implementation developed and tuned for radiation therapy treatment planning ⋮ A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization ⋮ A new restarting adaptive trust-region method for unconstrained optimization ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ A note on solving nonlinear optimization problems in variable precision ⋮ A regularization method for constrained nonlinear least squares ⋮ Preconditioned nonlinear conjugate gradient methods based on a modified secant equation ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ Exploiting negative curvature in deterministic and stochastic optimization ⋮ Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods ⋮ Two-step conjugate gradient method for unconstrained optimization ⋮ A limited-memory trust-region method for nonlinear optimization with many equality constraints ⋮ Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition ⋮ A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization ⋮ An augmented Lagrangian filter method ⋮ Iterative Solution of Symmetric Quasi-Definite Linear Systems ⋮ Scaled projected-directions methods with application to transmission tomography ⋮ A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis ⋮ Sequential quadratic programming methods for parametric nonlinear optimization ⋮ Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities ⋮ Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ Primal-dual active-set methods for large-scale optimization ⋮ On the solution of linearly constrained optimization problems by means of barrier algorithms ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization

This page was built for software: CUTEst