On the rate of convergence of sequential unconstrained minimization techniques

DOI10.1051/m2an/1983170302671zbMath0526.65043OpenAlexW2587755428MaRDI QIDQ3040426

Christian Grossmann, Alexander Kaplan

Publication date: 1983

Published in: RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL: http://www.esaim-m2an.org/10.1051/m2an/1983170302671/pdf

zbMATH Keywords

rate of convergenceSUMTpenalty methodsconvergence boundscomparison problemsmethods of centersparameter selection rulesquasi- barrier methodregularized techniquessequential unconstrained minimization techniques

Mathematics Subject Classification ID

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

Related Items (2)

Dualität und Strafmethoden bei elliptischen Differentialgleichungen ⋮ On the solution of discretized obstacle problems by an adapted penalty method

This page was built for publication: On the rate of convergence of sequential unconstrained minimization techniques