Generalized Penalty Methods in Topological Spaces

Abstract : The sequential unconstrained minimization technique solves a constrained minimization problem by minimizing a sequence of auxiliary functions. Assuming the existence of a sequence of points related to the minimizing sequence, the usual convergence results are shown to hold in a general topological space. This generalizes certain results obtained previously at RAC and elsewhere. (Author)

[1]  G. McCormick,et al.  PROGRAMMING UNDER NONLINEAR CONSTRAINTS BY UNCONSTRAINED MINIMIZATION: A PRIMAL-DUAL METHOD, , 1963 .

[2]  George Leitmann,et al.  Optimization techniques, with applications to aerospace systems , 1964 .

[3]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[4]  L. Lasdon,et al.  An interior penalty method for inequality constrained optimal control problems , 1967, IEEE Transactions on Automatic Control.

[5]  A NOTE ON THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR NON-LINEAR PROGRAMMING * , 1965 .

[6]  Anthony V. Fiacco,et al.  Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming , 1964 .

[7]  Charles W. Carroll.  The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems , 1961 .

[8]  W. Zangwill.  Non-Linear Programming Via Penalty Functions , 1967 .

[9]  A new method for solving conditioned maxima problems , 1965 .

[10]  Anthony V. Fiacco,et al.  The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .

[11]  Terence Butler,et al.  On a Method of Courant for Minimizing Functionals , 1962 .

[12]  D. Russell.  Penalty Functions and Bounded Phase Coordinate Control , 1964 .

[13]  G. McCormick,et al.  The Slacked Unconstrained Minimization Technique for Convex Programming , 1967 .

[14]  R. Courant.  Variational methods for the solution of problems of equilibrium and vibrations , 1943 .