The following pages link to CUTEr (Q16200):
Displaying 50 items.
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization (Q1665439) (← links)
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization (Q1666716) (← links)
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search (Q1667567) (← links)
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← 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)
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization (Q1713247) (← links)
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (Q1715789) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization (Q1723529) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← 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)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues (Q1744053) (← 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)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (Q1770091) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Two adaptive Dai-Liao nonlinear conjugate gradient methods (Q1787816) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method (Q1856365) (← links)
- A numerical study of limited memory BFGS methods (Q1861792) (← links)
- A limited-memory multipoint symmetric secant method for bound constrained optimization (Q1861917) (← links)
- Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds (Q1876585) (← links)
- Generalized pattern searches with derivative information (Q1890302) (← links)
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (Q1890303) (← links)
- Preprocessing for quadratic programming (Q1890305) (← links)
- Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
- A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations (Q1925785) (← links)
- A regularized Newton method for degenerate unconstrained optimization problems (Q1926636) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods (Q1937015) (← links)
- Efficient use of parallelism in algorithmic parameter optimization applications (Q1941182) (← links)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (Q1941187) (← links)
