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

DOI10.1007/BFB0120853zbMATH Open0417.90077MaRDI QIDQ3208449FDOQ3208449

Authors:

Publication date: 1979

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

zbMATH Keywords

nonlinear programmingset-valued mapsoptimization algorithmsconvergence conditionscomparative study

Mathematics Subject Classification ID

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

Cited In (11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208449)