Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Convergence and numerical results for a parallel asynchronous quasi-Newton method

  • 66 Accesses

  • 4 Citations


During the execution of a parallel asynchronous iterative algorithm, each task does not wait for predetermined data to become available. On the contrary, they can be viewed as local and independent iterative algorithms, which perform their own iterative scheme on the data currently available.

On the basis of this computational model, a parallel asynchronous version of the quasi-Newton method for solving unconstrained optimization problems is proposed. The algorithm is based on four tasks concurrently executing and interacting in an asynchronous way.

Convergence conditions are established and numerical results are presented which prove the effectiveness of the proposed parallel asynchronous approach.

This is a preview of subscription content, log in to check access.


  1. 1.

    Miller, D. L., andPekny, J. F.,The Role of Performance Metrics for Parallel Mathematical Programming Algorithms, ORSA Journal on Computing, Vol. 5, pp. 26–28, 1993.

  2. 2.

    Fischer, H., andRitter, K.,An Asynchronous Parallel Newton Method, Mathematical Programming, Vol. 24, pp. 363–374, 1988.

  3. 3.

    Conforti, D., andMusmanno, R.,A Parallel Asynchronous Newton Algorithm for Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 77, pp. 305–322, 1993.

  4. 4.

    Conforti, D., Grandinetti, L., Musmanno, R., Cannataro, M., Spezzano, G., andTalia, D.,A Model of Efficient Asynchronous Parallel Algorithms on Multicomputers Systems, Parallel Computing, Vol. 18, pp. 31–45, 1992.

  5. 5.

    Conforti, D., De Luca, L., Grandinetti, L., andMusmanno, R.,Aynchronous Communication on Shared-Memory Parallel Computers, Software for Parallel Computers, Edited by J. Kowalik and L. Grandinetti, NATO ASI Series F, Springer Verlag, New York, New York, Vol. 106, pp. 280–293, 1993.

  6. 6.

    Nocedal, J.,Theory of Algorithms for Unconstrained Optimization, Acta Numerica, pp. 199–242, 1991.

  7. 7.

    Fletcher, R.,Practical Methods of Optimization, 2nd Edition, Wiley, New York, New York, 1987.

  8. 8.

    Byrd, R. H., Nocedal, J., andYuan, Y. X.,Global Convergence of a Class of Quasi-Newton Methods on Convex Problems, SIAM Journal on Numerical Analysis, Vol. 24, pp. 1171–1190, 1987.

  9. 9.

    Byrd, R. H., andNocedal, J.,A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Optimization, SIAM Journal on Numerical Analysis, Vol. 26, pp. 727–739, 1989.

  10. 10.

    Bertekas, D. P., andTsitsiklis, J. N.,Parallel and Distributed Computation, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.

  11. 11.

    Conforti, D., Grandinetti, L., andMusmanno, R.,Parallel Asynchronous Quasi-Newton Algorithm for Nonlinear Optimization Problems, Proceeding of the IMACS-IFAC International Symposium on Parallel and Distributed Computing in Engineering Systems, Edited by S. Tzafestas, P. Borne, and L. Grandinetti, Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 161–167, 1992.

  12. 12.

    Moré, J. J., Garbow, B. S., andHillstrom, K. E.,Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software, Vol. 7, pp. 17–41, 1981.

  13. 13.

    Grippo, L., Lampariello, F., andLucidi, S.,A Truncated Newton Method with Nonmonotone Line Search for Unconstrained Optimization, Journal o Optimization Theory and Applications, Vol. 60, pp. 401–419, 1989.

  14. 14.

    Toint, Ph. L.,Test Problems for Partially Separable Optimization and Results for the Routine PSPMIN, Report N. 83/4, Department of Mathematics,Facultés Universitaires de Namur, Namur, Belgium, 1983.

  15. 15.

    Buckley, A., andLe Nir, A.,QN-Like Variable Storage Conjugate Gradients, Mathematical Programming, Vol. 27, pp. 155–175, 1983.

  16. 16.

    Liu, D. C., andNocedal, J.,Test Results of Two Limited-Memory Methods for Large-Scale Optimization, Report NAM-04, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois, 1988.

  17. 17.

    Al-Baali, M.,A Rule for Comparing Two Methods in Practical Optimization, Report No. 119, Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 1991.

Download references

Author information

Additional information

This research work was partially supported by the National Research Council of Italy within the special project “Sistemi Informatici e Calcolo Parallelo” under CNR Contract No. 92.01585.PF69.

The authors are grateful to M. Al-Baali and R. H. Byrd for their valuable comments.

Communicated by H. Y. Huang

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Conforti, D., Musmanno, R. Convergence and numerical results for a parallel asynchronous quasi-Newton method. J Optim Theory Appl 84, 293–310 (1995). https://doi.org/10.1007/BF02192116

Download citation

Key Words

  • Unconstrained optimization
  • quasi-Newton methods
  • asynchronous paralel algorithms
  • hierarchical parallelism