scientific article; zbMATH DE number 3728014

MaRDI QIDQ3916367zbMATH OpenFDO

Authors Miroslav Manas

Publication date 1979

zbMATH Keywords

algorithmic solvabilitybarrier methodsbibliographybranch and bound methodsconjugate gradient methodscutting planesdecomposition methodefficiency of calculationfeasible direction methodsgeneralized reduced gradient methodgradient projection algorithmnonlinear convex programmingparametric linear programmingpenalty function methodquasi-Newton methodsrate of convergencesearch proceduressensitivity analysisseparable programmingunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Integer programming (90C10) Quadratic programming (90C20) Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Dynamic programming (90C39) Mathematical programming (90C99)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916367)