首页   按字顺浏览 期刊浏览 卷期浏览 Newton-type methods for nonlinearly constrained programming problems-algorithms and the...
Newton-type methods for nonlinearly constrained programming problems-algorithms and theory

 

作者: H. Kleinmichel,   K. Schönefeld,  

 

期刊: Optimization  （Taylor Available online 1988）
卷期: Volume 19, issue 3  

页码: 397-412

 

ISSN:0233-1934

 

年代: 1988

 

DOI:10.1080/02331938808843355

 

出版商: Akademic-Verlag

 

关键词: Nonlinear programming algorithms;locally superlinearly convergent algorithms;Primary:90 C 30;Primary:65 K 05

 

数据来源: Taylor

 

摘要:

For optimization problems including inequality constraints the well-known locally and superlinealy convergent methods of Levitin/Polyak, of Robinson and of Wilson (Recursive Quadratic Programming) lead to inequality constrained nonlinear subproblems.

 

点击下载:  PDF (677KB)



返 回