Shunsuke Hayashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shunsuke Hayashi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ailing Zhang1 shared publication
- Masao Fukushima
The Kyoto College of Graduate Studies for Informatics, Kyoto, Japan
1 shared publication - Masao Fukushima
Kyoto University
1 shared publication - Ryoichi Nishimura
Kyoto University
1 shared publication - Ryoichi Nishimura
Kyoto University
1 shared publication
Latest Publications
- 1 December 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 55 (1) , 21-47
SDP reformulation for robust optimization problems based on nonconvex QP duality
- 1 December 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 55 (1) , 21-47
SDP reformulation for robust optimization problems based on nonconvex QP duality
- 19 April 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 53 (1) , 107-120
Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- 19 April 2011
- Published by Springer Nature in Journal of Global Optimization
- Vol. 53 (1) , 107-120
Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- Open Access
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 1 (1) , 83-98
Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
In this paper, we focus on fractional programming problems that minimize the ratio of two indefinite quadratic functions subject to two quadratic constraints. Utilizing the relationship between fractional programming and parametric programming, we transform the original problem into a univariate nonlinear equation. To evaluate the function in the equation, we need to solve a problem of minimizing a nonconvex quadratic function subject to two quadratic constraints. This problem is commonly called a Celis-Dennis-Tapia (CDT) subproblem, which arises in some trust region algorithms for equality constrained optimization. In the outer iterations of the algorithm, we employ the bisection method and/or the generalized Newton method. In the inner iterations, we utilize Yuan's theorem to obtain the global optima of the CDT subproblems. We also show some numerical results to examine the efficiency of the algorithm. Particularly, we will observe that the generalized Newton method is more robust to the erroneous evaluation for the univariate functions than the bisection method.
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Numerical Algebra, Control & Optimization
- Vol. 1 (1) , 83-98
Open AccessCelis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
In this paper, we focus on fractional programming problems that minimize the ratio of two indefinite quadratic functions subject to two quadratic constraints. Utilizing the relationship between fractional programming and parametric programming, we transform the original problem into a univariate nonlinear equation. To evaluate the function in the equation, we need to solve a problem of minimizing a nonconvex quadratic function subject to two quadratic constraints. This problem is commonly called a Celis-Dennis-Tapia (CDT) subproblem, which arises in some trust region algorithms for equality constrained optimization. In the outer iterations of the algorithm, we employ the bisection method and/or the generalized Newton method. In the inner iterations, we utilize Yuan's theorem to obtain the global optima of the CDT subproblems. We also show some numerical results to examine the efficiency of the algorithm. Particularly, we will observe that the generalized Newton method is more robust to the erroneous evaluation for the univariate functions than the bisection method.