default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomonari Kitahara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c1]Satoru Fujishige
, Tomonari Kitahara, László A. Végh:
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem. IPCO 2023: 142-156- 2020
- [j15]Antoine Deza, Tomonari Kitahara, Noriyoshi Sukegawa:
Preface: Workshop on Advances in Optimization. Discret. Appl. Math. 275: 1-2 (2020) - [j14]Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara:
An approximation algorithm for the partial covering 0-1 integer program. Discret. Appl. Math. 275: 126-133 (2020)
2010 – 2019
- 2019
- [j13]Tomonari Kitahara, Noriyoshi Sukegawa:
A Simple Projection Algorithm for Linear Programming Problems. Algorithmica 81(1): 167-178 (2019) - [j12]Bruno F. Lourenço, Tomonari Kitahara, Masakazu Muramatsu, Takashi Tsuchiya:
An extension of Chubanov's algorithm to symmetric cones. Math. Program. 173(1-2): 117-149 (2019) - [j11]Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara:
Approximation algorithms for the covering-type k-violation linear program. Optim. Lett. 13(7): 1515-1521 (2019) - [j10]Masaya Tano, Ryuhei Miyashiro, Tomonari Kitahara:
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP. Oper. Res. Lett. 47(3): 151-156 (2019) - 2018
- [j9]Tomonari Kitahara, Takashi Tsuchiya:
An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming. Optim. Methods Softw. 33(1): 1-25 (2018) - 2015
- [j8]Noriyoshi Sukegawa, Tomonari Kitahara:
A refinement of Todd's bound for the diameter of a polyhedron. Oper. Res. Lett. 43(5): 534-536 (2015) - 2013
- [j7]Tomonari Kitahara, Shinji Mizuno:
An Upper Bound for the Number of Different solutions Generated by the Primal Simplex Method with any Selection Rule of entering Variables. Asia Pac. J. Oper. Res. 30(3) (2013) - [j6]Tomonari Kitahara, Shinji Mizuno:
A bound for the number of different basic solutions generated by the simplex method. Math. Program. 137(1-2): 579-586 (2013) - [j5]Tomonari Kitahara, Shinji Mizuno, Jianming Shi:
The LP-Newton method for standard form linear programming problems. Oper. Res. Lett. 41(5): 426-429 (2013) - [j4]Tomonari Kitahara, Takashi Tsuchiya:
A Simple Variant of the Mizuno-Todd-Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity. SIAM J. Optim. 23(3): 1890-1903 (2013) - 2012
- [j3]Tomonari Kitahara, Shinji Mizuno:
On the number of solutions generated by the dual simplex method. Oper. Res. Lett. 40(3): 172-174 (2012) - 2011
- [j2]Tomonari Kitahara, Shinji Mizuno:
Klee-Minty's LP and upper bounds for Dantzig's simplex method. Oper. Res. Lett. 39(2): 88-91 (2011)
2000 – 2009
- 2009
- [j1]Tomonari Kitahara, Takashi Tsuchiya:
Proximity of Weighted and Layered Least Squares Solutions. SIAM J. Matrix Anal. Appl. 31(3): 1172-1186 (2009)
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 22:51 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:
