Convergence Conditions for Nonlinear Programming Algorithms
AbstractConditions 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 16 (1969)
Issue (Month): 1 (September)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Pietersz, R. & Groenen, P.J.F., 2004.
"Rank reduction of correlation matrices by majorization,"
Econometric Institute Research Papers
EI 2004-11, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Raoul Pietersz & Patrick Groenen, 2004. "Rank reduction of correlation matrices by majorization," Quantitative Finance, Taylor & Francis Journals, vol. 4(6), pages 649-662.
- Raoul Pietersz & Patrick J. F. Groenen, 2005. "Rank Reduction of Correlation Matrices by Majorization," Finance 0502006, EconWPA.
- Jan Leeuw & Forrest Young & Yoshio Takane, 1976. "Additive structure in qualitative data: An alternating least squares method with optimal scaling features," Psychometrika, Springer, vol. 41(4), pages 471-503, December.
- Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Computational Statistics, Springer, vol. 66(3), pages 373-407, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.