Variable penalty methods for constrained minimization

DOI10.1016/0898-1221(80)90062-0zbMath0451.65045OpenAlexW2139400578MaRDI QIDQ1148104

S. H. Smith

Publication date: 1980

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(80)90062-0

zbMATH Keywords

convergencetest problemsconstrained minimizationpenalty methodsmodified Newton's algorithm

Mathematics Subject Classification ID

Related Items (2)

An improved variable penalty algorithm for automated structural design ⋮ A hybrid variable penalty method for nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An accelerated multiplier method for nonlinear programming
• A modified Newton method for minimization
• Penalty function theory for general convex programming problems
• A gradient projection-multiplier method for nonlinear programming
• An improved penalty function method for solving constrained parameter optimization problems
• Penalty methods for mathematical programming in \(E^n\) with general constraint sets
• On penalty function methods for nonlinear programming problems
• A cubic extended interior penalty function for structural optimization
• On implementation of the extended interior penalty function
• Applications of a Quadratic Extended Interior for Structural Optimization Penalty Function
• An Existence Theorem for Penalty Function Theory
• A Rapidly Convergent Descent Method for Minimization
• A comparison of modified Newton methods for unconstrained optimisation
• A Class of Exponential Penalty Functions
• Quasi-Newton Methods for Unconstrained Optimization

This page was built for publication: Variable penalty methods for constrained minimization