Filter-type Algorithms for Solving Systems of Algebraic Equations and Inequalities
The problem of solving a nonlinear system is transformed into a bi-objective nonlinear programming problem, which is then solved by a prototypical trust region filter SQP algorithm. The definition of the bi-objective problems is changed adaptively as the algorithm proceeds. The method permits the use of second order information and hence enables rapid local convergence to occur, which is particularly important for solving locally infeasible problems. A proof of global convergence is presented under mild assumptions.
Keywordsnonlinear systems nonlinear programming global convergence filter multiobjective optimization
Unable to display preview. Download preview PDF.
- Chin C.M. and Fletcher R. (2001), On the Global Convergence of an SLP-filter algorithm that takes EQP steps, Dundee University, Dept. of Mathematics, Report NA/199.Google Scholar
- Fletcher R. and Leyffer S. (1997), Nonlinear Programming Without a Penalty Function, Dundee University, Dept. of Mathematics, Report NA/171, to appear in Mathematical Programming.Google Scholar
- Fletcher R., Leyffer S. and Toint Ph.L. (2000), On the Global Convergence of a Filter-SQP Algorithm, Dundee University, Dept. of Mathematics, Report NA/197, to appear in SIAM Journal of Optimization.Google Scholar
- Powell M.J.D. (1970), A hybrid method for nonlinear equations, in Numerical Methods for Nonlinear Algebraic Equations, (Ed. P. Rabinowitz), Gordon and Breach, London.Google Scholar