A new nonmonotone line search technique for unconstrained optimization
From MaRDI portal
Publication:5919724
DOI10.1007/s11075-014-9866-4zbMath1309.90100OpenAlexW2076513857MaRDI QIDQ5919724
Zhong Wan, Shuai Huang, Xiao Hong Chen
Publication date: 16 April 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9866-4
Optimal statistical designs (62K05) Nonlinear programming (90C30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (20)
An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization ⋮ A new nonmonotone spectral residual method for nonsmooth nonlinear equations ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ 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 ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints ⋮ New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern ⋮ A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization ⋮ On the nonmonotonicity degree of nonmonotone line searches ⋮ OPTIMAL DECISION MAKING FOR ONLINE AND OFFLINE RETAILERS UNDER BOPS MODE ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ Optimal pricing and ordering in global supply chain management with constraints under random demand ⋮ Unnamed Item ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ A nonmonotone smoothing Newton method for circular cone programming ⋮ Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization ⋮ A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ The higher-order Levenberg–Marquardt method with Armijo type line search for nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- New cautious BFGS algorithm based on modified Armijo-type line search
- A non-monotone line search algorithm for unconstrained optimization
- A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- On the limited memory BFGS method for large scale optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Nonmonotone line search for minimax problems
- A class on nonmonotone stabilization methods in unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- 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
- Algorithm 851
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- Numerical 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
- New BFGS method for unconstrained optimization problem based on modified Armijo line search
- CUTEr and SifDec
- Convergence Conditions for Ascent Methods
- On Steepest Descent
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: A new nonmonotone line search technique for unconstrained optimization
