Filter-sequence of quadratic programming method with nonlinear complementarity problem function
2008
A mechanism for proving global convergence in filter-SQP (sequence of quadratic programming) method with the nonlinear complementarity problem (NCP) function is described for constrained nonlinear optimization problem. We introduce an NCP function into the filter and construct a new SQP-filter algorithm. Such methods are characterized by their use of the dominance concept of multi-objective optimization, instead of a penalty parameter whose adjustment can be problematic. We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
0
Citations
NaN
KQI