A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization

This paper mainly aims to study a new nonmonotone line search slackness technique for unconstrained optimization problems and show that it possesses the global convergence without needing condition of convexity. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective for non-convex functions.