scientific article

zbMath0593.90046MaRDI QIDQ3724086

M. K. Gavurin, Vasily N. Malozemov

Publication date: 1984

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

zbMATH Keywords

necessary optimality conditionsnonsmooth optimizationexistence of solutionsbilinear programminglinear constraintscubic programmingfinite-dimensional optimizationelementary textlinear-fractional Tchebycheff approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Fractional programming (90C32) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Methods of successive quadratic programming type (90C55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items (13)

Design of suboptimal robust controllers under unknown weights of perturbations ⋮ Simplex method and groups generated by reflections ⋮ Comparative study of two fast algorithms for projecting a point to the standard simplex ⋮ Existence of solutions of extremal problems ⋮ Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions ⋮ Asymptotically suboptimal robust control of a discrete-time plant under unknown weights of perturbations ⋮ Robust tracking with unknown upper bounds on the perturbations and measurement noise ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Estimating performance of the robust control system under unknown upper disturbance boundaries and measurement noise ⋮ Iterative design of robust controllers under unknown bounded perturbation norms ⋮ Strict polynomial separation of two sets ⋮ Adaptive suboptimal robust control of the first-order plant ⋮ Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs

This page was built for publication: