Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. D.H. Andersson and M.R. Osborne, Discrete nonlinear approximation in polyhedral norms: a Levenberg-like algorithm, Numer. Math. 28 (1977) 157–170.
2. C. Charalambous and A.R. Conn, An efficient method to solve the minimax problem directly, SIAM J. Numer. Anal. 15 (1978) 162–187.
3. A.R. Conn, An efficient second order method to solve the (constrained) minimax problem, Report CCRR 79-5, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Canada (1979).
4. A.R. Conn, N.I.M. Gould and Ph.L. Toint,LANCELOT: A Fortran Package for Large Scale Nonlinear Optimization (Release A) (Springer, 1992).
5. A.R. Conn and Yuying Li, An efficient algorithm for nonlinear minimax problems, University of Waterloo report CS-88-41 (1989).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Algebraic Approach to Lens Distortion by Line Rectification;Journal of Mathematical Imaging and Vision;2009-05-02
2. Approximation in normed linear spaces;Numerical Analysis: Historical Developments in the 20th Century;2001
3. Approximation in normed linear spaces;Journal of Computational and Applied Mathematics;2000-09
4. Choice of norms for data fitting and function approximation;Acta Numerica;1998-01