![search dblp](https://rt.http3.lol/img/search.dark.16x16.png)
default search action
Guillaume Olikier
2020 – today
- 2024
- [i10]Guillaume Olikier:
Retractions on closed sets. CoRR abs/2402.08536 (2024) - [i9]Guillaume Olikier, Irène Waldspurger:
Projected gradient descent accumulates at Bouligand stationary points. CoRR abs/2403.02530 (2024) - [i8]Guillaume Olikier, Pierre-Antoine Absil:
Computing Bouligand stationary points efficiently in low-rank optimization. CoRR abs/2409.12298 (2024) - 2023
- [j1]Guillaume Olikier
, Pierre-Antoine Absil:
An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration. SIAM J. Matrix Anal. Appl. 44(3): 1421-1435 (2023) - [c4]Charlotte Vermeylen
, Guillaume Olikier
, Pierre-Antoine Absil, Marc Van Barel
:
Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format. EUSIPCO 2023: 965-969 - [c3]Charlotte Vermeylen
, Guillaume Olikier
, Marc Van Barel
:
An Approximate Projection onto the Tangent Cone to the Variety of Third-Order Tensors of Bounded Tensor-Train Rank. GSI (1) 2023: 484-493 - [i7]Guillaume Olikier, Kyle A. Gallivan, Pierre-Antoine Absil:
First-order optimization on stratified sets. CoRR abs/2303.16040 (2023) - [i6]Guillaume Olikier, André Uschmajew, Bart Vandereycken:
Gauss-Southwell type descent methods for low-rank matrix optimization. CoRR abs/2306.00897 (2023) - [i5]Charlotte Vermeylen, Guillaume Olikier, Marc Van Barel:
An Approximate Projection onto the Tangent Cone to the Variety of Third-Order Tensors of Bounded Tensor-Train Rank. CoRR abs/2306.13360 (2023) - 2022
- [i4]Guillaume Olikier, Kyle A. Gallivan, Pierre-Antoine Absil:
An apocalypse-free first-order low-rank optimization algorithm. CoRR abs/2201.03962 (2022) - [i3]Guillaume Olikier, Pierre-Antoine Absil:
On the continuity of the tangent cone to the determinantal variety. CoRR abs/2201.03979 (2022) - [i2]Guillaume Olikier, Kyle A. Gallivan, Pierre-Antoine Absil:
Comparison of an Apocalypse-Free and an Apocalypse-Prone First-Order Low-Rank Optimization Algorithm. CoRR abs/2202.09107 (2022) - [i1]Guillaume Olikier, Pierre-Antoine Absil:
An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration. CoRR abs/2208.12051 (2022)
2010 – 2019
- 2018
- [c2]Guillaume Olikier, Pierre-Antoine Absil, Lieven De Lathauwer:
A variable projection method for block term decomposition of higher-order tensors. ESANN 2018 - [c1]Guillaume Olikier
, Pierre-Antoine Absil, Lieven De Lathauwer:
Variable Projection Applied to Block Term Decomposition of Higher-Order Tensors. LVA/ICA 2018: 139-148
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.
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.
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.
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-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint