An interior points algorithm for the convex feasibility problem
- 31 December 1983
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 4 (4) , 479-489
- https://doi.org/10.1016/0196-8858(83)90019-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Cyclic subgradient projectionsMathematical Programming, 1982
- Extensions of Hildreth’s Row-Action Method for Quadratic ProgrammingSIAM Journal on Control and Optimization, 1980
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraintsJournal of Approximation Theory, 1975
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954