Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming

DOI10.1007/BF01078907zbMath0666.90074MaRDI QIDQ3818811

Vladimir I. Norkin

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

surveycomplete metric spaceiteration algorithmsconvergence resultssequential analysis of variantsnonrelaxation algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)

Related Items (1)

Iterative processes: A survey of convergence theory using Lyapunov second method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some properties of the generalized gradient method
• A method of minimizing an undifferentiable function with generalized-gradient averaging
• Stability of stochastic programming methods to stochastic quasigradient computing errors
• Conditions for the convergence of iterative processes on the real axis
• Convergence Conditions for Nonlinear Programming Algorithms

This page was built for publication: Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming