We analyze the classical penalty algorithm for nonlinear programming in Hilbert spaces and obtain global convergence results, as well as asymptotic superlinear convergence order. These convergence results generalize s...We analyze the classical penalty algorithm for nonlinear programming in Hilbert spaces and obtain global convergence results, as well as asymptotic superlinear convergence order. These convergence results generalize similar results obtained for finite-dimensional problems. Moreover, the nature of the algorithms allows us to solve the unconstrained subproblems in finite-dimensional spaces.展开更多
文摘We analyze the classical penalty algorithm for nonlinear programming in Hilbert spaces and obtain global convergence results, as well as asymptotic superlinear convergence order. These convergence results generalize similar results obtained for finite-dimensional problems. Moreover, the nature of the algorithms allows us to solve the unconstrained subproblems in finite-dimensional spaces.