| Publication | Date of Publication | Type |
|---|
Generalizations of doubly nonnegative cones and their comparison
Journal of the Operations Research Society of Japan | 2024-10-16 | Paper |
Keyword-level Bayesian online bid optimization for sponsored search advertising
SN Operations Research Forum | 2024-06-21 | Paper |
Approximation hierarchies for copositive cone over symmetric cone and their comparison
Journal of Global Optimization | 2024-04-05 | Paper |
Inverse-Optimization-Based Uncertainty Set for Robust Linear Optimization
| 2023-12-01 | Paper |
Cardinality-constrained distributionally robust portfolio optimization
European Journal of Operational Research | 2023-07-10 | Paper |
Guided particle swarm optimization method to solve general nonlinear optimization problems
Engineering Optimization | 2022-12-23 | Paper |
Generalizations of doubly nonnegative cones and their comparison
| 2022-04-26 | Paper |
A block coordinate descent method for sensor network localization
Optimization Letters | 2022-03-30 | Paper |
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
Journal of Global Optimization | 2021-09-29 | Paper |
A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
Journal of Industrial and Management Optimization | 2021-09-10 | Paper |
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
Journal of Global Optimization | 2019-05-09 | Paper |
BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY
Journal of the Operations Research Society of Japan | 2017-12-11 | Paper |
Latest Developments in the SDPA Family for Solving Large-Scale SDPs
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Fast implementation for semidefinite programs with positive matrix completion
Optimization Methods & Software | 2015-12-28 | Paper |
Numerical reduction method for doubly nonnegative optimization problems
Journal of Math-for-Industry | 2014-10-15 | Paper |
Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
ACM Transactions on Mathematical Software | 2014-09-12 | Paper |
Positive definite matrix approximation with condition number constraint
Optimization Letters | 2014-04-30 | Paper |
Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
| 2013-02-07 | Paper |
QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS
Journal of the Operations Research Society of Japan | 2008-11-10 | Paper |
SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION
Journal of the Operations Research Society of Japan | 2008-02-05 | Paper |
A conversion of an SDP having free variables into the standard form SDP
Computational Optimization and Applications | 2007-08-27 | Paper |
Preprocessing sparse semidefinite programs via matrix completion
Optimization Methods & Software | 2006-03-29 | Paper |
Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
Applied Numerical Mathematics | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1741299 (Why is no real title available?)
| 2002-05-15 | Paper |
Solving sparse semidefinite programs by matrix completion. I
RIMS Kokyuroku | 2001-09-23 | Paper |
Solving sparse semidefinite programs by matrix completion. II
RIMS Kokyuroku | 2001-09-23 | Paper |
Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
SIAM Journal on Optimization | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1568143 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1568141 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1489802 (Why is no real title available?)
| 2000-10-23 | Paper |
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
Mathematical Programming. Series A. Series B | 1998-06-02 | Paper |
