The following pages link to CUTEr and SifDec (Q5461068):
Displaying 50 items.
- A curvilinear method based on minimal-memory BFGS updates (Q711340) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- A modified nonmonotone trust region line search method (Q721572) (← links)
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization (Q732778) (← links)
- A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems (Q827073) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- An inexact Newton method for nonconvex equality constrained optimization (Q847853) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- A modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- Sparse quasi-Newton updates with positive definite matrix completion (Q930341) (← links)
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method (Q933809) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- A new regularized quasi-Newton algorithm for unconstrained optimization (Q1636866) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Two accelerated nonmonotone adaptive trust region line search methods (Q1652801) (← links)
- Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (Q1653949) (← links)
- An improved Perry conjugate gradient method with adaptive parameter choice (Q1656676) (← links)
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
- Line search filter inexact secant methods for nonlinear equality constrained optimization (Q1663551) (← links)
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization (Q1666716) (← links)
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints (Q1713237) (← links)
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization (Q1723529) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- An indicator for the switch from derivative-free to derivative-based optimization (Q1728260) (← links)
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
- MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
