A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization

A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization

0.00 Avg rating0 Votes
Article ID: iaor2014150
Volume: 57
Issue: 1
Start Page Number: 27
End Page Number: 43
Publication Date: Jan 2014
Journal: Computational Optimization and Applications
Authors:
Keywords: programming: convex
Abstract:

A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear optimization. The nonmonotone techniques applied in this algorithm are based on the estimate sequence proposed by Nesterov (2004) for convex optimization. Under proper assumptions, global convergence of this algorithm is established for minimizing general nonlinear objective function with Lipschitz continuous derivatives. For convex objective function, this algorithm maintains the optimal convergence rate of convex optimization. In numerical experiments, this algorithm is specified by employing safe‐guarded nonlinear conjugate gradient search directions. Numerical results show the nonmonotone algorithm performs significantly better than the corresponding monotone algorithm for solving the unconstrained optimization problems in the CUTEr (Bongartz et al., 1995) library.

Reviews

Required fields are marked *. Your email address will not be published.