ScholarGate
Msaidizi
Process / pipelineMathematical programming

Upangaji wa Hisabati Usio na Mstari

Upangaji wa hisabati usio na mstari (NLP) ni tawi la upangaji hisabati linalohusika na matatizo ambayo kipengele lengwa au angalau kizuizi kimoja si cha mstari. Umeandaliwa kwa kina na Jorge Nocedal na Stephen Wright katika maandishi yao muhimu ya mwaka 2006, NLP inajumuisha algoriti zinazotegemea mteremko — ikiwa ni pamoja na upangaji mraba mfuatano (SQP), mbinu za ndani ya nukta, na mbinu za karibu-na-Newton — kwa ajili ya kutafuta suluhisho za ndani au jumla kwa matatizo ya maamuzi yanayoendelea yanayojitokeza katika uhandisi, uchumi, na sayansi ya kimwili.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Vyanzo

  1. Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 2). Nonlinear Programming. ScholarGate. https://scholargate.app/sw/optimization/nonlinear-programming

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Imerejelewa na

ScholarGateNonlinear Programming (Nonlinear Programming). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/optimization/nonlinear-programming · Seti ya data: https://doi.org/10.5281/zenodo.20539026