A class of programming problems whose objective function contains a norm
暂无分享，去创建一个
[1] Alston S. Householder,et al. The Theory of Matrices in Numerical Analysis , 1964 .
[2] E. Cheney. Introduction to approximation theory , 1966 .
[3] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[4] V. P. Sreedharan,et al. Solutions of overdetermined linear equations which minimize error in an abstract norm , 1969 .
[5] V. Sreedharan. Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm , 1971 .
[6] H. Anton,et al. On an algorithm for best approximate solutions to Av = b in normed linear spaces , 1973 .
[7] Bertram Mond. A class of nondifferentiable mathematical programming problems , 1974 .
[8] W Oettli. Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints☆ , 1975 .
[9] M. S. Borowsky. Algorithms for solving the dual problem for Av = b with varying norms , 1976 .
[10] A programming problem with an Lp norm in the objective function , 1976, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.