Abstract:
The proposed continuous algorithms for solution of convex optimization problems perform mapping on the feasible set. The algorithms are represented as systems of differential equations with a discontinuous (but single-valued) right-hand side. Solutions of such systems are proved to exist, their asymptotic properties studied, and an example given.