An improved penalty function method for solving constrained parameter optimization problems

DOI10.1007/BF00935620MaRDI QIDQ1843378zbMATH OpenFDO

Authors J. T. Betts

Publication date 1975

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• scientific article; zbMATH DE number 3340762 (Why is no real title available?)
• scientific article; zbMATH DE number 3356498 (Why is no real title available?)
• scientific article; zbMATH DE number 3381415 (Why is no real title available?)
• A Rapidly Convergent Descent Method for Minimization
• Approximate finite-thrust trajectory optimization.
• Approximate optimal control of distributed parameter systems.
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• The Convergence of Single-Rank Quasi-Newton Methods
• Variance algorithm for minimization

Cited in

(7)

• A gradient projection-multiplier method for nonlinear programming
• An accelerated multiplier method for nonlinear programming
• A class of generalized variable penalty methods for nonlinear programming
• Optimal simultaneous maximuma posterioriestimation of states, noise statistics and parameters I. Algorithm
• Solving the nonlinear least square problem: Application of a general method
• A hybrid variable penalty method for nonlinear programming
• Variable penalty methods for constrained minimization

This page was built for publication: An improved penalty function method for solving constrained parameter optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843378)