The following pages link to CUTEr (Q16200):
Displaying 50 items.
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A conjugate gradient method for unconstrained optimization problems (Q963493) (← links)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems (Q1004008) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- Global convergence of quasi-Newton methods based on adjoint Broyden updates (Q1012254) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Two modified Dai-Yuan nonlinear conjugate gradient methods (Q1014353) (← links)
- Trust-region and other regularisations of linear least-squares problems (Q1014897) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
- A modified PRP conjugate gradient method (Q1026553) (← links)
- Hybrid conjugate gradient algorithm for unconstrained optimization (Q1028610) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- A conic trust-region method and its convergence properties (Q1029835) (← links)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- A truncated descent HS conjugate gradient method and its global convergence (Q1036485) (← links)
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation (Q1039699) (← links)
- Numerical expirience with a class of self-scaling quasi-Newton algorithms (Q1264971) (← links)
- A framework for globally convergent algorithms using gradient bounding functions (Q1289400) (← links)
- New quasi-Newton equation and related methods for unconstrained optimization (Q1306664) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization (Q1363061) (← 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)
- Combining search directions using gradient flows (Q1404235) (← links)
- Feasible interior methods using slacks for nonlinear optimization (Q1410239) (← links)
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (Q1424286) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- Convergence of the nonmonotone Perry and Shanno method for optimization (Q1583585) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- On the behavior of the gradient norm in the steepest descent method (Q1610310) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method (Q1634798) (← 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 class of one parameter conjugate gradient methods (Q1664259) (← links)
