An iterative row-action method for interval convex programming
- 1 July 1981
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 34 (3) , 321-353
- https://doi.org/10.1007/bf00934676
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- Relaxation methods for image reconstructionCommunications of the ACM, 1978
- A family of iterative quadratic optimization algorithms for pairs of inequalities, with application in diagnostic radiologyPublished by Springer Nature ,1978
- Iterative reconstruction algorithmsComputers in Biology and Medicine, 1976
- A suboptimization method for interval linear programming: a new method for linear programmingLinear Algebra and its Applications, 1970
- An interval programming algorithm for discrete linear L1 approximation problemsJournal of Approximation Theory, 1969
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theoryJournal of Mathematical Analysis and Applications, 1969
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- A convex programming procedureNaval Research Logistics Quarterly, 1959
- A quadratic programming procedureNaval Research Logistics Quarterly, 1957