Skip to main content
Log in

Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

An Augmented Lagrangian algorithm that uses Gauss-Newton approximations of the Hessian at each inner iteration is introduced and tested using a family of Hard-Spheres problems. The Gauss-Newton model convexifies the quadratic approximations of the Augmented Lagrangian function thus increasing the efficiency of the iterative quadratic solver. The resulting method is considerably more efficient than the corresponding algorithm that uses true Hessians. A comparative study using the well-known package LANCELOT is presented.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R.H. Bielschowsky, A. Friedlander, F.M. Gomes, J.M. Martínez, and M. Raydan, “An adaptative algorithm for bound constrained quadratic minimization,” Investigación Operativa, vol. 7, pp. 67–102, 1997.

    Google Scholar 

  2. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “Global convergence of a class of trust region algorithms for optimization with simple bounds,” SIAM Journal on Numerical Analysis, vol. 25, pp. 433–460, 1988. See also SIAM Journal on Numerical Analysis, vol. 26, pp. 764-767, 1989.

    Google Scholar 

  3. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds,” SIAM Journal on Numerical Analysis, vol. 28, pp. 545–572, 1991.

    Google Scholar 

  4. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, LANCELOT, a Fortran Package for Large-Scale Nonlinear Optimization (Release A), Berlin: Springer-Verlag, 1992.

    Google Scholar 

  5. J.H. Conway and N.J.C. Sloane, Sphere Packings, Lattices and Groups, New York: Springer-Verlag, 1988.

    Google Scholar 

  6. K. Devlin, Mathematics: The Science of Patterns, New York: Scientific American Library, 1994.

    Google Scholar 

  7. M.A. Diniz-Ehrhardt, M.A. Gomes-Ruggiero, and S.A. Santos, “Comparing the numerical performance of two trust-region algorithms for large-scale bound-constrained minimization,” in International Workshop of Numerical Algebra and Optimization, Department of Mathematics, Universidade Federal do Paraná, Brazil, 1997, R.J.B. Sampaio and J.Y. Yuan (Eds.), pp. 23, 24.

    Google Scholar 

  8. Z. Dostál, A. Friedlander, and S.A. Santos, “Augmented Lagrangians with adaptative precision control for quadratic programming with equality constraints,” Computational Optimization and Applications, vol. 14, pp. 37–53, 1999.

    Google Scholar 

  9. A. Friedlander and J.M. Martínez, “On the maximization of a concave quadratic function with box constraints,” SIAM Journal on Optimization, vol. 4, pp. 177–192, 1994.

    Google Scholar 

  10. A. Friedlander, J.M. Martínez, and S.A. Santos, “A new trust-region algorithm for bound constrained minimization,” Applied Mathematics and Optimization, vol. 30, pp. 235–266, 1994.

    Google Scholar 

  11. F.M. Gomes, M.C. Maciel, and J.M. Martínez, “Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters,” Mathematical Programming, vol. 84, pp. 161–200, 1999.

    Google Scholar 

  12. W.W. Hager, “Dual techniques for constraint optimization,” Journal of Optimization Theory and Applications, vol. 55, pp. 37–71, 1987.

    Google Scholar 

  13. W.W. Hager, “Analysis and implementation of a dual algorithm for constraint optimization,” Journal of Optimization Theory and Applications, vol. 79, pp. 427–462, 1993.

    Google Scholar 

  14. N. Maculan, P. Michelon, and J. MacGregor Smith,” Bounds on the kissing numbers in Rn: Mathematical programming formulations,” Technical Report, COPPE, University of Rio de Janeiro, Brazil, 1996.

    Google Scholar 

  15. J.M. Martínez, “Augmented Lagrangians and the resolution of packing problems,” Technical Report 08/97, Institute of Mathematics, University of Campinas, Brazil.

  16. J.M. Martínez “A two-phase model algorithm with global convergence for nonlinear programming,” Journal of Optimization Theory and Applications, vol. 96, pp. 397–436, 1998.

    Google Scholar 

  17. S.G. Nash, “Preconditioning of truncated-newton methods,” SIAM Journal on Scientific and Statistical Computing, vol. 6, pp. 599–616, 1985.

    Google Scholar 

  18. E.A. Pilotta, “Linearly constrained spectral gradient methods and inexact restoration subproblems for nonlinear programming,” Ph.D. Thesis, in preparation.

  19. E.B. Saff and A.B.J. Kuijlaars, “Distributing many points on a sphere,” Mathematical Intelligencer, vol. 19, pp. 5–11, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krejić, N., Martínez, J.M., Mello, M. et al. Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems. Computational Optimization and Applications 16, 247–263 (2000). https://doi.org/10.1023/A:1008716329104

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008716329104

Navigation