Add to ORKGAbstract In this paper, we develop necessary conditions for global optimality that apply to non-linear programming problems with polynomial constraints which cover a broad range of optimization problems that arise in applications of continuous as well as discrete optimization. In particular, we show that our optimality conditions readily apply to problems where the objective function is the difference of polynomial and convex functions over polynomial constraints, and to classes of fractional program-ming problems. Our necessary conditions become also sufficient for global optimality for polynomial programming problems. Our approach makes use of polynomial over-estimators and a powerful theorem of the alternative for a system of polynomials...
AbstractA polynomial programming problem is a nonlinear programming problem where the objective func...
In this article, we present some global optimality conditions for mixed quadratic programming proble...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
In this paper we present necessary conditions for global optimality for polyno-mial problems over bo...
This paper is concerned with the general polynomial programming problem with box constraints, includ...
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (G...
In this paper, some verifiable necessary global optimality conditions and sufficient global optimali...
Abstract. A deterministic global optimization approach is proposed for nonconvex constrained nonline...
We establish new necessary and sufficient optimality conditions for global optimization problems. In...
In this paper, we propose an algorithm for constrained global optimization of mixed-integer nonlinea...
The polynomial programming problem which has a polynomial objective function, either with no constra...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
In this paper we propose a global optimality criterion for globally minimizing a quadratic form over...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
AbstractA polynomial programming problem is a nonlinear programming problem where the objective func...
In this article, we present some global optimality conditions for mixed quadratic programming proble...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
In this paper we present necessary conditions for global optimality for polyno-mial problems over bo...
This paper is concerned with the general polynomial programming problem with box constraints, includ...
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (G...
In this paper, some verifiable necessary global optimality conditions and sufficient global optimali...
Abstract. A deterministic global optimization approach is proposed for nonconvex constrained nonline...
We establish new necessary and sufficient optimality conditions for global optimization problems. In...
In this paper, we propose an algorithm for constrained global optimization of mixed-integer nonlinea...
The polynomial programming problem which has a polynomial objective function, either with no constra...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
In this paper we propose a global optimality criterion for globally minimizing a quadratic form over...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
AbstractA polynomial programming problem is a nonlinear programming problem where the objective func...
In this article, we present some global optimality conditions for mixed quadratic programming proble...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...