Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

ON A CONVEX PROGRAMMING PROBLEM

Annotation

A problem of a certain type convex functional minimization under linear constraints in a space of Lebesgue integrable functions is considered. Necessary and sufficient optimality conditions for this problem are obtained. As an application, the principle of maximum entropy is derived from the main result.

Keywords

convex programming; necessary minimum conditions; principle of maximum entropy

Full-text in one file

Download

UDC

517

Pages

1150-1153

References

1. Arutyunov A.V. Lektsii po vypuklomu i mnogoznachnomu analizu. M.: Fizmatlit, 2014. 2. Magaril-Il'yaev G.G., Tikhomirov V.M. Vypuklyy analiz i ego prilozheniya. Izd. 2-e, ispravl. M.: Editorial URSS, 2003. 3. Vedenyapin V.V., Adzhiev S.Z. Entropiya po Bol'tsmanu i Puankare // Uspekhi mat. nauk. 2014. T. 69. № 6 (420). S. 45–80.

Received

2015-05-26

Section of issue

Scientific articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.