A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
From MaRDI portal
Publication:2436686
Recommendations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Nonmonotone trust region algorithm for unconstrained optimization problems
- A non-monotone line search algorithm for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
Cites work
- A New Active Set Algorithm for Box Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A survey of nonlinear conjugate gradient methods
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Adaptive two-point stepsize gradient algorithm
- Benchmarking optimization software with performance profiles.
- CUTE
- Introductory lectures on convex optimization. A basic course.
- Robust Stochastic Approximation Approach to Stochastic Programming
- The Limited Memory Conjugate Gradient Method
Cited in
(1)
This page was built for publication: A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436686)