Skip to main content
SpringerLink
Log in

A note on the convergence of barrier algorithms to second-order necessary points

  • Published:
Mathematical Programming Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Author information

Authors and Affiliations

  1. Rutherford Appleton Laboratory, Chilton, Oxfordshire OX11 0QX, England, e-mail: N.Gould@rl.ac.uk (Current reports available by anonymous ftp from the directory “pub/reports” on joyous-gard.cc.rl.ac.uk), , , , , , UK

    Nicholas I. M. Gould

  2. Department of Mathematics, Facultés Universitaires ND de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, e-mail: pht@math.fundp.ac.be (Current reports available by anonymous ftp from the directory “pub/reports” on thales.math.fundp.ac.be), , , , , , BE

    Philippe L. Toint

Authors
  1. Nicholas I. M. Gould
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe L. Toint
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 21, 1997 / Revised version received May 20, 1998 Published online November 24, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gould, N., Toint, P. A note on the convergence of barrier algorithms to second-order necessary points. Math. Program. 85, 433–438 (1999). https://doi.org/10.1007/s101070050066

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050066

Search

Navigation