このウェブサイトではJavaScriptおよびスタイルシートを使用しております。正常に表示させるためにはJavaScriptを有効にしてください。ご覧いただいているのは国立国会図書館が保存した過去のページです。このページに掲載されている情報は過去のものであり、最新のものとは異なる場合がありますのでご注意下さい。
研究内容
第10回
(2020)
岡本吉央
(電気通信大学)
[1] P. Carmi, M. K. Chiu, M. J. Katz, M. Korman, Y. Okamoto, A. van Renssen, M. Roeloffzen, T. Shiitada and S. Smorodinsky, "Balanced line separators of unit disk graphs," Computational Geometry: Theory and Applications, 86, No. 101575, 2020.第9回
(2019)
飯塚秀明
(明治大学)
[1] Iiduka, H. (2018). Distributed Optimization for Network Resource Allocation with Nonsmooth Utility Functions. IEEE Transactions on Control of Network Systems (accepted for publication).第8回 (2018)
該当なし
第7回
(2017)
増山博之
(京都大学)
[1] H. Masuyama. "Tail asymptotics for cumulative processes sampled at heavy-tailed random times with
applications to queueing models in Markovian environments," Journal of the Operations Research
Society of Japan, 56(2013), pp. 257–308.
[2] H. Masuyama. "Error bounds for augmented truncations of discrete-time block-monotone Markov
chains under geometric drift conditions," Advances in Applied Probability, 47(2015), pp. 83–105.
[3] H. Masuyama. "A sufficient condition for the subexponential asymptotics of GI/G/1-type Markov chains
with queueing applications," Annals of Operations Research, 247(2016), pp. 65–95.
[4] H. Masuyama. "Error bounds for augmented truncations of discrete-time block-monotone Markov
chains under subgeometric drift conditions," SIAM Journal on Matrix Analysis and Applications,
37(2016), pp. 877–910.
[5] H. Masuyama. "Continuous-time block-monotone Markov chains and their block-augmented
truncations," Linear Algebra and its Applications, 514(2017), pp. 105–150.
[1] J. Gotoh, and A. Takeda. "Minimizing
loss probability bounds for portfolio selection," European
Journal of Operational Research, 217(2012), pp. 371–380.
[2] J. Gotoh, K. Shinozaki, and A. Takeda. "Robust portfolio
techniques for mitigating the fragility of CVaR minimization
and generalization to coherent risk measures," Quantitative
Finance, 13(2013), pp. 1621–1635.
[3] A. Takeda, M. Niranjan, J. Gotoh and Y. Kawahara.
"Simultaneous pursuit of out-of-sample performance and
sparsity in index tracking portfolios," Computational
Management Science, 10(2013), pp. 21–49.
[4] J. Gotoh, and S. Uryasev. "Two pairs of families of
polyhedral norms versus lp-norms: proximity and applications
in optimization," Mathematical Programming, 156(2016),
pp. 391–431.
[5] J. Gotoh, and S. Uryasev. "Support vector machines
based on convex risk functions and general norms," Annals
of Operations Research, 249(2017), pp. 301–328.
第6回
(2016)
武田朗子
(統計数理研究所)
[1] A. Takeda, H. Mitsugi and T.
Kanamori: A unified classification model based on robust
optimization, Neural Computation, 25 (2013), pp.759-804.
[2] S. Okido and A. Takeda: Economic and environmental analysis
of photovoltaic energy systems via robust optimization,
Energy Systems, 4 (2013), pp.239-266.
[3] A. Barbero, A. Takeda and J. Lopez: Geometric intuition
and algorithms for Eν-SVM, Journal of Machine Learning Research,
16 (2015), pp.323-369.
[4] D. Bertsimas and A. Takeda: Optimizing over coherent
risk measures and non-convexities: a robust mixed integer
optimization approach, Computational Optimization and Applications,
62 (2015), pp.613-639.
[5] S. Iwata, Y. Nakatsukasa and A. Takeda: Computing the
signed distance between overlapping ellipsoids, SIAM Journal
on Optimization, 25 (2015), pp.2359-2384.
第5回 (2015)
該当なし
第4回
(2014)
平井広志
(東京大学)
[1] "Tree metrics and edge-disjoint
S-paths", Mathematical Programming Series A, 147 (1-2)
(2014), 81-123 (共著者 G. Pap).
[2] "Discrete Convexity and Polynomial Solvability in
Minimum 0-Extension Problems", Proceedings of 24th SODA
(Symposium on Discrete Algorithms) (2013) 1770-1788.
[3] "Bounded fractionality of the multiflow feasibility
problem for demand graph K3+K3 and related maximization
problems", Journal of Combinatorial Theory, Series B 102(4)
(2012), 875-899.
[4] "Folder complexes and multiflow combinatorial dualities",
SIAM Journal on Discrete Mathematics, 25(3): (2011), 1119-1143.
[5] "Metric packing for K3+K3", Combinatorica 30(3) (2010),
295-326.
第3回
(2013)
藤澤克樹
(中央大学)
[1] High-Performance General Solver
for Extremely Large-Scale Semidefinite Programming Problems,
Proceedings of the 2012 ACM/IEEE Conference on Supercomputing,
SC ’12, 2012. (共著者T. Endo, H. Sato, M. Yamashita, S. Matsuoka
and M. Nakata)
[2] Convex Optimization Approaches to Maximally Predictable
Portfolio Selection Optimization: A Journal of Mathematical
Programming and Operations Research, Available Online,
December 2012. (共著者J. Gotoh)
[3] The Second-order Reduced Density Matrix Method and
the Two-dimensional Hubbard Model, Computational and Theoretical
Chemistry、Available online, August 2012, Volume 1003,
1 January 2013, pp. 22-27. (共著者J. S. M. Anderson, M. Nakata,
R. Igarashi, and M. Yamashita)
[4] NETAL: High-performance Implementation of Network
Analysis Library Considering Computer Memory Hierarchy,
Journal of the Operations Research Society of Japan, Vol.
54, No. 4, 2011, pp. 259-280. (共著者Y. Yasui, K. Goto N.
Kamiyama, and M. Takamatsu)
[5] A Performance Characteristics of Graph500 on Large-Scale
Distributed Environment, Proceedings of the 2011 IEEE
International Symposium on Workload Characterization.
201[1] (共著者T. Suzumura, K. Ueno, H. Sato, and S. Matsuoka)
第2回
(2012)
塩浦昭義
(東北大学)
[1] M-convex Function Minimization
by Continuous Relaxation Approach: Proximity Theorem and
Algorithm.
Satoko Moriguchi, Akiyoshi shioura, and Nobuyuki TSuchimura
(SIAM Journal on Optimization, Vol.21, No.3 (2011), pp.633-668)
[2] Polynomial-Time Approximation Schemes for Maximizing
Gross Substitutes Utility under Budget Constraints
Akiyoshi Shioura
(Lecture Notes in Computer Science 6942, Springer (2011),
pp.1-123. )
[3] Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
Akiyoshi Shioura
(SIAM Journal on Discrete Mathematics, Vol.26, No.1 (2012),
pp.114-144)
[4] New Algorithms for Convex Cost Tension Problem with
Application to Computer Vision Vladimir Kolmogorov and
Akiyoshi Shioura
(Discrete Optimization, Vol.6, No.4 (2009), pp.378-393.
)
[5] Polynomial-time Algorithms for Linear and Convex Optimization
on Jump Systems
Akiyoshi Shioura and Ken'ichiro Tanaka
(SIAM Journal on Discrete Mathematics, Vol.21, No.2 (2007),
pp.504-522.)
第1回
(2011)
松井知己
(中央大学・教授)
1.安定マッチングの戦略的操作可能性に関する研究;
"Cheating Strategies for the Gale-Shapley Algorithm with
Complete Preference Lists," Algorithmica, Vol.58 (2010),
No. 1 (共著者 H. Kobayashi).
"Successful Manipulation in Stable Marriage Model with
Complete Preference Lists," IEICE TRANSACTIONS on Information
and Systems, Vol. E92-D (2009), No. 2 (共著者 H. Kobayashi).
2.グラフの多重彩色数に関する研究;
"Perfectness and Imperfectness of Unit Disk Graphs on
Triangular Lattice Points," Discrete Mathematics, Vol.
309 (2009), Issue 9 (共著者 Y. Miyamoto).
3.多次元割り当て問題のアルゴリズムに関する研究;
"An Approximation Algorithm for Multidimensional Assignment
Problems Minimizing the Sum of Squared Errors," Discrete
Applied Mathematics, Vol. 157 (2009), No. 9 (共著者 Y. Kuroki).
4.2行分割表を生成するパーフェクトサンプリング法に関する研究;
"Polynomial Time Perfect Sampling Algorithm for Two-Rowed
Contingency Tables," Random Structures and Algorithms,
Vol. 29 (2006), Issue 2 (共著者 S. Kijima).
Arc-disjoint in-trees
in directed graphs
(Combinatorica, Vol.29, No.2)
ISparse quasi-Newton updates with
positive definite matrix completion
(Mathematical Programming Series A, Vol.115, No.1)
Interior Point Trajectories and
a Homogeneous Model for Nonlinear Complementarity Problems
over Symmetric Cones
(SIAM Journal on Optimization Vol.17, No.4)
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph(Journal of Algorithms 56)
Graph algorithms for network connectivity problems
(Journal of the Operations Research Society of Japan
Vol.47, No.4)
On the subexponential properties
in stationary single-server queues:
A Palm-martingale approach
(Advances in Applied Probability Vol.36, No.3)
An Ejection Chain Approach for
the Generalized Assignment Problem
(INFORMS Journal on Computing Vol.16, No.2)
New Results on Monotone Dualization
and Generating Hypergrap Transversals
(SIAM Journal on Computing Vol.32, No.2)
On a Commutative Class of Search
Directions for Linear Programming over Symmetric Cones
(Journal of Optimization Theory and Applications Vol.112,
No.3)
戦略的資産配分問題に対する多期間確率計画モデル
(JORSJ Vol.44, No.2)
A Combinatorial, Strongly Polynomial-Time
Algorithm for Minimizing Submodular Functions
(Proceedings of the Thirty-Second Annual ACM)
Bicriteria Euclidean Location Associated
with Maximin and Minimax Criteria
(Naval Research Logistics Vol.47, No.7)
A Logical Interpretation for the
Eigenvalue Method in AHP
(JORSJ Vol.42, No.2)
A Finite Algorithm for Globally
Optimizing a Class of Rank-Two Reverse Convex Programs
(Journal of Global Optimization Vol.12, No.3)
ベイズ性能推定法のVP容量制御への適用方法
(JORSJ Vol.40, No.4)
The Generalized Stable Set Problem
for Perfect Bidirected Graphs
(JORSJ Vol.40, No.3)
A Nonpreemptive Priority MAP/G/1
Queue with Two Classes of Customers
(JORSJ Vol.39, No.2)
Superlinear convergence of the
affine scaling algorithm
(Mathematical Programming Vol.75, No.1)
Relationship between Queue-Length
and Waiting Time Distributions in a Priority Queue with
Batch Arrivals
(JORSJ Vol.37, No.1)
Hierarchical Decomposition of Symmetric
Discrete Systems by Matroid and Group Theories
(Mathematical Programming Vol.59, No.3)
Linear Complementarity and Oriented
Matroid
(JORSJ Vol.35, No.1)
Approximations for the Waiting
Time in the GI/G/s Queue
(JORSJ Vol.34, No.2)
Second Order Necessary Optimality
Conditions for Minimizing a Sup-type Function
(Mathematical Programming Vol.49, No.2)
An 0(n3L) Algorithm Using a Sequence
for Linear Complementarity Problem
(JORSJ Vol.33, No.1)
Upper Bounds of a Measure of Dependence and the Relaxation Time for Finite State Markov Chains
On the Relaxation Time for Single Server Queues
(JORSJ Vol.32, No.1)
An Efficient Algorithm for Bicriteria
Minimum-Cost Circulation Problem
(JORSJ Vol.32, No.4)
Extensions of the Multiplicative
Penalty Function Method for Linear Programming
(JORSJ Vol.30, No.2)
A Path Following Algorithm for
Stationary Point Problems
(JORSJ Vol.30, No.2)
Two Machine Open Shop Scheduling
Problems with Controllable Machine Speeds
(JORSJ Vol.29, No.2)
An Approximation of a Loss System
with Two Heterogeneous Types of Calls
(JORSJ Vol.28, No.2)
A Nonsmooth Optimization Approach
to Nonlinear Multicommodity Network Flow Problems
(JORSJ Vol. 27, No.2 他1 編)
An Optimal Ordering and Replacement
Policy of a Markovian Deterioration System Under Incomplete
Observation PartII
(JORSJ Vol.26, No.4)
Feasibility-improving gradient acute projection method
; A unified approach to nonlinear programming
(The Newton Method and Related Topics Vol.3 )
A geometric method in nonlinear Programming
(J. Optim. Theory Appl. 30)
Maximizing a Convex Quadratic Function
over a Hypercube
(JORSJ Vol.23, No.2)
On the Homotopic Approach to Systems
of Equations with Separable Mapping
(Mathematical Programming Study 7)
Maximum-Flow Problem in Discrete-Continuous
Compound Systems and its Numerical Approach
(JORSJ Vol.21, No.2)
A Class of Inverse Theorems on
Recursive Programming with Monotonicity
(JORSJ Vol.20, No.2)
Some Bounds for Queues
(JORSJ Vol.18, No.3&4)
A Sequencing Model with an Application
to Speed Class Sequencing in Air Traffic Control
(JORSJ Vol.17, No.1)
相補的プログラミング
(経営科学 16巻 1号)
Models of the Human Forecasting
Behavior
(JORSJ Vol.13, No.3)
System Reliability by Markov Renewal
Processes
(JORSJ Vol.12, No.4)
都市圏におけるマス・トランスポ-テイションの最適計画
(経営科学 13巻第1号)
Multi-Stage Rearrangement Problem
and its Applications to Multiple -System Reliability
(JORSJ Vol.11, No.1)
0n a Class of Optimal Stopping
Rule Problem
(JORSJ Vol.8, No.2)