On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods-Reference-Cited by-同舟云学术

On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods

Published:1986-06 Issue:2 Volume:37 Page:151-169
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Ishutkin V. S.,Schönefeld K.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02253188.pdf

Reference18 articles.

1. Best, M. J., Bräuninger, J., Ritter, K., Robinson, S. M.: A globally and quadratically convergent algorithm for general nonlinear programming problems. Computing26, 141–153 (1981).

2. Freytag, J., Großmann, C.: Eine Erweiterung der Verfahren der zulässigen Richtungen. Math. Operationsforschung und Statistik, Series Optimization9, 569–577 (1978).

3. Gill, P. E., Murray, W.: Numerical methods for constrained optimization. London-New York-San Francisco: Academic Press 1974.

4. Großmann, C., Kleinmichel, H.: Verfahren der nichtlinearen Optimierung. Leipzig: BSB B. G. Teubner Verlagsgesellschaft 1976.

5. Ishutkin, V. S., Kokurin, M. Ju.: On the rate of convergence of the projection method for convex programming problems with step size determination by bisection (in Russian). Matematika (Kasan)6, 53–55 (1983).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On a class of hybrid methods for smooth constrained optimization;Journal of Optimization Theory and Applications;1992-06

2. A class of nonmonotone stabilization methods in unconstrained optimization;Numerische Mathematik;1991-12

3. Reduced-direction methods with feasible points in nonlinear programming;USSR Computational Mathematics and Mathematical Physics;1990-01

4. Reduced-direction methods for the non-linear programming problem;USSR Computational Mathematics and Mathematical Physics;1988-01

5. Newton-type methods for nonlinearly constrained programming problems-algorithms and theory;Optimization;1988-01