A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...
We consider an elliptic Kolmogorov equation λu − Ku = f in a separable Hilbert space H. The Kolmogorov operator K is associated to an infinite dimensional convex gradient system: dX = (AX − DU(X)) dt ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback