IDEAS home Printed from
   My bibliography  Save this article

Convergence Conditions for Nonlinear Programming Algorithms


  • Willard I. Zangwill

    (The University of California, Berkeley)


Conditions which are necessary and sufficient for convergence of a nonlinear programming algorithm are stated. It is also shown that the convergence conditions can be easily applied to most programming algorithms. As examples, algorithms by Arrow, Hurwicz and Uzawa; Cauchy; Frank and Wolfe; and Newton-Raphson are proven to converge by direct application of the convergence conditions. Also the Topkis-Veinott convergence conditions for feasible direction algorithms are shown to be a special case of the conditions stated in this paper.

Suggested Citation

  • Willard I. Zangwill, 1969. "Convergence Conditions for Nonlinear Programming Algorithms," Management Science, INFORMS, vol. 16(1), pages 1-13, September.
  • Handle: RePEc:inm:ormnsc:v:16:y:1969:i:1:p:1-13

    Download full text from publisher

    File URL:
    Download Restriction: no


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Raoul Pietersz & Patrick Groenen, 2004. "Rank reduction of correlation matrices by majorization," Quantitative Finance, Taylor & Francis Journals, vol. 4(6), pages 649-662.
    2. Jan Leeuw & Forrest Young & Yoshio Takane, 1976. "Additive structure in qualitative data: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 41(4), pages 471-503, December.
    3. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.
    4. Ferrari, Paolo, 2005. "Road pricing and users' surplus," Transport Policy, Elsevier, vol. 12(6), pages 477-487, November.
    5. repec:spr:compst:v:66:y:2007:i:3:p:373-407 is not listed on IDEAS

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1969:i:1:p:1-13. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.