scholarly journals Copositive programming and related problems

2014 ◽  
Author(s):  
F. Ahmed
Keyword(s):  
Copositive Programming

scholarly journals Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming Problems

2020 ◽  
Vol 28 (1) ◽  
pp. 89-107
Author(s):  
O. I. Kostyukova ◽  
T. V. Tchemisova ◽  
O. S. Dudina
Keyword(s):  
Optimality Criteria ◽  
Copositive Programming

scholarly journals Approximation of the Stability Number of a Graph via Copositive Programming

2002 ◽  
Vol 12 (4) ◽  
pp. 875-892 ◽  
Author(s):  
E. de Klerk ◽  
D. V. Pasechnik
Keyword(s):  
Stability Number ◽  
Copositive Programming ◽  
The Stability

scholarly journals Copositive programming motivated bounds on the stability and the chromatic numbers

2008 ◽  
Vol 121 (2) ◽  
pp. 249-268 ◽  
Author(s):  
Igor Dukanovic ◽  
Franz Rendl
Keyword(s):  
Chromatic Numbers ◽  
Copositive Programming ◽  
The Stability

Analysis of Positive Systems Using Copositive Programming

2020 ◽  
Vol 4 (2) ◽  
pp. 444-449
Author(s):  
Teruki Kato ◽  
Yoshio Ebihara ◽  
Tomomichi Hagiwara
Keyword(s):  
Positive Systems ◽  
Copositive Programming

scholarly journals Generalized problem of linear copositive programming

2019 ◽  
Vol 55 (3) ◽  
pp. 299-308
Author(s):  
O. I. Kostyukova ◽  
T. V. Tchemisova
Keyword(s):  
Finite Number ◽  
Objective Function ◽  
Optimality Conditions ◽  
Special Class ◽  
Optimization Problems ◽  
Decision Variable ◽  
Copositive Programming ◽  
Feasible Sets

We consider a special class of optimization problems where the objective function is linear w.r.t. decision variable х and the constraints are linear w.r.t. х and quadratic w.r.t. index t defined in a given cone. The problems of this class can be considered as a generalization of semi-definite and copositive programming problems. For these problems, we formulate an equivalent semi-infinite problem and define a set of immobile indices that is either empty or a union of a finite number of convex bounded polyhedra. We have studied properties of the feasible sets of the problems under consideration and use them to obtain new efficient optimality conditions for generalized copositive problems. These conditions are CQ-free and have the form of criteria.

Copositive programming

2011 ◽  
Author(s):  
Hongbo Dong
Keyword(s):  
Copositive Programming
Sign in / Sign up

Export Citation Format

Share Document