A new nonmonotone line search technique for unconstrained optimization

DOI10.1016/j.cam.2007.07.008zbMath1149.65045OpenAlexW2077006036MaRDI QIDQ5900212

Pu, Dingguo, Zhensheng Yu

Publication date: 8 August 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2007.07.008

zbMATH Keywords

unconstrained optimizationglobal convergencememoryless quasi-Newton methodnonmonotone F-rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (13)

A nonmonotone line search slackness technique for unconstrained optimization ⋮ An adaptive nonmonotone line search technique for solving systems of nonlinear equations ⋮ A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem ⋮ A nonmonotone adaptive trust region method based on conic model for unconstrained optimization ⋮ An improved nonmonotone filter trust region method for equality constrained optimization ⋮ A nonmonotone line search filter algorithm for the system of nonlinear equations ⋮ A nonmonotone line search method for noisy minimization ⋮ Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions ⋮ A kind of nonmonotone filter method for nonlinear complementarity problem ⋮ A smoothing and regularization Broyden-like method for nonlinear inequalities ⋮ A modified SQP method with nonmonotone technique and its global convergence ⋮ A nonmonotone line search method and its convergence for unconstrained optimization ⋮ A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function

Cites Work

• Unnamed Item
• Unnamed Item
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Representations of quasi-Newton matrices and their use in limited memory methods
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• Convergence of the nonmonotone Perry and Shanno method for optimization
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• A combined conjugate-gradient quasi-Newton minimization algorithm
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef:
• On the nonmonotone line search

This page was built for publication: A new nonmonotone line search technique for unconstrained optimization