Search citation statements

Order By: Relevance
Select...
3
2
2
55
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

2
55
0
Order By: Relevance
“…Proof. Note that according to the structure of the Euclidean projection over S n (see for instance Lemma 6 in [12]), when the condition in the if statement holds on some iteration t, then indeed the projection of Y t+1 onto S n is given by the rank one matrix u 1 u ⊤ 1 , and thus X t+1 is equivalent to the standard projected gradient update step:…”
Section: Bounded-rank Algorithmmentioning
See 4 more Smart Citations
Create an account to read the remaining citation statements from this report. You will also get access to:
  • Search over 1.2b+ citation statments to see what is being said about any topic in the research literature
  • Advanced Search to find publications that support or contrast your research
  • Citation reports and visualizations to easily see what publications are saying about each other
  • Browser extension to see Smart Citations wherever you read research
  • Dashboards to evaluate and keep track of groups of publications
  • Alerts to stay on top of citations as they happen
  • Automated reference checks to make sure you are citing reliable research in your manuscripts
  • 7 day free preview of our premium features.

Trusted by researchers and organizations around the world

Over 130,000 students researchers, and industry experts at use scite

See what students are saying

rupbmjkragerfmgwileyiopcupepmcmbcthiemesagefrontiersapsiucrarxivemeralduhksmucshluniversity-of-gavle
“…Proof. Note that according to the structure of the Euclidean projection over S n (see for instance Lemma 6 in [12]), when the condition in the if statement holds on some iteration t, then indeed the projection of Y t+1 onto S n is given by the rank one matrix u 1 u ⊤ 1 , and thus X t+1 is equivalent to the standard projected gradient update step:…”
Section: Bounded-rank Algorithmmentioning
“…Thus, starting from iteration T 1 and onwards, by invoking Theorem 7 in [12], it directly follows that the projection of Y t+1 onto S n is indeed always rank-one, and thus from this point on, only projected gradient steps are used.…”
Section: Bounded-rank Algorithmmentioning
See 3 more Smart Citations