Skip to main content

A Box-Constrained Optimization Algorithm with Negative Curvature Directions and Spectral Projected Gradients

  • Conference paper

Part of the book series: Computing Supplementa ((COMPUTING,volume 15))

Abstract

A practical algorithm for box-constrained optimization is introduced. The algorithm combines an active-set strategy with spectral projected gradient iterations. In the interior of each face a strategy that deals efficiently with negative curvature is employed. Global convergence results are given. Numerical results are presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreani, R., Friedlander, A., Martinez, J. M.: On the solution of finite-dimensional variational inequalities using smooth optimization with simple bounds. J. Optim. Theory Appl. 94, 635–65. (1997).

    Article  MathSciNet  MATH  Google Scholar 

  2. Andreani, R., Martinez, J. M.: On the solution of the extended linear complementarity problem. Linear Alg. Appl. 281, 247–257 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  3. Andreani, R., Martinez, J. M.: Solving complementarity problems by means of a new smooth constrained nonlinear solver. In: Reformulation—Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Fukushima, M., Qi, L., eds.), pp. 1–24. New York: Kluwer, 1999.

    Google Scholar 

  4. Andreani, R., Martinez, J. M.: On the reformulation of nonlinear complementarity problems using the Fischer-Burmeister function. Appl. Math. Lett. 12, 7–12 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  5. Andreani, R., Martinez, J. M.: Reformulation of variational inequalities on a simplex and compactification of complementarity problems. SIAM J. Optim. 10, 878–895 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  6. Bielschowsky, R. H., Friedlander, A., Gomes, F. M., Martinez, J. M., Raydan, M.: An adaptive algorithm for bound constrained quadratic minimization. Invest. Operat. 7, 67–102 (1998).

    Google Scholar 

  7. Birgin, E. G., Biloti, R., Tygel, M., Santos, L. T.: Restricted optimization: a clue to a fast and accurate implementation of the common reflection surface stack method. J. Appl. Geophys. 42, 143–155 (1999).

    Article  Google Scholar 

  8. Birgin, E. G., Chambouleyron, I., Martinez, J. M.: Estimation of the optical constants and the thickness of thin films using unconstrained optimization. J. Comput. Phys. 151, 862–880 (1999).

    Article  MATH  Google Scholar 

  9. Birgin, E. G., Martinez, J. M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196–1211 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  10. Bongartz, I., Conn, A. R., Gould, N. I. M., Toint, Ph. L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Software 21, 123–160 (1995).

    Article  MATH  Google Scholar 

  11. Conn, A. R., Gould, N. I. M., Toint, Ph. L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433–460 (1988).

    Article  MathSciNet  MATH  Google Scholar 

  12. Conn, A. R., Gould, N. I. M., Toint, Ph. L.: A globally convergent augmented Lagrangean algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28, 545–572 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  13. Dennis, J. E., Echebest, N., Guardarucci, M., Martinez, J. M., Scolnik, H., Vacchino, C: A curvilinear search using tridiagonal secant updates for unconstrained optimization. SIAM J. Optim. 1, 352–372 (1991).

    MathSciNet  Google Scholar 

  14. Diniz-Ehrhardt, M. A., Dostál, Z., Gomes-Ruggiero, M. A., Martinez, J. M., Santos, S. A.: Nonmonotone strategy for minimization of quadratics with simple constraints. Appl. Math, (in press).

    Google Scholar 

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

    Google Scholar 

  16. Dostál, Z.: Box constrained quadratic programming with proportioning and projections. SIAM J. Optim. 7, 871–887 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  17. Dostál, Z., Friedlander, A., Santos, S. A.: Solution of coercive and semicoercive contact problems by FETI domain decomposition. Cont. Math. 218, 82–93 (1998).

    Article  Google Scholar 

  18. Dostál, Z., Friedlander, A., Santos, S. A.: Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints. Comput. Optim. Appl. 14, 1–1. (1999).

    Article  Google Scholar 

  19. Dostál, Z., Friedlander, A., Santos, S. A.: Adaptive precision control in quadratic programming with simple bounds and/or equalities. In: High Performance Algorithms and Software in Nonlinear Optimization: Applied Kluwer (De Leone, R., Murli, A., Pardalos, P., Toraldo, G., eds.), New York: Kluwer (in press).

    Google Scholar 

  20. Dostál, Z., Gomes, F. A. M., Santos, S. A.: Solution of contact problems by FETI domain decomposition with natural coarse space projections. Comput. Methods Appl. Mech. Eng. (in press).

    Google Scholar 

  21. Fernandes, L., Friedlander, A., Guedes, M., Júdice, J.: Solution of General Linear Complementarity Problem using smooth optimization and its application to bilinear programming and LCP. Appl. Math. Optim. 43, 1–19 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  22. Friedlander, A., Martinez, J. M.: On the maximization of a concave quadratic function with box constraints. SIAM J. Optim. 4, 177–192 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  23. Friedlander, A., Martinez, J. M., Molina, B., Raydan, M.: Gradient methods with retards and generalizations. SIAM J. Numer. Anal. 36, 275–289 (1999).

    Article  MathSciNet  Google Scholar 

  24. Friedlander, A., Martinez, J. M., Raydan, M.: A new method for large-scale box constrained convex quadratic minimization problems. Optim. Methods Software 5, 57–74 (1995).

    Article  Google Scholar 

  25. Friedlander, A., Martinez, J. M., Santos, S. A.: A new trust region algorithm for bound constrained minimization. Appl. Math. Optim. 30, 235–266 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  26. Friedlander, A., Martinez, J. M., Santos, S. A.: On the resolution of large scale linearly constrained convex minimization problems. SIAM J. Optim. 4, 331–339 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  27. Friedlander, A., Martinez, J. M., Santos, S. A.: Solution of linear complementarity problems using minimization with simple bounds. J. Global Optim. 6, 1–15 (1995).

    Article  MathSciNet  Google Scholar 

  28. Friedlander, A., Martinez, J. M., Santos, S. A.: A new strategy for solving variational inequalities on bounded polytopes. Numer. Funct. Anal. Optim. 16, 653–668 (1995).

    Article  MathSciNet  MATH  Google Scholar 

  29. Gomes, F. M., Maciel, M. C, Martinez, J. M.: Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. Math. Program. 84, 161–200 (1999).

    MathSciNet  MATH  Google Scholar 

  30. Krejic, N., Martinez, J. M., Mello, M. P., Pilotta, E. A.: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems. Comput. Optim. Appl.Comput. Optim. Appl. 16, 247–263 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  31. Martinez, J. M.: BOX-QUACAN and the implementation of Augmented Lagrangian algorithms for minimization with inequality constraints. Comput. Appl. Math. 19, 31–56 (2000).

    MathSciNet  MATH  Google Scholar 

  32. Mulato, M., Chambouleyron, I., Birgin, E. G., Martinez, J. M.: Determination of thickness and optical constants of a-Si:H films from transmittance data. Appl. Phys. Lett. 77, 2133–2135 (2000).

    Article  Google Scholar 

  33. Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal.IMA J. Numer. Anal. 13, 321–326 (1993).

    Article  MathSciNet  MATH  Google Scholar 

  34. Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26–33 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  35. Zhang, J., Xu, C: A class of indefinite dogleg path methods for unconstrained minimization. SIAM J. Optim. 9, 646–667 (1999).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Wien

About this paper

Cite this paper

Birgin, E.G., Martínez, J.M. (2001). A Box-Constrained Optimization Algorithm with Negative Curvature Directions and Spectral Projected Gradients. In: Alefeld, G., Chen, X. (eds) Topics in Numerical Analysis. Computing Supplementa, vol 15. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6217-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6217-0_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83673-6

  • Online ISBN: 978-3-7091-6217-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics