Convergence of nonmonotone line search method
From MaRDI portal
Publication:2493941
DOI10.1016/J.CAM.2005.06.033zbMATH Open1136.90477OpenAlexW2005635176MaRDI QIDQ2493941FDOQ2493941
Authors: Jie Shen, Zhenjun Shi 
Publication date: 16 June 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.06.033
Recommendations
- New convergence method with nonmonotone line search
- A nonmonotone line search method and its convergence for unconstrained optimization
- The convergence of conjugate gradient method with nonmonotone line search
- scientific article; zbMATH DE number 2143965
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Convergence of line search methods for unconstrained optimization
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
- The convergence of equilibrium algorithms with non-monotone line search technique.
- Global convergence of line search method for nonsmooth optimization
- The global convergence of the non-quasi-Newton methods with non-monotone line search
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Testing Unconstrained Optimization Software
- CUTE
- Numerical Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Optimization. Algorithms and consistent approximations
- A Nonmonotone Line Search Technique for Newton’s Method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Title not available (Why is that?)
- On Steepest Descent
- A truncated Newton method with non-monotone line search for unconstrained optimization
- New inexact line search method for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- On the nonmonotone line search
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Convergence of line search methods for unconstrained optimization
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
Cited In (25)
- Modified nonmonotone Armijo line search for descent method
- An ODE-based nonmonotone method for unconstrained optimization problems
- A nonmonotone PSB algorithm for solving unconstrained optimization
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- The convergence of conjugate gradient method with nonmonotone line search
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- Sufficient descent directions in unconstrained optimization
- A nonmonotone line search method and its convergence for unconstrained optimization
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- A new family of conjugate gradient methods
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- A nonmonotone line search method based on a simple conic model function
- On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations
- On the nonmonotone line search
- Nonmonotone line searches for optimization algorithms
- A new nonmonotone line search technique for unconstrained optimization
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Nonmonotone adaptive trust region method
- A nonmonotone line search slackness technique for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Multivariate spectral gradient method for unconstrained optimization
- Nonmonotone line search method for nonlinear equations with simple bounds
- A nonmonotone Jacobian smoothing inexact Newton method for NCP
Uses Software
This page was built for publication: Convergence of nonmonotone line search method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493941)
