default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirai Tanaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Shota Takahashi
, Mirai Tanaka, Shiro Ikeda:
Blind deconvolution with non-smooth regularization via Bregman proximal DCAs. Signal Process. 202: 108734 (2023)- 2022
- [j9]Shota Takahashi, Mituhiro Fukuda, Mirai Tanaka:
New Bregman proximal type algorithms for solving DC optimization problems. Comput. Optim. Appl. 83(3): 893-931 (2022) - [j8]Mitsuru Toyoda, Mirai Tanaka:
Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence. J. Frankl. Inst. 359(5): 2206-2228 (2022) - 2021
- [j7]Mirai Tanaka, Takayuki Okuno:
Extension of the LP-Newton method to conic programming problems via semi-infinite representation. Numer. Algorithms 86(3): 1285-1302 (2021) - [c4]Ryo Sato, Mirai Tanaka, Akiko Takeda:
A Gradient Method for Multilevel Optimization. NeurIPS 2021: 7522-7533 - [i3]Ryo Sato, Mirai Tanaka, Akiko Takeda:
A Gradient Method for Multilevel Optimization. CoRR abs/2105.13954 (2021) - 2020
- [j6]Mitsuru Toyoda, Mirai Tanaka:
An Efficient Algorithm for an ℓ₁/ℓ₂ Mixed Optimal Control Problem with a Box Constraint and Parallelization. IEEE Control. Syst. Lett. 4(3): 584-589 (2020) - [j5]Mitsuru Toyoda, Mirai Tanaka:
Local R-linear convergence of ADMM-based algorithm for ℓ1-norm minimization with linear and box constraints. Syst. Control. Lett. 146: 104824 (2020)
2010 – 2019
- 2019
- [j4]Mirai Tanaka, Kazuhiro Kobayashi:
A route generation algorithm for an optimal fuel routing problem between two single ports. Int. Trans. Oper. Res. 26(2): 529-550 (2019) - [c3]Kenji Fukumizu, Shoichiro Yamaguchi, Yoh-ichi Mototake, Mirai Tanaka:
Semi-flat minima and saddle points by embedding neural networks to overparameterization. NeurIPS 2019: 13845-13853 - [i2]Kenji Fukumizu, Shoichiro Yamaguchi, Yoh-ichi Mototake, Mirai Tanaka:
Semi-flat minima and saddle points by embedding neural networks to overparameterization. CoRR abs/1906.04868 (2019) - 2018
- [j3]Tomohiko Mizutani, Mirai Tanaka:
Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations. Mach. Learn. 107(4): 643-673 (2018) - [c2]Manami Tatsukawa, Mirai Tanaka:
Box Constrained Low-rank Matrix Approximation with Missing Values. ICORES 2018: 78-84 - 2017
- [i1]Tomohiko Mizutani, Mirai Tanaka:
Efficient Preconditioning for Noisy Separable NMFs by Successive Projection Based Low-Rank Approximations. CoRR abs/1710.00387 (2017) - 2016
- [c1]Mirai Tanaka, Takuya Kimata, Takeshi Arai:
Estimation of Passenger Origin-Destination Matrices and Efficiency Evaluation of Public Transportation. IIAI-AAI 2016: 1146-1150 - 2014
- [j2]Mirai Tanaka, Kazuhide Nakata:
Positive definite matrix approximation with condition number constraint. Optim. Lett. 8(3): 939-947 (2014) - [j1]Mirai Tanaka, Kazuhide Nakata:
Successive Projection Method for Well-Conditioned Matrix Approximation Problems. IEEE Signal Process. Lett. 21(4): 418-422 (2014)
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-04-24 23:13 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:
