Nonlinear Programming algorithms

Part of the Springer Optimization and Its Applications book series (SOIA, volume 37)


This chapter describes algorithms that have been specifically designed for finding optima of Nonlinear Programming (NLP) problems.


Line Search Steep Descent Minimum Point Descent Direction Golden Section 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ArchitectureMálaga UniversityMálagaSpain
  2. 2.Department of Differential EquationsBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations