Finite penalty methods with a linear approximation of the constraints. I

DOI10.1007/BF01069177zbMath0559.90076MaRDI QIDQ5184683

V. M. Panin

Publication date: 1984

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

optimality conditionsdifferentiable functionsfinite penalty methodslinear approximation of the constraintsnonlocally convergent algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (3)

Linear convergence of a method for solving variational inequalities ⋮ Nonlocal quasi-Newton type method for solving convex variational inequalities ⋮ The linearization method: Principal concepts and perspective directions

Cites Work

• Unnamed Item
• A globally convergent method for nonlinear programming
• A New Approach to Lagrange Multipliers
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: Finite penalty methods with a linear approximation of the constraints. I