Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment

DOI10.1007/BF01072022zbMath0527.90083MaRDI QIDQ3042890

V. M. Panin

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergenceconstrained optimizationdamped Newton's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• Unnamed Item
• On the global stabilization of locally convergent algorithms
• A globally convergent method for nonlinear programming
• A New Class of Augmented Lagrangians in Nonlinear Programming
• Exact penalty functions in nonlinear programming
• Some methods of solving convex programming problems
• A first order, exact penalty function algorithm for equality constrained optimization problems
• A New Approach to Lagrange Multipliers

This page was built for publication: Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment