Makoto Yamashita 研究室

主宰者：Makoto Yamashita

東京工業大学

AI 要約（直近 5 年の研究成果）

要約はまだ生成されていません。

※ AI（Claude）が、公開されている論文要旨から研究の問い・手法・主要な発見を事実情報として抽出・再構成して自動生成しています。誤りを含む可能性があるため、正確性は研究室公式情報でご確認ください。

外部リンク

関連研究室(8 件)

研究成果（21 件）

[2026] Waveguide-array-based multiplexed photonic interface for atom array
DOI: https://doi.org/10.1364/optica.588749
[2026] Optimizing Cooperative Carrier-Vehicle Routing with Iterative Second-Order Cone Programming Method
DOI: https://doi.org/10.1007/s10479-026-07089-x
[2025] A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
DOI: https://doi.org/10.1007/s10589-025-00703-x
[2025] Dual spectral projected gradient method for generalized log-det semidefinite programming
DOI: https://doi.org/10.1080/10556788.2025.2531495
[2024] An infeasible interior-point arc-search method with Nesterov's restarting strategy for LP
[2024] T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
DOI: https://doi.org/10.1007/s10589-024-00582-8
[2024] A robust optimization method with successive linear programming for intensity-modulated radiation therapy
[2024] An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems
DOI: https://doi.org/10.1007/s10589-024-00561-z
[2023] A robust optimization method with successive linear programming for intensity-modulated radiation therapy
DOI: https://doi.org/10.1080/02331934.2023.2217206
[2023] Projection Onto Convex Sets Approach to Solve Homogeneous Self Dual Model of Portfolio Optimization
DOI: https://doi.org/10.1109/icamimia60881.2023.10427974

続きを表示（残り 11 件）

[2023] Iterative Local Methods Based on Second-Order Cone Programming for Ship Routing Problem with Two Drones
[2023] Sample Average Approximation 法による確率制約条件付きの手術スケジュール最適化
[2023] 時間制約付き carrier vehicle routing 問題に対する二次錐計画問題を用いた発見的解法
[2022] Exact SDP relaxations for quadratic programs with bipartite graph structures
DOI: https://doi.org/10.1007/s10898-022-01268-3
[2021] Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
DOI: https://doi.org/10.1007/s10898-021-01071-6
[2021] An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
DOI: https://doi.org/10.1007/s11075-021-01113-w
[2021] A Conic Relaxation Approach for Semi-Integer arising from Tree Breeding
[2021] Dynamic Regret Analysis for Event-Triggered Distributed Online Optimization Algorithm
DOI: https://doi.org/10.1587/transfun.2020map0003
[2021] Logarithmic Regret for Distributed Online Subgradient Method over Unbalanced Directed Networks
DOI: https://doi.org/10.1587/transfun.2020eap1111
[2021] An improved convergence based on accelerated modulus-based Gauss–Seidel method for interactive rigid body simulations
[2021] An improved convergence based on accelerated modulus-based Gauss–Seidel method for interactive rigid body simulations
DOI: https://doi.org/10.1007/s42452-021-04238-8

科研費（0 件）

まだデータがありません（KAKEN 取り込み後に表示）。

所属学会・役職（0 件）

まだデータがありません（学会データ連携後に表示）。