4.6 Article

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints

Related references

Note: Only part of the references are listed.
Article Computer Science, Software Engineering

Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

V. Jeyakumar et al.

MATHEMATICAL PROGRAMMING (2007)

Article Mathematics, Applied

Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals

James Demmel et al.

JOURNAL OF PURE AND APPLIED ALGEBRA (2007)

Article Operations Research & Management Science

Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints

V. Jeyakumar et al.

JOURNAL OF GLOBAL OPTIMIZATION (2006)

Article Management

Fractional programming with convex quadratic forms and functions

HP Benson

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Article Computer Science, Software Engineering

Minimizing polynomials via sum of squares over the gradient ideal

JW Nie et al.

MATHEMATICAL PROGRAMMING (2006)

Article Mathematics, Applied

Global optimization with polynomials and the problem of moments

JB Lasserre

SIAM JOURNAL ON OPTIMIZATION (2001)