Skip to main content

An efficient strategy for utilizing a merit function in nonlinear programming algorithms

Part of the Lecture Notes in Mathematics book series (LNM,volume 1230)

Keywords

  • Line Search
  • Sequential Quadratic Programming
  • Iteration Scheme
  • Descent Direction
  • Merit Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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. P. BOGGS and J. TOLLE, "A two parameter multiplier function with exact penalty functions," Tech. Rep. No. 77-1, Curriculum in Operations Research and Systems Analysis, Univ. North Carolina, Chapel Hill, 1977.

    Google Scholar 

  2. ___, "Augmented Lagrangians which are quadratic in the multiplier," J. Optim. Theory Appl., 31 (1980), pp. 17–26.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. ___, "A family of descent functions for constrained optimization," SIAM J. Numer. Anal., 21 (1984), pp. 1146–1161.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. ___, "The implementation and testing of a merit function for constrained optimization problems," Tech. Rep. No. 85-5, Curriculum in Operations Research and Systems Analysis, Univ. North Carolina, Chapel Hill, 1985.

    Google Scholar 

  5. BOGGS, P., J. TOLLE, and P. WANG (1982), "On the local convergence of quasi-Newton methods for constrained optimization," SIAM J. Control and Optimization, 20, 161–171.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. R. CHAMBERLAIN, C. LEMARECHAL, H.C. PEDERSEN and M. POWELL, "The watchdog technique for forcing convergence in algorithms for constrained optimization," Mathematical Programming Study, 16 (1982), pp. 1–17.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. S. HAN, "Superlinearly convergent variable metric algorithms for general nonlinear programming problems," Math. Programming, 11 (1976), pp. 263–82.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. ___, "A globally convergent method for nonlinear programming," J. Optim. Theory Appl., 22 (1977), pp. 297–309.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J. ORTEGA and W. RHEINBOLDT, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.

    MATH  Google Scholar 

  10. M. POWELL, "The performance of two subroutines for constrained optimization on some difficult test problems," Proceedings of the SIAM Conference on Numerical Optimization, (to appear).

    Google Scholar 

  11. K. SCHITTKOWSKI, "On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function," Math Operationsforsch. U. Statist., Ser. Optimization, 14 (1983), pp. 197–216.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. R. TAPIA, "Quasi-Newton methods for equality constrained optimization: equivalence of existing methods and a new implementation," Nonlinear Programming 3, 0. Managasarian, R. Meyer and S. Robinson, eds., Academic Press, New York, 1978, pp. 125–64.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Boggs, P.T., Tolle, J.W. (1986). An efficient strategy for utilizing a merit function in nonlinear programming algorithms. In: Hennart, JP. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 1230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072676

Download citation

  • DOI: https://doi.org/10.1007/BFb0072676

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17200-0

  • Online ISBN: 978-3-540-47379-4

  • eBook Packages: Springer Book Archive