An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
From MaRDI portal
Publication:2453471
The authors are concerned with a new nonmonotone strategy and its application to the line search approach for unconstrained optimization problems of the following form: Minimize \(f(x)\), subject to \(x\), where \(f\) is a twice continuously differentiable function. The authors incorporate the proposed nonmonotone strategy into an inexact Armijo-type line search approach to construct a more relaxed line search procedure. The global convergence to first-order stationary points is proved and the \(R\)-linear convergence rate is established under suitable assumptions. Numerical results are given.
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
- A nonmonotone line search method and its convergence for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A nonmonotone line search slackness technique for unconstrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
Cites work
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An efficient nonmonotone trust-region method for unconstrained optimization
- An unconstrained optimization test functions collection
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Benchmarking optimization software with performance profiles.
- Convergence of nonmonotone line search method
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Modified nonmonotone Armijo line search for descent method
- On the limited memory BFGS method for large scale optimization
- On the nonmonotone line search
- Testing Unconstrained Optimization Software
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(41)- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- On the nonmonotonicity degree of nonmonotone line searches
- Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization
- A generalized worst-case complexity analysis for non-monotone line searches
- On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- An efficient nonmonotone method for state-constrained elliptic optimal control problems
- On efficiency of nonmonotone Armijo-type line searches
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- A nonmonotone inexact Newton method for unconstrained optimization
- A secant-based Nesterov method for convex functions
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment
- An unconstrained optimization method using nonmonotone second order Goldstein's line search
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- Modified line search strategy and its applications in the Newton method
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- A nonmonotone line search slackness technique for unconstrained optimization
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods
- A modified HS-DY-type method with nonmonotone line search for image restoration and unconstrained optimization problems
- A trust-region method using extended nonmonotone technique for unconstrained optimization
- A nonmonotone line search for the LBFGS method in parabolic optimal control problems.
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- An adaptive modified three-term conjugate gradient method with global convergence
- A non-monotone line search algorithm for unconstrained optimization
- A fast non-monotone line search for stochastic gradient descent
- A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
- Solving an augmented nonnegative matrix factorization model by modified scaled nonmonotone memoryless BFGS methods devised based on the ellipsoid vector norm
- A worst-case complexity analysis for Riemannian non-monotone line-search methods
- The generalized conditional gradient method for multiobjective composite optimization problems with non-monotone line search
- A nonmonotone adaptive Levenberg-Marquardt algorithm for solving nonlinear systems of equations
- Diagonally scaled memoryless symmetric rank-one methods with application to compressed sensing
- Iteration of complexity and asymptotic analysis of gradient-type methods with non-monotone line search on Riemannian manifolds
- A proximal gradient-based ZH-type nonmonotone trust region method for nonsmooth composite multiobjective optimization
This page was built for publication: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453471)
