Search Results 1-9 of 9

  • Learning Weighted Top-k Support Vector Machine

    Yoshihiro Hirohashi , Tsuyoshi Kato

    … We developed a new optimization algorithm based on the Frank-Wolfe algorithm that requires no step size, enjoys the clear stopping criterion, and is never solicitous for computational instability. … The Frank-Wolfe algorithm repeats the direction finding step and the line search step. …

    情報処理学会論文誌 61(7), 2020-07-15

    IPSJ 

  • A QUADRATIC PROGRAMMING APPROACH FOR SOLVING A DYNAMIC USER EQUILIBRIUM WITH SIMULTANEOUS DEPARTURE TIME AND ROUTE CHOICE  [in Japanese]

    NAGAE Takeshi , AKAMATSU Takashi , SHIMIZU Ren , FU Haoran

    … この枠組の下で,DUE-SDRモデルを混合線形相補性問題として定式化する.次に,こうして定式化された問題が,適当な離散時点の枠組下で等価な二次計画問題に帰着することを明らかにし,これをFrank-Wolfe法を用いて解くアルゴリズムを開発する.最後に,提案解法をSioux-Fallsネットワークに適用し,未知変数が数万個に及ぶ問題に対しても,実用的な時間内に均衡解が求められることを示す.</p> …

    Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 76(3), 264-281, 2020

    J-STAGE 

  • Learning Weighted Top-k Support Vector Machine

    Hirohashi Yoshihiro , Kato Tsuyoshi

    … We developed a new optimization algorithm based on the <i>Frank-Wolfe algorithm</i> … The Frank-Wolfe algorithm repeats the <i>direction finding step</i> …

    Journal of Information Processing 28(0), 387-393, 2020

    J-STAGE 

  • Mathematical programming models for road repair scheduling—On aging bridges in Japan—

    KOICHI Shungo

    This paper proposes two mathematical programming models to deal with a scheduling problem on the renovation of several roads that need to be repaired by a certain date. A typical example of the schedu …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 10(3), JAMDSM0046-JAMDSM0046, 2016

    J-STAGE 

  • Acceleration of Shortest-Path Search in Traffic Assignment by Memorizing Shortest-Path Trees

    TAKAO Kazutaka , ASAKURA Yasuo

    Frank-Wolfe法の繰り返しループの間、最短経路探索が何度も繰り返し実行されるが、本稿は、前回の最短ツリーを記憶することによって最短経路探索を高速化する方法について述べる。 …

    INFRASTRUCTURE PLANNING REVIEW 26(0), 527-533, 2009

    J-STAGE 

  • Optimization of a geographic information system on the cell broadband engine  [in Japanese]

    OGASAWARA YOSHIYASU , SHIMAKAWA YOICHI

    … は,地理的位置を手がかりに位置に関する情報を持ったデータを総合的に管理,加工し,高度な分析や迅速な判断を可能にする技術である.本論文では,GISプログラムの高速化評価の第一フェーズという位置づけで,まず,Cell/B.E.を使用した研究開発環境,プログラミング手法,簡単なベンチマークを使用したCell/B.E.の性能評価を行った.また,GISプログラムとしてFrank-Wolfe法を取り上げ,Cell/B.E.への移植を検討した. …

    Bulletin of Salesian Polytechnic (33), 65-72, 2007

  • OBTAIN ALGORITHM FOR THE SUPPLY CHAIN NETWORK EQUILIBRIUM PROBLEM

    CHEN Huey-Kuo , CHOU Huey-Wen

    … An origin-based solution algorithm, named OBTAIN (origin-based traffic assignment for infrastructure networks), was recently developed for solving the traffic assignment problems (Bar-Gera and Boyce, 2003). … This algorithm defines the solution variables in an intermediate way between links and routes, and has been proven to be superior to the link-based Frank-Wolfe method in both computational time for and accurate level of the solution for a large network. …

    Journal of the Eastern Asia Society for Transportation Studies 6(0), 2046-2059, 2005

    J-STAGE 

  • An Analysis of the Effect of Signal Offset at Congested Link on the Whole Network through Traffic Assignment  [in Japanese]

    久井 守 , 岩永 和大 , 南 正昭 , 福島 永士

    … In this paper, static user equilibrium assignment is calculated by Frank-Wolfe algorithm and dynamic user optimal assignment through traffic simulation. …

    山口大学工学部研究報告 51(1), 25-31, 2000-10

    IR 

  • A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS

    Fukushima Masao

    … 最後に、いくつかの数値実験を行なった結果、本論文で提案したアルゴリズムは、非線形多品種流問題に対して有効な方法とされているFrank-Wolfe法と比肩しうるものであることが確かめられた。 …

    Journal of the Operations Research Society of Japan 27(2), 151-177, 1984

    J-STAGE 

Page Top