On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods

DOI10.1007/BF02253188zbMath0587.65045OpenAlexW130244386MaRDI QIDQ1072349

V. S. Ishutkin, Klaus Schönefeld

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253188

zbMATH Keywords

global convergencehybrid algorithmssuperlinear convergencepenalty methodfeasible direction methodKuhn-Tucker pointslocal Wilson-type method

Mathematics Subject Classification ID

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

Related Items (4)

Newton-type methods for nonlinearly constrained programming problems-algorithms and theory ⋮ A class on nonmonotone stabilization methods in unconstrained optimization ⋮ On a class fo hybrid methods for smooth constrained optimization ⋮ A note on a globalization of Wilson-type optimization methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A robust secant method for optimization problems with inequality constraints
• Nonlinear programming codes. Information, tests, performance
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• On the global and superlinear convergence of a discretized version of Wilson's method
• Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme
• A hybrid method fur linearly constrained optimisation problems
• Über Mehrschrittverfahren der nichtlinearen Optimierung
• Newton-type methods for unconstrained and linearly constrained optimization
• Eine Erweiterung der verfahren der zulässigen richtungen

This page was built for publication: On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods