A non-monotone line search algorithm for unconstrained optimization
From MaRDI portal
Recommendations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A new nonmonotone line search technique for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- A nonmonotone line search method and its convergence for unconstrained optimization
Cites work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A smoothing Newton algorithm for mathematical programs with complementarity constraints
- A smoothing-type algorithm for solving system of inequalities
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Numerical Optimization
- On the limited memory BFGS method for large scale optimization
- On the method of shortest residuals for unconstrained optimization
- On the nonmonotone line search
- Scaled conjugate gradient algorithms for unconstrained optimization
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(25)- A new nonmonotone line search technique for unconstrained optimization
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
- A new nonmonotone line search technique for unconstrained optimization
- A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
- A regularized smoothing Newton-type algorithm for quasi-variational inequalities
- On the nonmonotonicity degree of nonmonotone line searches
- scientific article; zbMATH DE number 3885229 (Why is no real title available?)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- A nonmonotone ODE-based method for unconstrained optimization
- A nonmonotone line search slackness technique for unconstrained optimization
- scientific article; zbMATH DE number 5926088 (Why is no real title available?)
- Efficent line search algorithm for unconstrained optimization
- General form of nonmonotone line search techniques for unconstrained optimization
- An unconstrained optimization method using nonmonotone second order Goldstein's line search
- A secant-based Nesterov method for convex functions
- A multi-layer line search method to improve the initialization of optimization algorithms
- An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions
- On efficiency of nonmonotone Armijo-type line searches
- A nonmonotone line search method for noisy minimization
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function
This page was built for publication: A non-monotone line search algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618548)
