An improved penalty function method for solving constrained parameter optimization problems

DOI10.1007/BF00935620zbMath0281.90065MaRDI QIDQ1843378

John 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)

Related Items

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

Cites Work

• A Rapidly Convergent Descent Method for Minimization
• Variance algorithm for minimization
• Approximate finite-thrust trajectory optimization.
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• The Convergence of Single-Rank Quasi-Newton Methods
• Approximate optimal control of distributed parameter systems.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item