Akiko Yoshise

According to our database1, Akiko Yoshise
  • authored at least 21 papers between 1989 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
LP-based tractable subcones of the semidefinite plus nonnegative cone.
Annals OR, 2018

2016
Feature subset selection for logistic regression via mixed integer optimization.
Comp. Opt. and Appl., 2016

2013
Power Efficient Virtual Machine Packing for Green Datacenter.
IJNGC, 2013

2012
Progress in the Healthcare Service Innovation Project at the Tsukuba University Hospital.
Proceedings of the 2012 Annual SRII Global Conference, San Jose, CA, USA, July 24-27, 2012, 2012

Poster: Virtual Machine Packing Algorithms for Lower Power Consumption.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Abstract: Virtual Machine Packing Algorithms for Lower Power Consumption.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Virtual Machine packing algorithms for lower power consumption.
Proceedings of the 4th IEEE International Conference on Cloud Computing Technology and Science Proceedings, 2012

2010
On optimization over the doubly nonnegative cone.
Proceedings of the 2010 IEEE International Symposium on Computer-Aided Control System Design, 2010

2006
Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones.
SIAM Journal on Optimization, 2006

Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling.
IEICE Transactions, 2006

2005
Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2002
A Complexity Bound of a Predictor-Corrector Smoothing Method Using CHKS-Functions for Monotone LCP.
Comp. Opt. and Appl., 2002

2000
A Complexity Analysis of a Smoothing Method Using CHKS-functions for Monotone Linear Complementarity Problems.
Comp. Opt. and Appl., 2000

1999
Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems.
Math. Program., 1999

1997
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program., 1997

1994
Global convergence in infeasible-interior-point algorithms.
Math. Program., 1994

1993
A little theorem of the big Mu in interior point algorithms.
Math. Program., 1993

1991
An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems.
Math. Program., 1991

A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Lecture Notes in Computer Science 538, Springer, ISBN: 3-540-54509-3, 1991

1990
Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem.
Math. Program., 1990

1989
A polynomial-time algorithm for a class of linear complementarity problems.
Math. Program., 1989


  Loading...