Convergence of random-search method for finding stationary points in the general nonlinear programming problem

zbMath0445.90060MaRDI QIDQ1145619

N. A. Bogomolov, V. G. Karmanov

Publication date: 1977

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

convergencenonconvex functionsuccessive approximationsstationary pointslocal minimum pointsrandom-search method

Mathematics Subject Classification ID

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

Related Items (1)

A nonrelaxation process in feasible direction methods

This page was built for publication: Convergence of random-search method for finding stationary points in the general nonlinear programming problem