| Article ID: | iaor19911367 |
| Country: | Switzerland |
| Volume: | 24 |
| Start Page Number: | 189 |
| End Page Number: | 195 |
| Publication Date: | May 1990 |
| Journal: | Annals of Operations Research |
| Authors: | Han Jiye, Hu Xiaodong, Liu Jin. |
In this paper, the authors introduce a general class of feasible point algorithms for solving nonlinear programming problems with linear constraints under degeneracy. Many well-known algorithms are its special cases. Also, many new algorithms can be derived from this general class. Under rather simple conditions, the authors prove the global convergence property for this class of algorithms.