RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 1985 Issue 7, Pages 73–78 (Mi at7053)

Deterministic Systems

Continuous algorithms for solving convex problems of conditional minimization, which use the operation of projection on the feasible set

V. I. Venets

Moscow

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.

UDC: 62-505, 519.8


Received: 28.04.1984


 English version:
Automation and Remote Control, 1985, 46, 846–850

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026