scientific article; zbMATH DE number 3843508

MaRDI QIDQ3313633zbMATH OpenFDO

Authors V. G. Andronov, E. G. Belousov, V. M. Shironin

Publication date 1982

zbMATH Keywords

polynomial programmingpolyhedral domain

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Mathematical programming (90C99)

Recommendations

• scientific article; zbMATH DE number 557207
• Polynomial solvability of special problems of disjunctive programming
• On the solution existence to convex polynomial programs and its applications
• On linear programming relaxations for solving polynomial programming problems
• On the solution existence and stability of polynomial optimization problems
• scientific article; zbMATH DE number 125290
• Polynomial optimization problems and their relaxations
• scientific article; zbMATH DE number 3922374
• A class of polynomially solvable 0-1 programming problems and an application
• Polynomially solvable satisfiability problems

Cited in

(11)

• Existence and sensitivity analysis for nonconvex cubic optimization problems
• Complexity, exactness, and rationality in polynomial optimization
• Solution sets of quadratic complementarity problems
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
• Existence of solutions of extremal problems
• Optimality conditions for minimizers at infinity in polynomial programming
• scientific article; zbMATH DE number 6004856 (Why is no real title available?)
• On a Frank-Wolfe type theorem in cubic optimization
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• scientific article; zbMATH DE number 557207 (Why is no real title available?)

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 Q3313633)