A class of programming problems whose objective function contains a norm
- 31 August 1978
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 23 (4) , 401-411
- https://doi.org/10.1016/0021-9045(78)90091-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algorithms for solving the dual problem for Av = b with varying normsJournal of Approximation Theory, 1976
- A programming problem with anLpnorm in the objective functionThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1976
- 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
- A class of nondifferentiable mathematical programming problemsJournal of Mathematical Analysis and Applications, 1974
- On an algorithm for best approximate solutions to Av = b in normed linear spacesJournal of Approximation Theory, 1973
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, 1971
- Solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, 1969