Skip navigation
sign on to:
my account
receive email
updates
edit profile
language
Português
English
submit
communities
browse
Browse Items by:
Issue Date
Author
Advisor
Title
Subject
Document Type
Access Type
help
Home
Browsing by Author Kostyukova, O. I.
Jump to:
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
or enter first few letters:
Sort by:
title
issue date
submit date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 20 of 25
next >
Issue Date
Title
Author(s)
Type
Access Type
2020
Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets
Kostyukova, O. I.
;
Tchemisova, T. V.
article
18-Mar-2022
An exact explicit dual for the linear copositive programming problem
Kostyukova, O. I.
;
Tchemisova, T. V.
article
2007
An implicit optimality criterion for problems of convex Semi-Infinite Programming
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Yermalinskaya, S. A.
article
29-Jun-2012
A constructive algorithm for determination of immobile indices in convex SIP problems with polyhedral index sets
Kostyukova, O. I.
;
Tchemisova, T. V.
workingPaper
2006
Convex Semi-Infinite programming: explicit optimality conditions
Kostyukova, O. I.
;
Tchemisova, T. V.
workingPaper
2010
Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Yermalinskaya, S. A.
article
2005
Convex semi-infinite programming: implicit optimality criterion based on the concept of immobile points
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Yermalinskaya, S. A.
workingPaper
19-Feb-2015
Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
Kostyukova, O. I.
;
Tchemisova, T. V.
article
18-Feb-2023
Explicit criterion of uniform LP duality for linear problems of copositive optimization
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Dudina, O. S.
preprint
2008
Explicit optimality conditions for problems of convex semi-infinite programming
Kostyukova, O. I.
;
Chemisova, T. V.
;
Ermolinskaya, S. A.
article
31-Aug-2021
Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems
Kostyukova, O. I.
;
Tchemisova, T. V.
preprint
Mar-2020
Immobile indices and CQ-free optimality criteria for linear copositive programming problems
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Dudina, O. S.
article
Jul-2012
Implicit optimality criterion for convex SIP problem with box constrained index set
Kostyukova, O. I.
;
Tchemisova, T. V.
article
2020
Linear semidefinite programming problems: regularisation and strong dual formulations
Kostyukova, O. I.
;
Tchemisova, T. V.
article
2006
On a special nonlinear problem arising in the study of convex SIP problems
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Yermalinskaya, S. A.
preprint
31-Jan-2022
On equivalent representations and properties of faces of the cone of copositive matrices
Kostyukova, O. I.
;
Tchemisova, T. V.
article
10-Feb-2012
On one optimality criterion for the problems of convex Semi-Infinite Programming
Kostyukova, O. I.
;
Tchemisova, T. V.
;
Yermalinskaya, S. A.
bookPart
18-Feb-2021
On strong duality in linear copositive programming
Kostyukova, O. I.
;
Tchemisova, T. V.
article
23-Apr-2020
On strong duality in linear copositive programming
Kostyukova, O. I.
;
Tchemisova, T. V.
preprint
15-Nov-2018
Optimality conditions for linear copositive programming problems with isolated immobile indices
Kostyukova, O. I.
;
Tchemisova, T. V.
article