A surperlinearly convergent algorithm for constrained optimization problems-Reference-Cited by-同舟云学术

A surperlinearly convergent algorithm for constrained optimization problems

Published:1982 Issue: Volume: Page:45-61
ISSN:0303-3929
Container-title:Mathematical Programming Studies
language:
Short-container-title:

Author:

Mayne D. Q.,Polak E.

Publisher

Springer Berlin Heidelberg

Link

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

Reference22 articles.

1. E. S. Levitin and B. T. Polyak, “Constrained minimization methods”, USSR Computational Mathematics and Mathematical Physics 6 (1966) 1–15.

2. R. B. Wilson, “A simplicial algorithm for concave programming”, Ph. D. Dissertation, Graduate School of Business Administration, Harvard University (Cambridge, MA, 1963).

3. E. M. L. Beale, “Numerical methods”, in: J. Abadie, ed., Nonlinear programming (North-Holland, Amsterdam, 1967) pp. 132–205.

4. S. M. Robinson, “A quadratically-convergent algorithm for general nonlinear programming problems”, Mathematical Programming 3 (1972) 145–156.

5. S. P. Han, “A globally convergent method for nonlinear programming”, Journal of Optimization Theory and Applications 22 (1977), 297–309.

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

1. Efficient aeroelastic wing optimization through a compact aerofoil decomposition approach;Structural and Multidisciplinary Optimization;2022-02-08

2. A line search penalty-free SQP method for equality-constrained optimization without Maratos effect;IMA Journal of Numerical Analysis;2022-01-10

3. Sequential Quadratic Programming;Modern Numerical Nonlinear Optimization;2022

4. Objectives and Constraints for Transonic Wing Optimization;AIAA Scitech 2020 Forum;2020-01-05

5. Efficient Modal Design Variables for Optimization of Aero-Elastic Wing;AIAA Scitech 2020 Forum;2020-01-05