Skip to main content

Quasi — Newton Interior Points Algorithms for Nonlinear Constrained Optimization

  • Conference paper
Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung

Part of the book series: Operations Research Proceedings ((ORP,volume 1990))

  • 170 Accesses

Abstract

We present a quasi-Newton method for interior points algorithms in nonlinear constrained optimization. It is based on a general approach consisting on the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker Optimality Conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points.

This approach is very strong and efficient, and at each iteration it only requires the solution of two linear systems with the same matrix, instead of Quadratic Programming Subproblems. We discuss about theoretical aspects of the algorithm and its computer implementation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

Literature

  1. Herskovits, J. A Two-Stage Feasible Directions Algorithm for Nonlinear Constrained Optimization. Mathematical Programming, Vol. 36, pp. 19–38 (1986).

    Article  Google Scholar 

  2. Herskovits, J. A Two-Stage Feasible Directions Algorithm including Variable Metric Techniques for Nonlinear Optimization. Research Report n° 118, INRIA, BP 105, 78153 Le Chesnay CEDEX, France, (1982).

    Google Scholar 

  3. Panier, E.R.; Tits A.L. and Herskovits J. A QP — Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization. SIAM Journal of Control and Optimization, Vol 26, pp 788–810 (1988).

    Article  Google Scholar 

  4. Herskovits, J.; Coelho, C.A.B. An Interior Points Algorithm for Structural Optimization Problems. In Computer Aided Design of Structures: Recent Advances. Ed. C.A. Brebbia and S. Hernandez, Springer — Verlag (1989).

    Google Scholar 

  5. Mayne D.Q.; Polak E. A Superlinearly Convergent Algorithm for Constrained Optimization Problems. Math. Programming Study, 16 (1982), 45–61.

    Article  Google Scholar 

  6. Powell, M.J.D. The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Calculations. Numerical Methods for Constrained Optimization, edited by P.E. Gill and W. Murray, Academic Press, London (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Herskovits, J., Asquier, J. (1992). Quasi — Newton Interior Points Algorithms for Nonlinear Constrained Optimization. In: Bühler, W., Feichtinger, G., Hartl, R.F., Radermacher, F.J., Stähly, P. (eds) Papers of the 19th Annual Meeting / Vorträge der 19. Jahrestagung. Operations Research Proceedings, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77254-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77254-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55081-5

  • Online ISBN: 978-3-642-77254-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics