Nonlinear Programming
Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
- Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. · ISBN 978-0-387-30303-1
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.