Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 165701, 10 pages
http://dx.doi.org/10.1155/2014/165701
Research Article

On the Application of Iterative Methods of Nondifferentiable Optimization to Some Problems of Approximation Theory

Department of Informatics, South-West University “Neofit Rilski”, 2700 Blagoevgrad, Bulgaria

Received 30 September 2014; Accepted 13 November 2014; Published 27 November 2014

Academic Editor: Peng-Yeng Yin

Copyright © 2014 Stefan M. Stefanov. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. D. Andersen, “An efficient Newton barrier method for minimizing a sum of Euclidean norms,” SIAM Journal on Optimization, vol. 6, no. 1, pp. 74–95, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. I. Barrodale and F. Roberts, “An improved algorithm for discrete l1 linear approximation,” SIAM Journal on Numerical Analysis, vol. 10, no. 5, pp. 839–848, 1973. View at Publisher · View at Google Scholar
  3. I. Barrodale and F. Roberts, “An efficient algorithm for discrete l1 linear approximation with constraints,” SIAM Journal on Numerical Analysis, vol. 15, no. 3, pp. 603–611, 1978. View at Publisher · View at Google Scholar
  4. R. H. Bartels, A. R. Conn, and J. W. Sinclair, “Minimization techniques for piecewise differentiable functions: the l1 solution to an overdetermined linear system,” SIAM Journal on Numerical Analysis, vol. 15, no. 2, pp. 224–241, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  5. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming. Theory and Algorithms, John Wiley & Sons, New York, NY, USA, 2nd edition, 1993.
  6. D. P. Bertsekas, “A new class of incremental gradient methods for least squares problems,” SIAM Journal on Optimization, vol. 7, no. 4, pp. 913–926, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. Å. Björck, Numerical Methods for Least Squares Problems, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa, USA, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  8. P. H. Calamai and A. R. Conn, “A stable algorithm for solving the multifacility location problem involving Euclidean distances,” Society for Industrial and Applied Mathematics, vol. 1, no. 4, pp. 512–526, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  9. P. H. Calamai and A. R. Conn, “A projected Newton method for lp norm location problems,” Mathematical Programming, vol. 38, no. 1, pp. 75–109, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J. A. Chatelon, D. W. Hearn, and T. J. Lowe, “A subgradient algorithm for certain minimax and minisum problems,” Mathematical Programming, vol. 15, no. 2, pp. 130–145, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. F. Clarke, Optimization and Nonsmooth Analysis, vol. 5 of Classics in Applied Mathematics, SIAM, Philadelphia, Pa, USA, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  12. T. F. Coleman and Y. Li, “A global and quadratically convergent method for linear l problems,” SIAM Journal on Numerical Analysis, vol. 29, no. 4, pp. 1166–1186, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. T. F. Coleman and Y. Li, “A globally and quadratically convergent affine scaling method for linear l1 problems,” Mathematical Programming, vol. 56, no. 1–3, pp. 189–222, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. V. F. Demyanov and L. V. Vasiliev, Nondifferentiable Optimization, Springer, Berlin, Germany, 1985.
  15. J. Fischer, “An algorithm for discrete linear lp approximation,” Numerische Mathematik, vol. 38, no. 1, pp. 129–139, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. L. Kantorovich and G. Akilov, Functional Analysis, Nauka, Moscow, Russia, 1983, (Russian).
  17. N. P. Korneichuk, Extremum Problems of Approximation Theory, Nauka, Moscow, Russia, 1976 (Russian).
  18. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, SIAM, Philadelphia, Pa, USA, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  19. Y. Li, “A globally convergent method for lp problems,” SIAM Journal on Optimization, vol. 3, no. 3, pp. 609–629, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  20. O. L. Mangasarian, Nonlinear Programming, vol. 10 of Classics in Applied Mathematics, SIAM, Philadelphia, PA, USA, 1994.
  21. G. Merle and H. Späth, “Computational experiences with discrete lp-approximation,” Computing, vol. 12, no. 4, pp. 315–321, 1974. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. M. L. Overton, “A quadratically convergent method for minimizing a sum of Euclidean norms,” Mathematical Programming, vol. 27, no. 1, pp. 34–63, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. E. Remez, Fundamentals of Numerical Methods for Chebyshev Approximation, Naukova Dumka, Kiev, Ukraine, 1969 (Russian).
  24. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1997. View at MathSciNet
  25. S. M. Stefanov, “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in Rn,” Journal of Applied Mathematics, vol. 2004, no. 5, pp. 409–431, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. S. M. Stefanov, “Well-posedness and primal-dual analysis of some convex separable optimization problems,” Advances in Operations Research, vol. 2013, Article ID 279030, 10 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  27. G. A. Watson, “On two methods for discrete lp approximation,” Computing, vol. 18, no. 3, pp. 263–266, 1977. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. J. M. Wolfe, “On the convergence of an algorithm for discrete lp approximation,” Numerische Mathematik, vol. 32, no. 4, pp. 439–459, 1979. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. G. Xue and Y. Ye, “An efficient algorithm for minimizing a sum of Euclidean norms with applications,” SIAM Journal on Optimization, vol. 7, no. 4, pp. 1017–1036, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. K. Yosida, Functional Analysis, Classics in Mathematics, Springer, Berlin, Germany, 1995. View at MathSciNet
  31. J. Yu, S. V. N. Vishwanathan, S. Günter, and N. N. Schraudolph, “A quasi-Newton approach to nonsmooth convex optimization problems in machine learning,” The Journal of Machine Learning Research, vol. 11, pp. 1145–1200, 2010. View at Google Scholar · View at MathSciNet · View at Scopus
  32. Y. I. Zhuravlev, Y. Laptin, A. Vinogradov, N. Zhurbenko, and A. Likhovid, “Non smooth optimization methods in the problems of constructing a linear classifier,” International Journal Information Models and Analyses, vol. 1, pp. 103–111, 2012. View at Google Scholar