Pages that link to "Item:Q1095799"
From MaRDI portal
The following pages link to A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799):
Displayed 37 items.
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
- Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems (Q853562) (← links)
- Global convergence of a memory gradient method for unconstrained optimization (Q861515) (← links)
- On the convergence of a new hybrid projection algorithm (Q882531) (← links)
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← links)
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization (Q1195967) (← links)
- A class of nonmonotone trust region algorithms for unconstrained optimization problems (Q1286707) (← links)
- Nonmonotonic trust region algorithm (Q1321301) (← links)
- A parallel asynchronous Newton algorithm for unconstrained optimization (Q1321336) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
- A class of nonmonotone stabilization trust region methods (Q1337634) (← links)
- Parallel algorithm for unconstrained optimization based on decomposition techniques (Q1379930) (← links)
- A survey of truncated-Newton methods (Q1593812) (← links)
- Nonmonotone adaptive trust-region method for unconstrained optimization problems (Q1774954) (← links)
- A nonmonotone adaptive trust region method and its convergence (Q1827231) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- Convergence and numerical results for a parallel asynchronous quasi- Newton method (Q1893309) (← links)
- A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations (Q2489332) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application (Q2569194) (← links)
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation (Q2770192) (← links)
- Convergence properties of inexact projected gradient methods (Q3446583) (← links)
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks (Q4657813) (← links)
- A derivative-based algorithm for a particular class of mixed variable optimization problems (Q4657820) (← links)
- A variant of curved search method (Q4764847) (← links)
- A numerical evaluation of some collinear scaling algorithms for unconstrained (Q4836767) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD (Q5716132) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5900212) (← links)
- On the nonmonotone line search (Q5959912) (← links)