scientific article

zbMath0967.90089MaRDI QIDQ2720885

V. G. Karmanov

Publication date: 27 June 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingconvex programmingnonlinear programmingmathematical programmingoptimization algorithmsaugmented Lagrangiansprojected gradientfeasible directionsstochastic descentpenalty function methodsproblems with constraintsconditional gradient

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Methods of reduced gradient type (90C52)

Related Items (10)

Finding roots of nonlinear equations using the method of concave support functions ⋮ Stability of best approximation of a convex body by a ball of fixed radius ⋮ Nonlinear Stabilizing Control of an Uncertain Bioprocess Model ⋮ On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints ⋮ Method for false extrema localization in global optimization ⋮ Locally polynomial method for solving systems of linear inequalities ⋮ Editorial SOFT MODELS IN DECISION-MAKING ⋮ A new proof of the Kuhn-Tucker and Farkas theorems ⋮ 2-factor Newton method for solving constrained optimization problems with a degenerate Kuhn-Tucker system ⋮ Perturbation theory for mathematical programming problems

This page was built for publication: