A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps

DOI10.1007/BFb0120853zbMath0417.90077MaRDI QIDQ3208449

No author found.

Publication date: 1979

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

set-valued mapsnonlinear programmingoptimization algorithmsconvergence conditionscomparative study

Mathematics Subject Classification ID

Nonlinear programming (90C30) Set-valued maps in general topology (54C60) Rate of convergence, degree of approximation (41A25)

Related Items (11)

On the monotone convergence of general Newton-like methods ⋮ Comparison theorems for algorithmic models ⋮ Perturbed steepest-descent technique in multiextremal problems ⋮ Sufficient convergence conditions for iteration schemes modelled by point-to-set mappings ⋮ New convergence theorems for a class of feasible directions algorithms ⋮ On the convergence of nonstationary algorithms modeled by point-to-set maps ⋮ On the convergence of a class of nonlinear approximation methods ⋮ On the monotone convergence of algorithmic models ⋮ Convergence of general iteration schemes ⋮ An overall study of convergence conditions for algorithms in nonlinear programming ⋮ Some notions of nonstationary multistep iteration processes

This page was built for publication: A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps