The following pages link to CUTE (Q26578):
Displaying 50 items.
- 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 hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← 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 new family of conjugate gradient methods for unconstrained optimization (Q1786950) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- A numerical study of limited memory BFGS methods (Q1861792) (← links)
- Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← 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 modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- A filter algorithm with inexact line search (Q1954692) (← links)
- Reverse bridge theorem under constraint partition (Q1958870) (← links)
- A modified nonlinear conjugate gradient method with the Armijo line search and its application (Q2007123) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
- Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization (Q2013811) (← links)
- A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
- Two limited-memory optimization methods with minimum violation of the previous secant conditions (Q2057221) (← links)
- The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique (Q2067951) (← links)
- Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search (Q2079812) (← links)
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems (Q2088792) (← links)
- A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems (Q2103178) (← links)
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems (Q2104056) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
- Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions (Q2163462) (← links)
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization (Q2171075) (← links)
- Two new conjugate gradient methods for unconstrained optimization (Q2179153) (← links)
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
