On efficiency of nonmonotone Armijo-type line searches
From MaRDI portal
Publication:2284837
DOI10.1016/j.apm.2016.10.055zbMath1446.65030arXiv1408.2675OpenAlexW2203904367MaRDI QIDQ2284837
Masoud Ahookhosh, Susan Ghaderi
Publication date: 15 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2675
unconstrained optimizationglobal convergencecomputational efficiencyArmijo-type line searchnonmonotone strategyfirst- and second-order black-box information
Related Items (14)
A nonmonotone inexact Newton method for unconstrained optimization ⋮ An extended projected residual algorithm for solving smooth convex optimization problems ⋮ A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ A nonmonotone line search method for stochastic optimization problems ⋮ An extended nonmonotone line search technique for large-scale 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 ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing ⋮ Conditional gradient method for vector optimization ⋮ An efficient nonmonotone method for state-constrained elliptic optimal control problems ⋮ A generalized worst-case complexity analysis for non-monotone line searches ⋮ 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 ⋮ Impulse noise removal by an adaptive trust-region method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- An efficient nonmonotone trust-region method for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- A reduced Newton method for constrained linear least-squares problems
- On the limited memory BFGS method for large scale optimization
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- An affine-scaling interior-point CBB method for box-constrained optimization
- Trust-region and other regularisations of linear least-squares problems
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Introductory lectures on convex optimization. A basic course.
- Modified two-point stepsize gradient methods for unconstrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A class on nonmonotone stabilization methods in unconstrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- A class of nonmonotone Armijo-type line search method for unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A preconditioned Newton algorithm for the nearest correlation matrix
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- A new nonmonotone line search technique for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: On efficiency of nonmonotone Armijo-type line searches
