Skip to main content

Filter-type Algorithms for Solving Systems of Algebraic Equations and Inequalities

  • Chapter
High Performance Algorithms and Software for Nonlinear Optimization

Part of the book series: Applied Optimization ((APOP,volume 82))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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 

  3. 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 

  4. Gauvin J. (1977), A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming, Mathematical Programming, 12, pp. 136–138.

    Article  MathSciNet  MATH  Google Scholar 

  5. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers B.V.

About this chapter

Cite this chapter

Fletcher, R., Leyffer, S. (2003). Filter-type Algorithms for Solving Systems of Algebraic Equations and Inequalities. In: Di Pillo, G., Murli, A. (eds) High Performance Algorithms and Software for Nonlinear Optimization. Applied Optimization, vol 82. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0241-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0241-4_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7956-0

  • Online ISBN: 978-1-4613-0241-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics