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.
Rekod sumber
Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.
- Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. · ISBN 978-0-387-30303-1
Tuntutan yang dikurasi
Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.
Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.
Kaedah berkaitan
Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.