Results 241 to 250 of about 10,424 (290)

Global optimality conditions and optimization methods for quadratic integer programming problems

Journal of Global Optimization, 2011
This paper establishes some sufficient and some necessary global optimality conditions for quadratic integer programming problems. The results given in this work extend results presented in [\textit{A. Beck} and \textit{M. Teboulle}, SIAM J. Optim. 11, No. 1, 179--188 (2000; Zbl 0990.90089)]; [\textit{W. Chen} and \textit{L. Zhang}, J. Glob. Optim. 46,
Wu Z Y
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Optimality conditions for global optimization (I)

Acta Mathematicae Applicatae Sinica, 1985
With the help of the theory of measure and integration several global optimality conditions, which are sufficient and necessary, are given for minimizing a continuous function over a topological space.
Zheng Quan
exaly   +2 more sources

Global optimality conditions and optimization methods for polynomial programming problems

Journal of Global Optimization, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhi-You Wu, J. Tian, Julien Ugon
core   +4 more sources

Second-Order Global Optimality Conditions for Optimization Problems

Journal of Global Optimization, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, XQ, X. Yang
openaire   +2 more sources

Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems

Journal of Optimization Theory and Applications, 2011
The quadratic knapsack problem (QKP) maximizes a quadratic objective function subject to a binary and linear capacity constraint. The classic knapsack problem (CKP) is a special kind of QKP with no cross terms for the objective function, and the supermodular knapsack problem (SKP) is a special kind of QKP with nonnegative cross terms for the objective ...
Zhi-You Wu, Y. J. Yang, Fu-Sheng Bai, Musa Mammadov   +3 more
openaire   +3 more sources

Global optimality conditions for quadratic 0-1 optimization problems

Journal of Global Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Chen, Liansheng Zhang
openaire   +3 more sources

Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints

Journal of Global Optimization, 2006
In this paper we establish conditions which ensure that a feasible point is a global minimizer of a quadratic minimization problem subject to box constraints or binary constraints.
V Jeyakumar, A M Rubinov, Jeyakumar V
exaly   +2 more sources

Global optimality conditions for some classes of polynomial integer programming problems

Journal of Industrial and Management Optimization, 2011
In this paper, some verifiable necessary global optimality conditions and sufficient global optimality conditions for some classes of polynomial integer programming problems are established.
Jing Quan, Zhiyou Wu
exaly   +2 more sources

Optimality conditions in global optimization and their applications

Mathematical Programming, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex M. Rubinov, Zhi-You Wu
openaire   +1 more source

Global optimality conditions for mixed nonconvex quadratic programs†

Optimization, 2009
In this article, we present some global optimality conditions for mixed quadratic programming problems. Our approach is based on a L-subdifferential and an associated L-normal cone.
Wu, Zhiyou, Bai, Fusheng
exaly   +2 more sources