Abstract

In this paper, we present a flexible nonmonotone filter method for solving nonlinear constrained optimization problems which are common models in industry. This new method has more flexibility for the acceptance of the trial step compared to the traditional filter methods, and requires less computational costs compared with the monotone-type methods. Moreover, we use a self-adaptive parameter to adjust the acceptance criteria, so that Maratos effect can be avoided a certain degree. Under reasonable assumptions, the proposed algorithm is globally convergent. Numerical tests are presented that confirm the efficiency of the approach.

Highlights

  • IntroductionWe consider the following inequality constrained nonlinear optimization problem (P) min f (x) s.t. ci(x) ≤ , i ∈ I = { , ,

  • We consider the following inequality constrained nonlinear optimization problem (P) min f (x) s.t. ci(x) ≤, i ∈ I = {, . . . , m}, where x ∈ Rn, the functions f : Rn → R and ci (i ∈ I) : Rn → R are all twice continuously differentiable

  • Motivated by the idea and methods above, we proposed a class of nonmonotone filter trust region methods with self-adaptive parameter for solving problem (P)

Read more

Summary

Introduction

We consider the following inequality constrained nonlinear optimization problem (P) min f (x) s.t. ci(x) ≤ , i ∈ I = { , , . There are various methods for solving the inequality constrained nonlinear optimization problem (P). Sequential quadratic programming methods, trust region approaches [ ], penalty methods and interior point methods [ ]. In these works, a penalty or Lagrange function is always used to test the acceptability of the iterates. In , Fletcher and Leyffer [ ] proposed a class of filter methods, which does not require any penalty parameter and has promising numerical results. Fletcher et al [ ] proved the global convergence of the filter-SQP method, Ulbrich and Ulbrich [ ] showed its superlin-

Objectives
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.