Updated on 2024/04/20

写真a

 
YAMADA Syuuji
 
Organization
Academic Assembly Institute of Science and Technology Fundamental Sciences Professor
Faculty of Science Department of Science Professor
Title
Professor
External link

Degree

  • 博士(工学) ( 2000.3   大阪大学 )

Research Interests

  • Mathematical Programming

  • Global Optimization

Research Areas

  • Natural Science / Applied mathematics and statistics  / Mathematical Programming

  • Natural Science / Basic mathematics  / Mathematical Programming

Research History (researchmap)

  • Niigata University   Faculty of Science Department of Science   Professor

    2017.4

    　 More details

  • Niigata University   Faculty of Science Department of Mathematics Mathematical Science of Information   Professor

    2014.4 - 2017.3

    　 More details

  • Niigata University   Faculty of Science Department of Mathematics   Associate Professor

    2010.4 - 2017.3

    　 More details

  • Niigata University   Graduate School of Science and Technology Fundamental Sciences   Associate Professor

    2010.4 - 2014.3

    　 More details

  • Niigata University   Graduate School of Science and Technology Information Science and Engineering   Associate Professor

    2004.4 - 2010.3

    　 More details

Research History

  • Niigata University   Faculty of Science Department of Science   Professor

    2017.4

  • Niigata University   Abolition organization Mathematical Science of Information   Professor

    2014.4 - 2017.3

  • Niigata University   Faculty of Science Department of Mathematics   Associate Professor

    2010.4 - 2017.3

  • Niigata University   Graduate School of Science and Technology Fundamental Sciences   Associate Professor

    2010.4 - 2014.3

  • Niigata University   Graduate School of Science and Technology Information Science and Engineering   Associate Professor

    2004.4 - 2010.3

 

Papers

  • Sublinear Scalarization Methods for Sets with respect to Set-Relations Reviewed

    Y.Ogata, Y.Saito, T.Tanaka, S.Yamada

    Linear and Nonlinear Analysis   3   121 - 132   2017

    　More details

  • ON GENERALIZATION OF RICCERI'S THEOREM FOR FAN-TAKAHASHI MINIMAX INEQUALITY INTO SET-VALUED MAPS VIA SCALARIZATION Reviewed

    Yutaka Saito, Tamaki Tanaka, Syuuji Yamada

    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS   16 ( 1 )   9 - 19   2015

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：YOKOHAMA PUBL  

    In the paper, we propose Ricceri's theorem on Fan-Takahashi minimax inequality for set-valued maps by using the scalarization method proposed by Kuwano, Tanaka and Yamada, and we give a characterization of a certain set which plays an important role in Ricceri's theorem.

    Web of Science

    researchmap

  • Successive search methods for solving a canonical DC programming problem Reviewed

    Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    OPTIMIZATION   63 ( 3 )   371 - 384   2014.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：TAYLOR & FRANCIS LTD  

    In this article, we propose two successive search methods for solving a canonical DC programming problem constrained by the difference set between two compact convex sets in the case where the dimension number is greater than or equal to three. In order to find feasible solutions, the algorithms generate the directions based on a branch and bound procedure, successively. By exploring the provisional solutions throughout the intersection of the boundaries of two compact convex sets, both algorithms calculate an approximate solution.

    DOI： 10.1080/02331934.2011.651471

    Web of Science

    researchmap

  • Expansion of the cross-efficiency evaluation by using the equations forming the efficient frontier in DEA Reviewed

    S. Washio, S. Yamada, T. Tanaka, T. Tanino

    OPTIMIZATION METHODS & SOFTWARE   28 ( 4 )   889 - 899   2013.8

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：TAYLOR & FRANCIS LTD  

    In this paper, we propose an algorithm to calculate cross-efficiency scores which used the equations forming the efficient frontier in data envelopment analysis (DEA). In many standard DEA models, each decision-making unit (DMU) is evaluated by using the advantageous weight for itself. Then, many DMUs are evaluated as efficient, and those efficient DMUs are not ranked by the models. The cross-efficiency evaluation is a method to rank DMUs by using the advantageous weights for all DMUs. Previously, the cross-efficiency scores based on different ideas are calculated by solving multiple linear or nonlinear programming problems. However, it is often hard to solve such a nonlinear programming problem. Therefore, by analysing the efficient frontier, we construct an algorithm to calculate alternative cross-efficiency scores.

    DOI： 10.1080/10556788.2012.750320

    Web of Science

    researchmap

  • Relationships between vector-valued cone-dc and locally cone-dc functions Reviewed

    Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    Journal of Mathematical Analysis and Applications   398 ( 2 )   588 - 593   2013.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    In this paper, we propose an extension for vector-valued cone-convex functions. Moreover, by utilizing the proposed extension, we show that each vector-valued locally cone-dc function defined over a compact convex set is cone-dc. © 2012 Elsevier Ltd.

    DOI： 10.1016/j.jmaa.2012.09.002

    Web of Science

    Scopus

    researchmap

  • Evaluation method based on ranking in data envelopment analysis Reviewed

    Satoshi Washio, Syuuji Yamada

    Expert Systems with Applications   40 ( 1 )   257 - 262   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Data envelopment analysis (DEA) has been developed as a method to evaluate efficiency of Decision Making Unit (DMU). In order to analyze DMU in detail, each DEA model is formulated as a mathematical programming problem utilizing the values of inputs and outputs of all DMUs as coefficients. Each DMU is evaluated by a different weight. Then, the efficiency score of each DMU is determined by using an advantageous weight for itself. In general, the efficiency score is obtained by selecting the most advantage weight. In some real cases, seeking the best ranking is sometimes more important than maximizing the efficiency score. In this paper, we propose a model called rank-based measure (RBM) to evaluate DMU from a different standpoint. We suggest a method to obtain a weight which gives the best ranking, and calculates a weight between maximizing the efficiency score and keeping the best ranking. In order to calculate an efficiency score and the best ranking, we repeatedly solve linear programming problems. Moreover, we apply RBM model to the cross efficiency evaluation. Furthermore, a numerical experiment is shown to compare the rankings and scores with traditional evaluations. © 2012 Elsevier Ltd. All rights reserved.

    DOI： 10.1016/j.eswa.2012.07.015

    Web of Science

    Scopus

    researchmap

  • An Outer Approximation Method Utilizing the Relation of Connection among Vertices for Solving a DC Programming Problem Reviewed

    S.Yamada, Y.Tokushige, T.Tanaka, T.Tanino

    Journal of Nonlinear Analysis and Optimization   3 ( 1 )   1 - 12   2012.3

    　More details

  • Improvements by analyzing the efficient frontier in DEA Reviewed

    Satoshi Washio, Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH   217 ( 1 )   173 - 184   2012.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：ELSEVIER SCIENCE BV  

    In this paper, we suggest four types of improvements for making inefficient DMUs efficient in the CCR model with the minimal change of input and output values. Moreover, we propose an algorithm for calculating such improvements by applying quadratic programming techniques. Furthermore, since all equations constructing the efficient frontiers of the CCR and BCC models are necessary to execute the algorithm, we present a procedure for calculating them. (C) 2011 Elsevier B.V. All rights reserved.

    DOI： 10.1016/j.ejor.2011.09.002

    Web of Science

    researchmap

  • OPTIMALITY CONDITION FOR VECTOR-VALUED DC PROGRAMMING PROBLEMS Reviewed

    Mayumi Hojo, Tamaki Tanaka, Syuuji Yamada

    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS   13 ( 1 )   57 - 64   2012

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：YOKOHAMA PUBL  

    In this paper, we introduce a general concept of the difference of two cone convex functions (DC function) in a different way from what Blanquero and Carrizosa [1] did. Also we show a certain optimality condition for dc programming by using some properties of DC functions.

    Web of Science

    researchmap

  • Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation Reviewed

    Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS   378 ( 1 )   198 - 212   2011.6

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：ACADEMIC PRESS INC ELSEVIER SCIENCE  

    In this paper, we consider a Lipschitz optimization problem (LOP) constrained by linear functions in R(n). In general, since it is hard to solve (LOP) directly. (LOP) is transformed into a certain problem (MP) constrained by a ball in R(n+1). Despite there is no guarantee that the objective function of (MP) is quasi-convex, by using the idea of the quasi-conjugate function defined by Thach (1991) [1], we can construct its dual problem (DP) as a quasi-convex maximization problem. We show that the optimal value of (DP) coincides with the multiplication of the optimal value of (MP) by -1. and that each optimal solution of the primal and dual problems can be easily obtained by the other. Moreover, we formulate a bidual problem (BDP) for (MP) (that is, a dual problem for (DP)). We show that the objective function of (BDP) is a quasi-convex function majorized by the objective function of (MP) and that both optimal solution sets of (MP) and (BDP) coincide. Furthermore, we propose an outer approximation method for solving (DP). (C) 2010 Elsevier Inc. All rights reserved.

    DOI： 10.1016/j.jmaa.2010.12.046

    Web of Science

    researchmap

  • Pareto-Efficient Target by Obtaining the Facets of the Efficient Frontier in DEA Reviewed

    Satoshi Washio, Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    Journal of Nonlinear Analysis and Optimization   2 ( 1 )   197 - 207   2011.1

    　More details

    Language：English   Publisher：Naresuan University  

    CiNii Article

    researchmap

  • IMPROVEMENT INDICES KEEPING THE FEASIBILITY IN DATA ENVELOPMENT ANALYSIS Reviewed

    Satoshi Washio, Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS   12 ( 1 )   29 - 48   2011

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：YOKOHAMA PUBL  

    In this study, we propose a computational algorithm to determine the equations simultaneously, which define the efficient frontiers of the four types of DEA(Data Envelopment Analysis) models(the CRS, VRS, IRS and DRS models). By applying the algorithm, we calculate each efficiency score of all DMUs(Decision Making Units) and classify efficient DMUs into three types of RTS(Returns To Scale). Moreover, for each DMU which is not efficient in the CRS model, we present two kinds of improvements. One is for becoming an efficient unit in the CRS model. The other is for becoming an efficient unit in the CRS model over the PP(Production Possibility) set of the VRS model. For each type of improvements, we use an order matrix defined by the decision maker to calculate an improvement target contained in the PP sets of some models.

    Web of Science

    researchmap

  • OUTER APPROXIMATION METHOD INCORPORATING THE FERRARI'S METHOD FOR SOLVING A QUADRATIC DC PROGRAMMING PROBLEM Reviewed

    Syuuji Yamada, Tamaki Tanaka, Tetsuzo Tanino

    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS   12 ( 1 )   17 - 27   2011

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：YOKOHAMA PUBL  

    In this paper, we propose two kinds of successive approximation methods for solving a quadratic dc programming problem. One is the algorithm based on an outer approximation method. The algorithm calculates an approximate solution by constructing two cutting planes at each iteration. The second is the outer approximation algorithm incorporating the Ferrari's method. By utilizing the Ferrari's method, provisional solutions are updated effectively.

    Web of Science

    researchmap

  • Outer Approximation Method Incorporating a Quadratic Approximation for a DC Programming Problem

    S. Yamada, T. Tanaka, T. Tanino

    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS   144 ( 1 )   156 - 183   2010.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：SPRINGER/PLENUM PUBLISHERS  

    In this paper, we propose an outer approximation method using two quadratic functions approximating the constraint functions of a DC programming problem. By analyzing the relation among the eigenvectors of the Hessian matrices of the constraint functions, the search direction for a feasible solution of the problem is determined. Moreover, to avoid line searches along similar directions, we incorporate a penalty function method in the algorithm.

    DOI： 10.1007/s10957-009-9590-8

    Web of Science

    Scopus

    researchmap

  • UNIFIED SCALARIZATION FOR SETS AND SET-VALUED KY FAN MINIMAX INEQUALITY Reviewed

    Issei Kuwano, Tamaki Tanaka, Syuuji Yamada

    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS   11 ( 3 )   513 - 525   2010

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：YOKOHAMA PUBL  

    In the paper, we investigate some properties of nonlinear scalarizing functions for sets introduced by Kuwano, Tanaka, Yamada (2009) and prove four kinds of set-valued Ky Fan minimax inequality.

    Web of Science

    researchmap

  • A characterization of efficient saddle point for set-valued maps Reviewed

    Tamaki Tanaka, Syuuji Yamada

    Proceedings of the Second International Conference on Game Theory and Applications   183 - 185   2007

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：WORLD ACAD UNION-WORLD ACAD PRESS  

    We introduce a certain mathematical methodology on the comparison between sets in an ordered vector space, and we consider its application to Multicriteria game theory. By using nonlinear scalarization methods for set-valued optimization problems, we obtain optimality conditions for efficient solutions of such Multicriteria optimization problems. As an application, we observe efficient-like concepts for saddle point of set-valued maps.

    Web of Science

    researchmap

  • An inner approximation method incorporating with a penalty function method for a reverse convex programming problem

    S Yamada, T Tanino, M Inuiguchi

    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS   146 ( 1 )   57 - 75   2002.9

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：ELSEVIER SCIENCE BV  

    In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. When X is not necessarily a polytope, an inner approximation method has been proposed (J. Optim. Theory Appl. 107(2) (2000) 357). The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. Then, every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem. In this paper, we improve the proposed algorithm. By underestimating the optimal value of the relaxed problem, the improved algorithms have the global convergence. (C) 2002 Elsevier Science B.V. All rights reserved.

    DOI： 10.1016/S0377-0427(02)00418-1

    Web of Science

    Scopus

    researchmap

  • An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set Reviewed

    S Yamada, T Tanino, M Inuiguchi

    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH   133 ( 2 )   267 - 286   2001.9

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：ELSEVIER SCIENCE BV  

    In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an inner approximation method for such a problem. Furthermore, in order to enhance the efficiency of the solution method, we propose an inner approximation algorithm incorporating a branch and bound procedure. (C) 2001 Elsevier Science B.V. All rights reserved.

    DOI： 10.1016/S0377-2217(00)00297-6

    Web of Science

    researchmap

  • An inner approximation method for optimization over the weakly efficient set Reviewed

    S Yamada, T Tanino, M Inuiguchi

    JOURNAL OF GLOBAL OPTIMIZATION   16 ( 3 )   197 - 217   2000.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：KLUWER ACADEMIC PUBL  

    In this paper, we consider an optimization problem which aims to minimize a convex function over the weakly efficient set of a multiobjective programming problem. To solve such a problem, we propose an inner approximation algorithm, in which two kinds of convex subproblems are solved successively. These convex subproblems are fairly easy to solve and therefore the proposed algorithm is practically useful. The algorithm always terminates after finitely many iterations by compromising the weak efficiency to a multiobjective programming problem. Moreover, for a subproblem which is solved at each iteration of the algorithm, we suggest a procedure for eliminating redundant constraints.

    DOI： 10.1023/A:1008336124425

    Web of Science

    researchmap

  • Inner approximation method for a reverse convex programming problem

    S. Yamada, T. Tanino, M. Inuiguchi

    Journal of Optimization Theory and Applications   107 ( 2 )   355 - 389   2000

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes an inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of the relaxed problems is an optimal solution of the original problem.

    DOI： 10.1023/A:1026456730792

    Scopus

    researchmap

  • Inner approximation method for a reverse convex programming problem

    S. Yamada, T. Tanino, M. Inuiguchi, K. Tatsumi

    Proceedings of the IEEE International Conference on Systems, Man and Cybernetics   3   1999.12

    　More details

    In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in case X is not necessarily a polytope. The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem.

    Scopus

    researchmap

  • An Outer Approximation Algorithm Guaranteeing Feasibility of Solutions and Approximate Accuracy of Optimality Reviewed

    Syuuji Yamada, Tamaki Tanaka

    Journal of Global Optimization   14 ( 3 )   267 - 281   1999

    　More details

    Language：English   Publishing type：Research paper (scientific journal)   Publisher：Springer Netherlands  

    We treat a concave programming problem with a compact convex feasible set. Assuming the differentiability of the convex functions which define the feasible set, we propose two solution methods. Those methods utilize the convexity of the feasible set and the property of the normal cone to the feasible set at each point over the boundary. Based on the proposed two methods, we propose a solution algorithm. This algorithm takes advantages over classical methods: (1) the obtained approximate solution is always feasible, (2) the error of such approximate value can be evaluated properly for the optimal value of such problem, (3) the algorithm does not have any redundant iterations.

    DOI： 10.1023/A:1008343426871

    Scopus

    researchmap

  • An Outer Approximation Method for Optimization over the Efficient Set Reviewed

    Syuuji Yamada, Tetsuzo Tanino, Masahiro Inuiguchi

    Lecture Note in Economics and Mathematical Systems   487   196 - 207   1000.6

    　More details

▶ display all

MISC

  • 凸乗法最大化問題に対する大域的最適化手法

    内山大輝, 山田修司

    自動制御連合講演会(CD-ROM)   61st ( 0 )   ROMBUNNO.2F1 - 1638   2018.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 分数計画問題に対する大域的最適化手法

    熊倉卓也, 山田修司

    自動制御連合講演会(CD-ROM)   61st ( 0 )   ROMBUNNO.2F2 - 1642   2018.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    CiNii Article

    J-GLOBAL

    researchmap

  • リプシッツ最適化問題に対する大域的最適化手法

    長南侑吾, 山田修司

    自動制御連合講演会(CD-ROM)   61st ( 0 )   ROMBUNNO.2F3 - 1646   2018.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 捕捉者のある捜索ゲーム

    黒須敦史, 宝崎隆祐, 佐久間大, 鵜飼孝盛, 山田修司

    自動制御連合講演会(CD-ROM)   61st ( 0 )   ROMBUNNO.2E3 - 1334   2018.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 捕捉者を伴う捜索ゲームにおける目標のマルコフ移動戦略

    黒須敦史, 宝崎隆祐, 佐久間大, 鵜飼孝盛, 山田修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2018   200‐201   2018.9

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A procedure of listing KKT points for a convex multiplication programming problem

    山田修司

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   62nd   ROMBUNNO.132‐4   2018.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 捕捉者を伴う密輸取締ゲーム

    黒須敦史, 宝崎隆祐, 佐久間大, 鵜飼孝盛, 山田修司

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2018   52‐53   2018.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 凸関数の積の大域的最小化

    山田修司

    自動制御連合講演会(CD-ROM)   60th ( 0 )   ROMBUNNO.SuH2‐1 - 1536   2017.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    DOI： 10.11511/jacc.60.0_1533

    CiNii Article

    J-GLOBAL

    researchmap

  • 逆凸2次計画問題に対するFJ点列挙法におけるラグランジュ乗数更新方法の改善

    山田修司

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   61st   ROMBUNNO.353‐1   2017.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 集合最適化における劣線形スカラー化手法について

    久須美裕, 田中環, 山田修司

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2017   341‐342   2017.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 集合の二項関係に基づくスカラー化関数の数値計算法

    YU Hui, 池浩一郎, 小形優人, 齋藤裕, LIU Xuefeng, 田中環, 山田修司

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2017   343‐344   2017.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 逆凸制約をもつ2次計画問題に対するFJ点列挙法を導入した分枝限定法の改善

    山田修司

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2017   349‐350   2017.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 逆凸制約をもつ2次計画問題に対するFJ点列挙法の改善

    山田修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2016   162‐163   2016.9

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A global optimization method for a quadratic reverse convex programming problem by listing FJ points

    山田 修司

    システム制御情報学会研究発表講演会講演論文集   60   6p   2016.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    researchmap

  • A global optimization method for a quadratic reverse convex programming problem by listing FJ points

    山田 修司

    システム制御情報学会研究発表講演会講演論文集   60   2016.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    researchmap

  • 逆凸2次計画問題に対するFJ点列挙法を用いた大域的最適化手法

    山田修司

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   60th   ROMBUNNO.352‐1   2016.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 逆凸計画問題に対する大域的最適化アルゴリズムとその応用

    山田修司

    システム/制御/情報   60 ( 2 )   47 - 53   2016.2

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    DOI： 10.11509/isciesci.60.2_47

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • On generalization of Ricceri's theorem into set-valued maps via scalarization

    Saito Yutaka, Tanaka Tamaki, Yamada Syuuji

    RIMS Kokyuroku   1963 ( 1963 )   130 - 137   2015.10

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • A global optimization method for optimization over an efficient set of a multiobjective programming problem with a reverse convex constraint

    山田 修司, 田中 環, 谷野 哲三

    システム制御情報学会研究発表講演会講演論文集   59   ROMBUNNO.326-1   2015.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 1-H-10 逆凸制約をもつ2次計画問題に対するFJ点列挙法を用いた分枝限定法(連続最適化(1))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2015   182 - 183   2015.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 逆凸制約をもつ2次計画問題に対するFJ点列挙法を用いた分枝限定法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2015   182 - 183   2015.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 逆凸制約をもつ2次計画問題に対するKKT点列挙法とその応用

    山田修司, 田中環, 谷野哲三

    自動制御連合講演会(CD-ROM)   57th ( 0 )   ROMBUNNO.2C06‐5 - 1378   2014.11

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    本研究では制約集合が有界開凸集合の補集合とコンパクト凸集合の共通部分で表わされる2次計画問題に対し，KKT点列挙法を提案する．また，KKT点列挙法を用いた大域的最適化手法やその応用について説明する．

    DOI： 10.11511/jacc.57.0_1373

    CiNii Article

    J-GLOBAL

    researchmap

  • Optimality conditions for a cone-dc vector optimization problem (Nonlinear Analysis and Convex Analysis)

    山田 修司, 田中 環, 谷野 哲三

    数理解析研究所講究録   ( 1923 )   205 - 213   2014.11

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    researchmap

  • Optimality conditions for a cone-dc vector optimization problem (Nonlinear Analysis and Convex Analysis)

    YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   ( 1923 )   205 - 213   2014.11

    　More details

    Language：English   Publisher：京都大学  

    CiNii Article

    researchmap

  • Association of Fan-Takahashi Inequality Theorem and Ricceri's Theorem Using a Certain Map

    Saito Yutaka, Tanaka Tamaki, Yamada Syuuji

    RIMS Kokyuroku   1923 ( 1923 )   192 - 197   2014.11

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • SADDLE POINTS FOR CONVEX PROGRAMMING IN CHAIN COMPLETE PARTIALLY ORDERED VECTOR SPACES (Nonlinear Analysis and Convex Analysis)

    WATANABE TOSHIKAZU, KUWANO ISSEI, TANAKA TAMAKI, YAMADA SYUUJI

    RIMS Kokyuroku   1923 ( 1923 )   233 - 241   2014.11

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • 2-A-6 逆凸制約をもつ2次計画問題に対するKKT点列挙法を用いた大域的最適化手法(連続最適化(2))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2014   172 - 173   2014.8

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 逆凸制約をもつ2次計画問題に対するKKT点列挙法を用いた大域的最適化手法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2014   172 - 173   2014.8

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • DC2次計画問題に対する分枝限定法

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   58th   ROMBUNNO.113-3   2014.5

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    CiNii Article

    J-GLOBAL

    researchmap

  • 1-F-7 逆凸制約をもつ2次計画問題に対する大域的最適化手法(連続最適化(1))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2014   108 - 109   2014.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 逆凸制約をもつ2次計画問題に対する大域的最適化手法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2014   108 - 109   2014.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A successive approximation method for solving a fractional programming problem based on DC optimization

    HIRANO Yasuyuki, YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   1841 ( 1841 )   105 - 113   2013.7

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • Optimization for a mixed integer programming problem (Nonlinear Analysis and Convex Analysis)

    YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   1821 ( 1821 )   231 - 238   2013.1

    　More details

    Language：English   Publisher：京都大学  

    CiNii Article

    CiNii Books

    researchmap

  • ベクトル値DC計画問題の最適性条件 (非線形解析学と凸解析学の研究 : RIMS研究集会報告集)

    北條 真弓, 田中 環, 山田 修司

    数理解析研究所講究録   1821 ( 1821 )   270 - 276   2013.1

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • Note on the regularity of nonadditive measures

    Toshikazu Watanabe, Syuji Yamada, Tamaki Tanaka

    Journal of Applied Mathematics   2013   2013

    　More details

    Language：English  

    We consider the regularity for nonadditive measures. We prove that the non-additive measures which satisfy Egoroff's theorem and have pseudometric generating property possess Radon property (strong regularity) on a complete or a locally compact, separable metric space. © 2013 Toshikazu Watanabe et al.

    DOI： 10.1155/2013/234681

    Scopus

    researchmap

  • 逆凸制約をもつ2次計画問題に対するKKT点列挙法を用いた分枝限定法

    山田修司, 田中環, 谷野哲三

    自動制御連合講演会(CD-ROM)   56th   ROMBUNNO.717   2013

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 弱有効解集合上でのリプシッツ最適化問題に対する外部近似法

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   56th   ROMBUNNO.M36-6   2012.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 分数計画問題に対する外部近似法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2012   224 - 225   2012.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 2-E-8 分数計画問題に対する外部近似法(ゲーム理論・連続最適化)

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2012   224 - 225   2012.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • Sphere Loose Packing Simulation Model and Approximation Formula for Packing Density

    山田 修司, 菅野 仁子, 宮内 美樹

    研究報告数理モデル化と問題解決（MPS）   2012 ( 21 )   1 - 6   2012.2

    　More details

    Language：Japanese  

    重力ではなく分子間力のような粒子間引力が働いている環境における球充填をシミュレートするモデルを導入した。その充填実験の結果から，容器の壁面積-体積比と壁面平均曲率とだけを用いて種々の容器形状における充填密度を良好に近似する公式を与えた。A new simulation model for the sphere random loose packing is introduced. An approximation formula for the packing density involving only S/V ratio and average of mean curvature of wall surface of the container is given.

    CiNii Article

    CiNii Books

    researchmap

  • 2-C-5 DEAにおいて順位を最優先にした効率評価(特別セッション 評価のOR(2))

    鷲尾 哲, 山田 修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2011   236 - 237   2011.9

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • DEAにおいて順位を最優先にした効率評価

    鷲尾哲, 山田修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2011   236 - 237   2011.9

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • EXISTENCE THEOREMS FOR SADDLE POINTS OF SET-VALUED MAPS VIA NONLINEAR SCALARIZATION METHODS (Nonlinear Analysis and Convex Analysis)

    Kuwano Issei, Tanaka Tamaki, Yamada Syuuji

    RIMS Kokyuroku   1755 ( 1755 )   210 - 217   2011.8

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • An inner approximation method for optimization over the weakly efficient set with respect to a closed convex cone

    ANDO Keita, YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   1755 ( 1755 )   218 - 225   2011.8

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • 標準DC計画問題に対する区分的分離超平面を用いた逐次近似解法

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   55th   ROMBUNNO.W15-3   2011.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 標準DC計画問題に対する逐次近似解法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2011   8 - 9   2011.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 1-A-3 標準DC計画問題に対する逐次近似解法(連続最適化(1))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2011   8 - 9   2011.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 2-C-7 DEAにおいて加重和を用いた全順序評価(評価のOR(3))

    鷲尾 哲, 山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2010   164 - 165   2010.9

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • DC計画問題に対する内部近似法

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   54th ( 0 )   ROMBUNNO.F33-4 - 293   2010.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    In this study, we propose an inner approximation method for solving a DC programming problem with a reverse convex constraint defined by a bounded open convex set. It is shown that the algorithm has the global convergence by utilizing an approximation of the set by a sequence of polytopes from inside.

    DOI： 10.11509/sci.SCI10.0.293.0

    CiNii Article

    J-GLOBAL

    researchmap

  • Improvement indices based on careful study of the feasibility in DEA (Nonlinear Analysis and Convex Analysis)

    WASHIO Satoshi, YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   1685 ( 1685 )   200 - 209   2010.4

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • UNIFIED SCALARIZATION FOR SETS IN SET-VALUED OPTIMIZATION (Nonlinear Analysis and Convex Analysis)

    Kuwano Issei, Tanaka Tamaki, Yamada Syuuji

    RIMS Kokyuroku   1685 ( 1685 )   270 - 280   2010.4

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • Improvement of an outer approximation method for solving a DC programming problem with pseudo-convex constraint functions

    TOKUSHIGE Yusuke, YAMADA Syuuji, TANINO Tetsuzo

    RIMS Kokyuroku   1685 ( 1685 )   249 - 258   2010.4

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • DEAにおいて加重和を用いた全順序評価

    鷲尾哲, 山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2010   164 - 165   2010

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • リプシッツ最適化問題に対する頂点間の連結関係を用いた内部近似法

    山田 修司, 田中 環, 谷野 哲三

    自動制御連合講演会講演論文集 = 自動制御連合講演会講演論文集   52 ( 3 )   1 - 6   2009.11

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    In this paper, we propose an inner approximation method for solving a Lipschitz optimization problem. In order to execute the algorithm, we transform a Lipschitz optimization problem into a problem constrained by a hemisphere. The algorithm utilizes an approximation of the hemisphere by a sequence of polytopes from inside. Moreover, in order to calculate vertices of polytopes effectively, the algorithm utilizes the adjacency relationships among vertices.

    CiNii Article

    researchmap

  • DEAにおいて実現可能性を考慮した効率測定

    鷲尾 哲, 山田 修司, 田中 環, 谷野 哲三

    自動制御連合講演会講演論文集 = 自動制御連合講演会講演論文集   52 ( 5 )   1 - 2   2009.11

    　More details

    Language：Japanese   Publisher：システム制御情報学会  

    In this study, we suggest four kinds of improvement indices based on careful study of the feasibility for inefficient DMUs to become an efficient unit in the CCR model with the minimal change of input and output values. Moreover, we propose an algorithm for calculating the proposed indices based on quadratic programming techniques. Furthermore, we propose four efficient measure models based on careful study of the feasibility.

    CiNii Article

    researchmap

  • ベクトル空間における集合のスカラー化数値計算法について

    田中環, 山田修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2009 ( 0 )   261 - 262   2009.9

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    In this study, we propose computational method on several scalarizing functions for sets in a vector spaces. Classically, we use some types of scalarization methods for multiobjective programming problems. For two decades, some papers devoted in the fields of vector optimization and set-valued optimization were appeared with interesting results using nonlinear scalarizing functions with respect to some partial ordering introduced by a convex cone in a vector space. The aim of this paper is to introduce several useful scalarizing functions for sets and propose certain computational methods for them by global optimization technique.

    CiNii Article

    J-GLOBAL

    researchmap

  • 2-G-3 ベクトル空間における集合のスカラー化数値計算法について(連続最適化(1))

    田中 環, 山田 修司

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2009   261 - 262   2009.9

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 2-G-4 リプシッツ最適化問題に対する切除平面法を導入した内部近似法(連続最適化(2))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2009   263 - 264   2009.9

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • リプシッツ最適化問題に対する切除平面法を導入した内部近似法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2009   263 - 264   2009.9

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • An outer approximation method for solving a dual problem of a Lipschitz optimization problem.

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   53rd ( 0 )   ROMBUNNO.F15-2 - 165   2009.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    本研究ではリプシッツ最適化問題の双対問題に対する外部近似法に基づく新たな逐次近似解法を提案する．本研究で提案するアルゴリズムはリプシッツ最適化問題を高次の球上での最適化問題に変換し，その双対問題の制約集合を凸多面体で外部近似することで大域的収束性が保証され，暫定解列の任意の集積点が対象問題の大域的最適解となることが示される．また，制約関数が凸関数で定義されている場合，暫定解の列を制約集合上に生成することができ，実行可能な近似解を求めることができる．

    DOI： 10.11509/sci.SCI09.0.165.0

    CiNii Article

    J-GLOBAL

    researchmap

  • SEVERAL NONLINEAR SCALARIZATION METHODS FOR SET-VALUED MAPS (Nonlinear Analysis and Convex Analysis)

    Kuwano Issei, Tanaka Tamaki, Yamada Syuuji

    RIMS Kokyuroku   1643 ( 1643 )   75 - 86   2009.4

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • An inner approximation method using the adjacency relationships among vertices for solving a Lipschitz optimization problem

    山田修司, 田中環, 谷野哲三

    自動制御連合講演会(CD-ROM)   52nd ( 0 )   ROMBUNNO.B3-6 - 138   2009

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    In this study, we propose an inner approximation method for solving a Lipschitz optimization problem. In order to execute the algorithm, we transform a Lipschitz optimization problem into a problem constrained by a hemisphere. The algorithm utilizes an approximation of the hemisphere by a sequence of polytopes from inside. Moreover, in order to calculate vertices of polytopes effectively, the algorithm utilizes the adjacency relationships among vertices.

    DOI： 10.11511/jacc.52.0.138.0

    CiNii Article

    J-GLOBAL

    researchmap

  • Efficient measures based on careful study of the feasibility in DEA

    鷲尾哲, 山田修司, 田中環, 谷野哲三

    自動制御連合講演会(CD-ROM)   52nd ( 0 )   ROMBUNNO.B5-1 - 223   2009

    　More details

    Language：Japanese   Publisher：自動制御連合講演会  

    In this study, we suggest four kinds of improvement indices based on careful study of the feasibility for inefficient DMUs to become an efficient unit in the CCR model with the minimal change of input and output values.Moreover, we propose an algorithm for calculating the proposed indices based on quadratic programming techniques.Furthermore, we propose four efficient measure models based on careful study of the feasibility.

    DOI： 10.11511/jacc.52.0.223.0

    CiNii Article

    J-GLOBAL

    researchmap

  • A successive approximation method for solving a Lipschitz optimization problem (Nonlinear analysis and convex analysis)

    YAMADA Syuuji, TANAKA Tamaki, TANINO Tetsuzo

    RIMS Kokyuroku   1611 ( 1611 )   18 - 25   2008.9

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • An inner approximation method for solving a Lipschitz optimization problem

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集(CD-ROM)   52nd ( 0 )   539 - 540   2008.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    In this study, we propose an inner approximation method for solving a Lipschitz optimization problem. In order to execute the algorithm, we consider the projection of the feasible set on a ball. The algorithm utilizes an approximation of the ball by a sequence of polytopes from inside.

    DOI： 10.11509/sci.SCI08.0.247.0

    CiNii Article

    J-GLOBAL

    researchmap

  • A successive approximation method using a quadratic approximation for a global optimization problem

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集   51st ( CD-ROM )   1F1-4 - 209   2007.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    In this study, we propose an outer approximation method for a global optimization problem constrained by convex and concave functions. It is known that such a problem can be transformed into a d.c. programming problem. The proposed algorithm utilizes a sequence of convex polyhedral sets approximating the reverse convex set.

    DOI： 10.11509/sci.SCI07.0.209.0

    CiNii Article

    J-GLOBAL

    researchmap

  • D.C.計画問題に対する2次近似を用いた逐次近似解法 (非線形解析学と凸解析学の研究--RIMS研究集会報告集)

    山田 修司, 田中 環, 谷野 哲三

    数理解析研究所講究録   1544 ( 1544 )   222 - 231   2007.4

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • 1-E-6 D.C.計画問題に対する逐次2次近似解法(非線形計画)

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2007   68 - 69   2007.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • D.C.計画問題に対する逐次2次近似解法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2007   68 - 69   2007

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 2-E-2 D.C.計画問題に対する2次近似を用いた逐次近似解法(非線形最適化)

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2006   252 - 253   2006.9

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • A successive approximation method using quadratic approximate functions for a d.c. programming problem

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集   50th ( 0 )   153 - 154   2006.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    In this study, we propose a successive approximation method using quadratic functions approximating constraint functions for a d.c. programming problem. By analyzing the relation of eigen vectors of Hessian matrices of constraint functions, the direction searching a feasible solution of the problemis determined.

    DOI： 10.11509/sci.SCI06.0.77.0

    CiNii Article

    J-GLOBAL

    researchmap

  • 2-A-10 D.C.計画問題に対する2次近似を用いた外部近似法(非線形最適化(2))

    山田 修司, 田中 環, 谷野 哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2006   94 - 95   2006.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • D.C.計画問題に対する2次近似を用いた遂次近似解法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2006   252 - 253   2006

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • D.C.計画問題に対する2次近似を用いた外部近似法

    山田修司, 田中環, 谷野哲三

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2006   94 - 95   2006

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Relaxation of reverse convex constraints to a D.C. programming problem

    山田修司, 田中環, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集   49th ( 0 )   31 - 32   2005.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    本研究では D.C. 計画問題に対する逐次近似解法を提案します。従来、D.C. 計画問題に対し提案されている外部近似法に基づくアルゴリズムは有限回の反復で得られる近似解が実行可能領域に含まれるとはかぎりません。そこで、本研究では主問題に代わり逆凸制約を緩和した問題に対し、外部近似法に基づくアルゴリズムを適用することで実行可能領域に含まれる近似解を求める手法を提案します。また、その手法にペナルティ関数を導入し、より効率的に凸多面体実行可能領域を逐次近似するアルゴリズムを提案します。

    DOI： 10.11509/sci.SCI05.0.28.0

    CiNii Article

    J-GLOBAL

    researchmap

  • Webデザイナーカリキュラムに関する一考察

    HASHIMOTO Hitomi, OOSAKI Yuuichi, YAMADA Syuuji

    Journal of Toyama College   39   1 - 6   2004.3

    　More details

    Language：Japanese   Publisher：富山短期大学  

    CiNii Article

    CiNii Books

    researchmap

  • Successive Approximation Method for DC Programming Problem

    山田修司, 谷野哲三, 乾口雅弘

    システム制御情報学会研究発表講演会講演論文集   47th ( 0 )   31 - 32   2003.5

    　More details

    Language：Japanese   Publisher：一般社団法人 システム制御情報学会  

    In this paper, we consider a DC programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. When X is not necessarily a polytope, we propose an inner approximation method. The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. Then, every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem.

    DOI： 10.11509/sci.SCI03.0.1016.0

    CiNii Article

    J-GLOBAL

    researchmap

  • 逆凸計画問題に対するペナルティ関数を用いた分枝限定法

    YAMADA Syuuji

    Journal of Toyama College   37   71 - 80   2002.3

    　More details

    Language：Japanese   Publisher：富山短期大学  

    CiNii Article

    CiNii Books

    researchmap

  • エレガントな解答をもとむ

    古市 茂, 山田 修司, 植野 義明

    数学セミナ-   40 ( 6 )   86 - 92   2001.6

    　More details

    Language：Japanese   Publisher：日本評論社  

    CiNii Article

    CiNii Books

    researchmap

  • An Exact Penalty parameter of an Inner Approximation Method for a Reverse Convex Programming Problem

    YAMADA Syuuji, TANINO Tetsuzo, INUIGUCHI Masahiro

    Journal of Toyama College   36   165 - 181   2001.3

    　More details

    Language：English   Publisher：富山短期大学  

    In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. When X is not necessarily a polytope in the problem, an inner approximation method using penalty functions has been proposed by Yamada, Tanino and Inuiguchi [9]. In this paper, we show that there exists an exact penalty parameter of the proposed algorithm.

    CiNii Article

    CiNii Books

    researchmap

  • DC Programming Method

    山田 修司

    Journal of Japan Society for Fuzzy Theory and Systems   13 ( 6 )   615 - 615   2001

    　More details

    Language：Japanese   Publisher：日本知能情報ファジィ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 逆凸計画問題に対する内部近似法の改良 (Mathematical Science of Optimization)

    山田 修司, 佐藤 研吾, 谷野 哲三, 乾口 雅弘

    数理解析研究所講究録   ( 1174 )   192 - 204   2000.10

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    researchmap

  • An Inner Approximation Method for a Reverce Convex Programming Problem Using Penalty Functions and Barrier Functions.

    佐藤研吾, 山田修司, 谷口尚, 望月勇岐, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集   44th   307 - 308   2000.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • An Inner Approximation Method for a Reverse Convex Programming Problem Using Penalty Functions and a Bound Procedure.

    望月勇岐, 山田修司, 谷口尚, 佐藤研吾, 谷野哲三

    システム制御情報学会研究発表講演会講演論文集   44th   309 - 310   2000.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • An Inner Approximation Method Using a Descent Method for a Reverse Convex Programming Problem (Nonlinear Analysis and Convex Analysis)

    Yamada Syuuji, Tanino Tetsuzo, Inuiguchi Masahiro

    RIMS Kokyuroku   1136 ( 1136 )   147 - 161   2000.4

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • 逆凸計画問題に対する内部近似法

    谷口尚, 山田修司, 谷野哲三, 乾口雅弘

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2000   176 - 177   2000.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 逆凸計画問題に対する内部近似法(数理計画法(3))

    谷口 尚, 山田 修司, 谷野 哲三, 乾口 雅弘

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2000   176 - 177   2000.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • An Inner Approximation Method for a Reverse Convex Programming Problem (Continuous and Discrete Mathematics for Optimization)

    Yamada Syuuji, Tanino Tetsuzo, Inuiguchi Masahiro

    RIMS Kokyuroku   1114 ( 1114 )   85 - 95   1999.11

    　More details

    Language：English   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • An Inner Approximation Method for a Convex Programming Problem with a Reverse Convex Constraint.

    山田修司, 谷野哲三, 乾口雅弘

    システム制御情報学会研究発表講演会講演論文集   43rd   505 - 506   1999.5

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 弱有効解集合上での凸関数最小化問題に対する内部近似法/分枝限定法(数理計画(4))

    山田 修司, 西村 英二, 谷野 哲三, 乾口 雅弘

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   1999   130 - 131   1999.3

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 弱有効解集合上での凸関数最小化問題に対する内部近似法/分枝限定法

    山田修司, 西村英二, 谷野哲三, 乾口雅弘

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   1999   130 - 131   1999

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 弱有効解集合上での凸関数最小化問題に対する内部近似法(非線形計画(2))

    山田 修司, 谷野 哲三, 乾口 雅弘

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   1998   116 - 117   1998.10

    　More details

    Language：Japanese   Publisher：公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Article

    CiNii Books

    researchmap

  • 弱有効解集合上での凸関数最小化問題に対する内部近似法 (数理最適化の理論と応用)

    山田 修司, 谷野 哲三, 乾口 雅弘

    数理解析研究所講究録   1068 ( 1068 )   1 - 12   1998.10

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

  • 弱有効解集合上での凸関数最小化問題に対する内部近似法

    山田修司, 谷野哲三, 乾口雅弘

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   1998   116 - 117   1998

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • An Outer Approximation Method for a Concave Minimization Problem(Optimization Theory in Descrete and Continuous Mathematical Sciences)

    Yamada Syuuji, Tanaka Tamaki

    RIMS Kokyuroku   1015 ( 1015 )   1 - 13   1997.11

    　More details

    Language：Japanese   Publisher：京都大学数理解析研究所  

    CiNii Article

    CiNii Books

    researchmap

▶ display all

 

Teaching Experience

  • データサイエンス基礎演習

    2022
    Institution name：新潟大学

  • データサイエンス・インターンシップ(事前・事後指導)

    2021
    Institution name：新潟大学

  • データサイエンス発表

    2021
    Institution name：新潟大学

  • データサイエンス・インターンシップ

    2021
    Institution name：新潟大学

  • 先端科学技術総論

    2021
    -
    2022
    Institution name：新潟大学

  • 基礎英語コミュニケーション

    2021
    Institution name：新潟大学

  • 実践英語コミュニケーション

    2021
    Institution name：新潟大学

  • 理学スタディ・スキルズ

    2021
    Institution name：新潟大学

  • データサイエンス総論Ⅱ

    2020
    Institution name：新潟大学

  • データサイエンス総論Ⅰ

    2020
    Institution name：新潟大学

  • 応用数理特別講義

    2020
    Institution name：新潟大学

  • 専門力アクティブ・ラーニング

    2019
    -
    2020
    Institution name：新潟大学

  • 数学基礎A2

    2018
    Institution name：新潟大学

  • 数学基礎A1

    2018
    Institution name：新潟大学

  • プログラミング概論B

    2017
    Institution name：新潟大学

  • オペレーションズ・リサーチ

    2017
    Institution name：新潟大学

  • オペレーションズ・リサーチ実習

    2017
    Institution name：新潟大学

  • プログラミング概論A

    2017
    Institution name：新潟大学

  • 理学スタディ・スキルズ

    2017
    -
    2021
    Institution name：新潟大学

  • 総合力アクティブ・ラーニング

    2017
    Institution name：新潟大学

  • 最適化概論

    2016
    Institution name：新潟大学

  • 情報産業論

    2014
    Institution name：新潟大学

  • プログラミング演習

    2014
    -
    2016
    Institution name：新潟大学

  • プログラミング概論

    2014
    -
    2016
    Institution name：新潟大学

  • デジタル表現論

    2014
    Institution name：新潟大学

  • 数理科学文献詳読Ⅱ(数学)

    2013
    -
    2015
    Institution name：新潟大学

  • 数理科学セミナーⅡ(数学)

    2013
    -
    2015
    Institution name：新潟大学

  • 数理物質科学特定研究Ⅱ(数学)

    2013
    -
    2015
    Institution name：新潟大学

  • 計算機概論

    2013
    Institution name：新潟大学

  • 数理科学セミナーⅠ(数学)

    2012
    -
    2014
    Institution name：新潟大学

  • 数理物質科学特定研究Ⅰ(数学)

    2012
    -
    2014
    Institution name：新潟大学

  • 数理科学文献詳読Ⅰ(数学)

    2012
    -
    2014
    Institution name：新潟大学

  • 数理科学研究発表演習〔中間発表〕(数学)

    2012
    -
    2014
    Institution name：新潟大学

  • 数理科学研究発表演習〔外部発表〕(数学)

    2012
    -
    2014
    Institution name：新潟大学

  • リサーチキャンプ

    2012
    Institution name：新潟大学

  • 数理システム特論

    2012
    Institution name：新潟大学

  • 情報数理特別講義I

    2011
    -
    2012
    Institution name：新潟大学

  • 日本事情自然系A

    2009
    Institution name：新潟大学

  • 基礎ゼミVI

    2009
    Institution name：新潟大学

  • 数学講究

    2007
    Institution name：新潟大学

  • 最適化特論

    2007
    Institution name：新潟大学

  • 数学の世界

    2007
    -
    2021
    Institution name：新潟大学

  • 計算システム

    2007
    -
    2016
    Institution name：新潟大学

  • 計算システム実習

    2007
    -
    2016
    Institution name：新潟大学

  • 安全教育

    2007
    -
    2014
    Institution name：新潟大学

  • 数理システム概論

    2007
    -
    2014
    Institution name：新潟大学

  • 情報計画システムII

    2007
    -
    2013
    Institution name：新潟大学

  • 情報計画システムI

    2007
    -
    2013
    Institution name：新潟大学

  • 数値解析

    2007
    -
    2013
    Institution name：新潟大学

  • スタディ・スキルズ(数学学習法)

    2007
    -
    2009
    Institution name：新潟大学

  • 基礎ゼミI

    2007
    Institution name：新潟大学

▶ display all