An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
From MaRDI portal
Publication:2453471
DOI10.1007/s11075-013-9723-xzbMath1293.65087OpenAlexW1999842813MaRDI QIDQ2453471
Keyvan Amini, Masoud Ahookhosh, Hadi Nosratipour
Publication date: 6 June 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9723-x
unconstrained optimizationglobal convergencenumerical resultnonmonotone techniqueArmijo-type line search\(R\)-linear convergence
Related Items
A nonmonotone inexact Newton method for unconstrained optimization, An adaptive nonmonotone global Barzilai–Borwein gradient 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, Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods, Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization, Two globally convergent nonmonotone trust-region methods 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 extended nonmonotone line search technique for large-scale unconstrained optimization, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing, An adaptive modified three-term conjugate gradient method with global convergence, An efficient nonmonotone method for state-constrained elliptic optimal control problems, On the nonmonotonicity degree of nonmonotone line searches, A new generalized shrinkage conjugate gradient method for sparse recovery, Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization, Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization, A generalized worst-case complexity analysis for non-monotone line searches, Unnamed Item, On efficiency of nonmonotone Armijo-type line searches, A nonmonotone line search for the LBFGS method in parabolic optimal control problems, Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity, Unnamed Item, Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient nonmonotone trust-region method for unconstrained optimization
- Modified nonmonotone Armijo line search for descent method
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems
- A non-monotone line search algorithm for unconstrained optimization
- On the limited memory BFGS method for large scale optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- Convergence of nonmonotone line search method
- Minimization of functions having Lipschitz continuous first partial derivatives
- A class of nonmonotone Armijo-type line search method for unconstrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
