Hayato Waki

According to our database1, Hayato Waki authored at least 25 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Perturbation Analysis of Singular Semidefinite Programs and Its Applications to Control Problems.
J. Optim. Theory Appl., 2021

Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction.
Math. Control. Signals Syst., 2020

On Gain-Scheduled State-Feedback Controller Synthesis With Quadratic Stability Condition.
IEEE Control. Syst. Lett., 2020

Application of facial reduction to H ∞ state feedback control problem.
Int. J. Control, 2019

Positive Definiteness in Linear Matrix Inequality Problem for H-Infinity Output Feedback Control Problem.
IEEE Control. Syst. Lett., 2019

Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program.
Optim. Methods Softw., 2018

Application of mixed integer quadratic program to shortest vector problems.
JSIAM Lett., 2017

Reduction of H∞ state feedback control problems for the servo systems.
Proceedings of the 11th Asian Control Conference, 2017

A Mixed Integer Quadratic Formulation for the Shortest Vector Problem.
Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

Perturbed sums-of-squares theorem for polynomial optimization and its applications.
Optim. Methods Softw., 2016

Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls.
CoRR, 2016

Mixed Integer Nonlinear Program for Minimization of Akaike's Information Criterion.
Proceedings of the Mathematical Software - ICMS 2016, 2016

Reduction of SDPs in H∞ control of SISO systems and performance limitations analysis.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

H∞ performance limitations analysis for SISO systems: A dual LMI approach.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

Petascale General Solver for Semidefinite Programming Problems with Over Two Million Constraints.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Facial Reduction Algorithms for Conic Optimization Problems.
J. Optim. Theory Appl., 2013

Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems.
ACM Trans. Math. Softw., 2012

How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization.
Optim. Lett., 2012

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization.
Comput. Optim. Appl., 2012

A facial reduction algorithm for finding sparse SOS representations.
Oper. Res. Lett., 2010

Exploiting Sparsity in SDP Relaxation for Sensor Network Localization.
SIAM J. Optim., 2009

Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.
ACM Trans. Math. Softw., 2008

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity.
SIAM J. Optim., 2006

Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems.
SIAM J. Optim., 2005

Sparsity in sums of squares of polynomials.
Math. Program., 2005