Gökmen, Yakup Görkem

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/6711
Name Variants
Gokmen, Yakup Gorkem
Gokmen, Y. Gorkem
Job Title
Email Address
gorkem.gokmen@ieu.edu.tr
Main Affiliation
05.09. Industrial Engineering
Status
Former Staff
Website
ORCID ID
0000-0003-0722-2629
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
GQU-3235-2022

Sustainable Development Goals

This researcher does not have a Scopus ID.
Documents

1

Citations

10

Go to WoS profile
Scholarly Output

1

Articles

1

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

10

Scopus Citation Count

10

WoS h-index

1

Scopus h-index

1

Patents

0

Projects

0

WoS Citations per Publication

10.00

Scopus Citations per Publication

10.00

Open Access Source

1

Supervised Theses

0

JournalCount
Current Page: 1 / NaN

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20221
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Citation - WoS: 10
    Citation - Scopus: 10
    On Standard Quadratic Programs With Exact and Inexact Doubly Nonnegative Relaxations
    (Springer Heidelberg, 2022) Gokmen, Y. Gorkem; Yildirim, E. Alper
    The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices. Replacing the intractable cone in this formulation by the larger but tractable cone of doubly nonnegative matrices, i.e., the cone of positive semidefinite and componentwise nonnegative matrices, one obtains the so-called doubly nonnegative relaxation, whose optimal value yields a lower bound on that of the original problem. We present a full algebraic characterization of the set of instances of standard quadratic programs that admit an exact doubly nonnegative relaxation. This characterization yields an algorithmic recipe for constructing such an instance. In addition, we explicitly identify three families of instances for which the doubly nonnegative relaxation is exact. We establish several relations between the so-called convexity graph of an instance and the tightness of the doubly nonnegative relaxation. We also provide an algebraic characterization of the set of instances for which the doubly nonnegative relaxation has a positive gap and show how to construct such an instance using this characterization.