A Nonmonotone Trust Region Algorithm for Nonlinear Optimization Subject to General Constraints

Author(s)

Abstract

In this paper we present a nonmonotone trust region algorithm for general nonlinear constrained optimization problems. The main idea of this paper is to combine Yuan's technique [1] with a nonmonotone method similar to Ke and Han [2]. This new algorithm may not only keep the robust properties of the algorithm given by Yuan, but also have some advantages led by the nonmonotone technique. Under very mild conditions, global convergence for the algorithm is given. Numerical experiments demonstrate tre efficiency of the algorithm.

About this article

Abstract View

  • 32537

Pdf View

  • 3669

How to Cite

A Nonmonotone Trust Region Algorithm for Nonlinear Optimization Subject to General Constraints. (2003). Journal of Computational Mathematics, 21(2), 237-246. https://global-sci.com/index.php/JCM/article/view/11550