Author:
Kas Péter,Klafszky Emil,Mályusz Levente,Izbirak Gökhan
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference22 articles.
1. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming;Bregman;USSR Computational Mathematics and Mathematical Physics,1967
2. An iterative row-action method for interval convex programming;Censor;Journal of Optimization Theory and Applications,1981
3. Y. Censor, A.R. De Pierro, V. Elfving, G.T. Herman, A.N. Iusem, On iterative methods for linearly constrained entropy maximization, in: Numerical Analysis and Mathematic Modelling, vol. 21, Banach Center Publications, Polish Scientific Publisher, Warsaw, 1990, pp. 145–163
4. Optimization of Burg's entropy over linear constraints;Censor;Applied Numerical Mathematics,1991
5. Proximal minimization algorithm with D-functions;Censor;Journal of Optimization Theory and Applications,1992