NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
Search
All of DSpace
자연과학대학
수학전공
Journal papers
Start a new search
Current filters:
Title
Author
Subject
Date Issued
Issn
Journal
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Title
Author
Subject
Date Issued
Issn
Journal
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Add filters:
Title
Author
Subject
Date Issued
Issn
Journal
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Sort items by
Relevance
Title
Issue Date
In order
Ascending
Descending
Authors/record
All
1
5
10
15
20
25
30
35
40
45
50
Results 1-10 of 22 (Search time: 0.0 seconds).
Item hits:
Issue Date
Title
Author(s)
Type
2017
Binary quadratic optimization problems that are difficult to solve by conic relaxations
김선영
Article
2012
Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems
김선영
Article
2017
Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems
김선영
Article
2013
A quadratically constrained quadratic optimization model for completely positive cone programming
김선영
Article
2019
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
김선영
Article
2019
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
김선영
Article
2017
Formalizing the meta-theory of first-order predicate logic
김선영
Article
2016
A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
김선영
Article
2019
LAGRANGIAN-CONIC RELAXATIONS, PART II: APPLICATIONS TO POLYNOMIAL OPTIMIZATION PROBLEMS
김선영
Article
2018
LAGRANGIAN-CONIC RELAXATIONS, PART I: A UNIFIED FRAMEWORK AND ITS APPLICATIONS TO QUADRATIC OPTIMIZATION PROBLEMS
김선영
Article
previous
1
2
3
next
Discover
-Subject
1
Bisection method
1
Bound for the exact SDP relaxation
1
box and complementarity constraints
1
Chordal graph
1
Combinatorial quadratic optimizat...
1
Completely positive programming
1
Completely positive relaxations
1
Completeness
1
Computational efficiency
1
Conditions for finite termination
< previous
next >
-Date issued
4
2019
2
2018
4
2017
3
2016
2
2014
2
2013
2
2012
1
2011
2
2010
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject