4.1 Article

An SQP approach with line search for a system of nonlinear equations

Journal

MATHEMATICAL AND COMPUTER MODELLING
Volume 43, Issue 3-4, Pages 368-373

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2005.10.007

Keywords

optimization; nonlinear programming; SQP; the system of nonlinear equations

Ask authors/readers for more resources

In this paper, a line search sequential quadratic programming (SQP) approach to a system of nonlinear equations (SNE) is taken. In this method, the system of nonlinear equations is transformed into a constrained nonlinear programming problem at each step, which is then solved using SQP algorithms with a line search strategy. Furthermore, at each step, some equations, which are satisfied at the current point, are treated as constraints and the others act as objective functions. In essence, constrained optimization strategies are utilized to cope with the system of nonlinear equations. (c) 2006 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.1
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available