In this paper we study the global optimality conditions for some nonconvex quadratic program problems with quadratic constraints by using a new approach to establish sufficient global conditions suggested by Z.

This paper proposes a new method for global optimality condition: L-subdifferential method.

Global Optimality Conditions of Quadratically Constrained Quadratic Programming Problems;

We obtain global optimality conditions of these problems and discuss the algorithms for solving these problems.

This paper introduces a new method for global optimization roblems: some optimization methods for a kind of {0,1} quadratic programming problems with mixed variables are studied by using the global optimality conditions(necessary global optimality condition and sufficient global optimality condition).

Correlated measurement fusion Kalman estimators and their global optimality

Optimality Condition and Duality Results for a Class of Multi-objective Fractional Programming Problems with Generalized Convexity;

On optimality conditions for a Class of semi-infinite programming;

The loose saddle point optimality conditions of set-valued functions with super efficiency;

Optimality Conditions for a Quasi-differentiable and B-preinvex Programming;

The Optimality Conditions and Lagrange Duality of Vector Extremum Problems in Abstract Space;

The study of optimality conditions for generalized quasi-differentiable optimization is very important for Bracken-McGill bilevel programming and other important nondifferentiable optimization problems.