default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBin Gao 0007
Person information
- affiliation: Academy of Mathematics and Systems Science, Beijing, China
- affiliation (former): University of Münster, Germany
- affiliation (former): UCLouvain, Belgium
Other persons with the same name
- Bin Gao — disambiguation page
- Bin Gao 0001 — Microsoft Research Asia, Beijing, China
- Bin Gao 0002
![[0000-0003-1092-7785]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-1092-7785")
— AlbaNova University Center, Department of Theoretical Chemistry, Stockholm, Sweden - Bin Gao 0003 — University of Electronic Science and Technology of China, School of Automation Engineering, Chengdu (and 1 more)
- Bin Gao 0004 — Huaiyin Institute of Technology, Faculty of Computer and Software Engineering, Huaian, China (and 2 more)
- Bin Gao 0005 — Beijing University of Technology, School of Life Science and BioEngineering, China
- Bin Gao 0006 — Tsinghua University, Institute of Microelectronics, Beijing, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Bin Gao, Renfeng Peng, Ya-xiang Yuan:
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. Comput. Optim. Appl. 88(2): 443-468 (2024)- [c2]Simon Vary, Pierre Ablin, Bin Gao, Pierre-Antoine Absil:
Optimization without Retraction on the Random Generalized Stiefel Manifold. ICML 2024 - [i9]Simon Vary, Pierre Ablin, Bin Gao, Pierre-Antoine Absil:
Optimization without Retraction on the Random Generalized Stiefel Manifold. CoRR abs/2405.01702 (2024) - [i8]Bin Gao, Nguyen Thanh Son, Tatjana Stykel:
Symplectic Stiefel manifold: tractable metrics, second-order geometry and Newton's methods. CoRR abs/2406.14299 (2024) - 2023
- [i7]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. CoRR abs/2302.14456 (2023) - [i6]Pierre Ablin, Simon Vary, Bin Gao, Pierre-Antoine Absil:
Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints. CoRR abs/2303.16510 (2023) - [i5]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Optimization on product manifolds under a preconditioned metric. CoRR abs/2306.08873 (2023) - [i4]Bin Gao, Renfeng Peng, Ya-Xiang Yuan:
Low-rank optimization on Tucker tensor varieties. CoRR abs/2311.18324 (2023) - 2022
- [j7]Bin Gao, Pierre-Antoine Absil:
A Riemannian rank-adaptive method for low-rank matrix completion. Comput. Optim. Appl. 81(1): 67-90 (2022) - [j6]Shuyu Dong, Bin Gao, Yu Guan, François Glineur:
New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition. SIAM J. Matrix Anal. Appl. 43(2): 840-866 (2022) - [j5]Bin Gao, Guanghui Hu, Yang Kuang, Xin Liu:
An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory. SIAM J. Sci. Comput. 44(3): 723- (2022) - [i3]Shuyu Dong, Bin Gao, Wen Huang, Kyle A. Gallivan:
On the analysis of optimization with fixed-rank matrices: a quotient geometric view. CoRR abs/2203.06765 (2022) - [i2]Bin Gao, Nguyen Thanh Son, Tatjana Stykel:
Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications. CoRR abs/2211.09481 (2022) - 2021
- [j4]Bin Gao, Nguyen Thanh Son, Pierre-Antoine Absil, Tatjana Stykel:
Riemannian Optimization on the Symplectic Stiefel Manifold. SIAM J. Optim. 31(2): 1546-1575 (2021) - [j3]Nguyen Thanh Son, Pierre-Antoine Absil, Bin Gao, Tatjana Stykel:
Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization. SIAM J. Matrix Anal. Appl. 42(4): 1732-1757 (2021) - [c1]Bin Gao, Nguyen Thanh Son, Pierre-Antoine Absil, Tatjana Stykel:
Geometry of the Symplectic Stiefel Manifold Endowed with the Euclidean Metric. GSI 2021: 789-796 - [i1]Shuyu Dong, Bin Gao, Yu Guan, François Glineur:
New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition. CoRR abs/2101.11108 (2021)
2010 – 2019
- 2019
- [j2]Bin Gao, Xin Liu, Ya-Xiang Yuan:
Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints. SIAM J. Sci. Comput. 41(3): A1949-A1983 (2019) - 2018
- [j1]Bin Gao, Xin Liu, Xiaojun Chen, Ya-Xiang Yuan:
A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints. SIAM J. Optim. 28(1): 302-332 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
