数理工学教室 テクニカルレポート 1991年

No 著者 contents
91001 T. Kat,ayama A state space lagorithm of J-spectral factorization for model reduciton problem
91002 M. Fukushima A globally convergent algorithm for a class of nonsmooth optimization problems and its application to parallel decomposition of convex programs
91003 M. Fukushima A practical decomposition approach to large-scale nonlinear programming problems
91004 D. Zeng, T. Chen and M. Ohnishi Arbitration under incomplete information
91005 H. Nagamochi and T. Ibaraki A Iinear time algorithm for computing 3-edge-connected components in a given multigraph
91006 K. Taji, M. Fukushima and T. Ibaraki A Globally convergent Newton method for solving monotone variational inequalities
91007 E. Boros, P. L. Hammer, T. Ibaraki and K. Kawakami Identifying 2-monotonic positive boolean functions in polynomial time
91008 M. Ohnishi, H. Yoshida and T. Ibaraki Optimal visiting policies in symmetric polling systems
91009 Y. Yamamoto A new approach to linear quadratic regulators of sampled-data systems
91010 Y. Yamamoto A function state space approach to robust tracking for sampled-data systems
91011 M. Fukushima Application of the alternating direction method of multipliers to separable convex programming problems
91012 Y. Yamamoto A function space approach to sampled-data control systems and tracking problems
91013 D.-Z. Zeng, M. Ohnishi and T. Ibaraki Final-double-offer arbitration
91014 M. Ohnishi, T. Ibaraki and H. MIine Optimal minimal-repair and replacement problem under average cost criterion: optimality of (t, T)-policy
91015 M. Ohnishi, T. Morioka and T. Ibaraki Optimal, minimal-repair and replacement problem of discrete-time Markovian deterioration system under incomplete state information
91016 S. Ibaraki, M. Fukushima and T. Ibaraki Primal-dual proximal point algorithm for linearly constrained convex programming problems
« 上へ戻る »

最新のお知らせ RSS配信