Venets, V. I. Continuous algorithms for solving convex constrained minimization problems using projection onto the admissible set. (English. Russian original) Zbl 0593.90066 Autom. Remote Control 46, 846-850 (1985); translation from Avtom. Telemekh. 1985, No. 7, 73-78 (1985). Summary: Continuous algorithms for solving convex optimization problems are based on projections onto the admissible set. The algorithms are written as systems of differential equations with discontinuous (but one-valued) right hand sides. Solutions of such systems are shown to exist, their asymptotic properties are studied, and an example is given. MSC: 90C25 Convex programming 90C55 Methods of successive quadratic programming type 65K05 Numerical mathematical programming methods Keywords:Continuous algorithms; convex optimization; systems of differential equations; discontinuous (but one-valued) right hand sides; asymptotic properties PDF BibTeX XML Cite \textit{V. I. Venets}, Autom. Remote Control 46, 846--850 (1985; Zbl 0593.90066); translation from Avtom. Telemekh. 1985, No. 7, 73--78 (1985)