The convergence rate of the penalty function method-Reference-Cited by-同舟云学术

The convergence rate of the penalty function method

Published:1971-01 Issue:1 Volume:11 Page:1-12
ISSN:0041-5553
Container-title:USSR Computational Mathematics and Mathematical Physics
language:en
Short-container-title:USSR Computational Mathematics and Mathematical Physics

Author:

Polyak B.T.

Publisher

Elsevier BV

Subject

General Engineering

Reference6 articles.

1. Nonlinear programming: sequential unconstrained minimization techniques;Fiacco,1968

2. Constrained minimization methods;Levitin;Zh. vȳchisl. Mat. mat. Fiz.,1966

3. The method of “penalties” in convex programming;Eremin;Dokl. Akad. Nauk SSSR,1967

4. Elements of functional analysis;Lyusternik,1965

5. Iteration methods using Lagrange multipliers, for the solution of extremal problems with constraints of the equality type;Polyak;Zh. vȳchisl. Mat. mat. Fiz.,1970

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

1. One-Shot Learning of Surrogates in PDE-Constrained Optimization under Uncertainty;SIAM/ASA Journal on Uncertainty Quantification;2024-06-12

2. New-generation maximum entropy method: a Lagrangian-based algorithm for dynamic reconstruction of interferometric data;Monthly Notices of the Royal Astronomical Society;2024-01-22

3. Accelerated Algorithms for Constrained Convex Optimization;Accelerated Optimization for Machine Learning;2020

4. A CONSTRUCTIVE GLOBAL CONVERGENCE OF THE MIXED BARRIER-PENALTY METHOD FOR MATHEMATICAL OPTIMIZATION PROBLEMS;Pesquisa Operacional;2020

5. A new forced LMS-based adaptive algorithm utilizing the principle of potential energy;Journal of the Franklin Institute;2000-08