

Steklov Mathematical Institute Seminar
April 17, 2003, Moscow, Steklov Mathematical Institute of RAS, Conference Hall (8 Gubkina)






Extremal problems with separable graphs
A. V. Kryazhimskiy^{}, Yu. S. Osipov^{} 
Number of views: 
This page:  173 

Abstract:
The property of separability of a graph was introduced for extremal problems with equality constraints; this generalizes the convexity property of the problem. The equality of the optimal values of the original problem and its dual problem appears as an analytic equivalent of this property; here the dual problem can be interpreted as a convex optimization problem on a space of generalized (randomized) arguments. The solution method based on N. N. Krasovskii's extremal shift principle can be justified on the basis of these relations for extremal problems with separable graphs; the method was illustrated by an example of optimal control problems.

