default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMituhiro Fukuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Godai Azuma
, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Glob. Optim. 86(3): 671-691 (2023)- 2022
- [j12]Shota Takahashi, Mituhiro Fukuda, Mirai Tanaka:
New Bregman proximal type algorithms for solving DC optimization problems. Comput. Optim. Appl. 83(3): 893-931 (2022) - [j11]Godai Azuma, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Glob. Optim. 82(2): 243-262 (2022) - 2021
- [j10]Masaru Ito, Mituhiro Fukuda:
Nearly Optimal First-Order Methods for Convex Optimization under Gradient Norm Measure: an Adaptive Regularization Approach. J. Optim. Theory Appl. 188(3): 770-804 (2021) - 2020
- [j9]Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
A dual spectral projected gradient method for log-determinant semidefinite problems. Comput. Optim. Appl. 76(1): 33-68 (2020)
2010 – 2019
- 2016
- [j8]Masaru Ito, Mituhiro Fukuda:
A family of subgradient-based methods for convex optimization problems in a unifying framework. Optim. Methods Softw. 31(5): 952-982 (2016) - 2012
- [j7]Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata, Maho Nakata:
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix. ACM Trans. Math. Softw. 39(1): 6:1-6:22 (2012)
2000 – 2009
- 2007
- [j6]Mituhiro Fukuda, Bastiaan J. Braams, Maho Nakata, Michael L. Overton, Jerome K. Percus, Makoto Yamashita, Zhengji Zhao:
Large-scale semidefinite programs in electronic structure calculation. Math. Program. 109(2-3): 553-580 (2007) - 2006
- [j5]Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata:
Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21(1): 17-39 (2006) - 2003
- [j4]Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda:
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program. 95(2): 303-327 (2003) - 2002
- [j3]Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida:
Lagrangian Dual Interior-Point Methods for Semidefinite Programs. SIAM J. Optim. 12(4): 1007-1031 (2002) - 2001
- [j2]Mituhiro Fukuda, Masakazu Kojima:
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem. Comput. Optim. Appl. 19(1): 79-105 (2001) - [j1]Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata:
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. Optim. 11(3): 647-674 (2001)
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-08-05 20:15 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:
