On efficiency of nonmonotone Armijo-type line searches
From MaRDI portal
Publication:2284837
Abstract: Monotonicity and nonmonotonicity play a key role in studying the global convergence and the efficiency of iterative schemes employed in the field of nonlinear optimization, where globally convergent and computationally efficient schemes are explored. This paper addresses some features of descent schemes and the motivation behind nonmonotone strategies and investigates the efficiency of an Armijo-type line search equipped with some popular nonmonotone terms. More specifically, we propose two novel nonmonotone terms, combine them into Armijo's rule and establish the global convergence of sequences generated by these schemes. Furthermore, we report extensive numerical results and comparisons indicating the performance of the nonmonotone Armijo-type line searches using the most popular search directions for solving unconstrained optimization problems. Finally, we exploit the considered nonmonotone schemes to solve an important inverse problem arising in signal and image processing.
Recommendations
- On the nonmonotone line search
- On the nonmonotonicity degree of nonmonotone line searches
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- Modified nonmonotone Armijo line search for descent method
Cites work
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- A new nonmonotone line search technique for 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 line search method for large-scale unconstrained optimization
- A preconditioned Newton algorithm for the nearest correlation matrix
- A reduced Newton method for constrained linear least-squares problems
- A truncated Newton method with non-monotone line search for unconstrained optimization
- An affine-scaling interior-point CBB method for box-constrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An efficient nonmonotone trust-region method for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- An introduction to total variation for image analysis
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Inexact spectral projected gradient methods on convex sets
- Introductory lectures on convex optimization. A basic course.
- Minimization of functions having Lipschitz continuous first partial derivatives
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- Modified two-point stepsize gradient methods for unconstrained optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the limited memory BFGS method for large scale optimization
- On the nonmonotone line search
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Trust-region and other regularisations of linear least-squares problems
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(16)- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- A generalized worst-case complexity analysis for non-monotone line searches
- An extended projected residual algorithm for solving smooth convex optimization problems
- An efficient nonmonotone method for state-constrained elliptic optimal control problems
- Secant update version of quasi-Newton PSB with weighted multisecant equations
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- A nonmonotone inexact Newton method for unconstrained optimization
- A nonmonotone line search method for stochastic optimization problems
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m n real matrix space with application in image clustering
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- Conditional gradient method for vector optimization
- Solving an augmented nonnegative matrix factorization model by modified scaled nonmonotone memoryless BFGS methods devised based on the ellipsoid vector norm
- Efficient algorithms of box-constrained nonnegative matrix factorization and its applications in image clustering
- Impulse noise removal by an adaptive trust-region method
This page was built for publication: On efficiency of nonmonotone Armijo-type line searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284837)
