scientific article

zbMath0705.90051MaRDI QIDQ4040645

Michel Minoux

Publication date: 5 June 1993

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

zbMATH Keywords

unconstrained optimizationconstrained optimizationdual methodsprimal methodsinfinite-dimensional programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Nonlinear programming (90C30) Linear programming (90C05) Dynamic programming (90C39) Programming in abstract spaces (90C48) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Geometric algorithms for finding a point in the intersection of balls ⋮ On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints ⋮ Parametric dual regularization for an optimal control problem with pointwise state constraints ⋮ Problem of optimal choice of a route under conditions of time discounting ⋮ On one construction of the decomposition of an extremal multicriteria problem ⋮ Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

This page was built for publication: