Everything About ___
Live briefing

Everything about Nonlinear programming

Solution process for some optimization problems

In mathematics, nonlinear programming (NLP), also known as nonlinear optimization, is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. An optimization problem is one of calculation of the extrema of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Nonlinear programmingA 5-minute orientation
  2. Skim a recent paper: Two-Timescale Multilayer Recurrent Neural Networks for Nonlinear ProgrammingInfluential work since 2022
  3. Pick up a classic book: Nonlinear programmingThe most-reprinted book on the subject
  4. Read the landmark paper: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingCited 8,521 times
  5. Go sideways: Convex optimizationA closely related topic
  6. Go sideways: Mathematical optimizationA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics