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

Accelerated Double Direction Method for Solving Unconstrained Optimization Problems

1Faculty of Science, University of Priština, Lole Ribara 29, 28000 Kosovska Mitrovica, Serbia
2Faculty of Science and Mathematics, University of Niš, Višegradska 33, 18000 Niš, Serbia

Received 9 December 2013; Revised 2 March 2014; Accepted 4 March 2014; Published 2 April 2014

Academic Editor: J. J. Judice

Copyright © 2014 Milena J. Petrović and Predrag S. Stanimirović. 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. N. I. Dbaruranović-Miličić and M. Gardašević-Filipović, “A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case,” Facta Universitatis. Series: Mathematics and Informatics, vol. 25, pp. 11–24, 2010. View at Google Scholar · View at MathSciNet
  2. N. I. Dbaruranović-Miličić, “A multi-step curve search algorithm in nonlinear optimization,” Yugoslav Journal of Operations Research, vol. 18, no. 1, pp. 47–52, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  3. D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, Springer Science, Business Media LLC, New York, NY, USA, 2008. View at MathSciNet
  4. W. Sun and Y. X. Yuan, Optimization Theory and Methods: Nonlinear Programming, vol. 1, Springer, New York, NY, USA, 2006. View at MathSciNet
  5. L. Armijo, “Minimization of functions having Lipschitz continuous first partial derivatives,” Pacific Journal of Mathematics, vol. 16, pp. 1–3, 1966. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. R. Fletcher and C. M. Reeves, “Function minimization by conjugate gradients,” The Computer Journal, vol. 7, pp. 149–154, 1964. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. C. Lemarechal, “A view of line-searches,” in Optimization and Optimal Control, A. Auslander, W. Oetti, and J. Stoer, Eds., vol. 30, pp. 59–78, Springer, Berlin, Germany, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. J. J. Moré and D. J. Thuente, On Line Search Algorithm with Guaranteed Sufficient Decrease, Mathematics and Computer Science Division Preprint MSC-P153-0590, Argone National Laboratory, Argone, Ill, USA, 1990.
  9. F. A. Potra and Y. Shi, “Efficient line search algorithm for unconstrained optimization,” Journal of Optimization Theory and Applications, vol. 85, no. 3, pp. 677–704, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  10. M. J. D. Powell, “Some global convergence properties of a variable metric algorithm for minimization without exact line searches,” in Nonlinear Programming, vol. 9 of SIAM-AMS Proceedings, pp. 53–72, American Mathematical Society, Philadelphia, Pa, USA, 1976. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. Z. J. Shi, “Convergence of line search methods for unconstrained optimization,” Applied Mathematics and Computation, vol. 157, no. 2, pp. 393–405, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. P. Wolfe, “Convergence conditions for ascent methods,” SIAM Review, vol. 11, pp. 226–235, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. P. S. Stanimirović and M. B. Miladinović, “Accelerated gradient descent methods with line search,” Numerical Algorithms, vol. 54, no. 4, pp. 503–520, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. N. Andrei, “An acceleration of gradient descent algorithm with backtracking for unconstrained optimization,” Numerical Algorithms, vol. 42, no. 1, pp. 63–73, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. N. Andrei, “An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization,” Optimization Methods & Software, vol. 27, no. 4-5, pp. 583–604, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equation in Several Variables, Academic Press, London, UK, 1970. View at MathSciNet
  17. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, USA, 1970. View at MathSciNet
  18. J. Barzilai and J. M. Borwein, “Two-point step size gradient methods,” IMA Journal of Numerical Analysis, vol. 8, no. 1, pp. 141–148, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. Y. H. Dai and L. Z. Liao, “R-linear convergence of the Barzilai and Borwein gradient method,” IMA Journal of Numerical Analysis, vol. 22, no. 1, pp. 1–10, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. B. Molina and M. Raydan, “Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations,” Numerical Algorithms, vol. 13, no. 1-2, pp. 45–60, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. N. Andrei, “An unconstrained optimization test functions collection,” Advanced Modeling and Optimization, vol. 10, pp. 147–161, 2008. View at Google Scholar