| l(2) induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks | 0 | 0.34 | 2021 |
| Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. | 0 | 0.34 | 2021 |
| Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction | 0 | 0.34 | 2020 |
| On Gain-Scheduled State-Feedback Controller Synthesis With Quadratic Stability Condition. | 0 | 0.34 | 2020 |
| Application of facial reduction to H ∞ state feedback control problem. | 0 | 0.34 | 2019 |
| Positive Definiteness in Linear Matrix Inequality Problem for $H$ -Infinity Output Feedback Control Problem. | 0 | 0.34 | 2019 |
| Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program. | 2 | 0.41 | 2018 |
| Application of mixed integer quadratic program to shortest vector problems | 0 | 0.34 | 2017 |
| Reduction Of Sdps In H-Infinity Control Of Siso Systems And Performance Limitations Analysis | 0 | 0.34 | 2016 |
| Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls. | 0 | 0.34 | 2016 |
| Perturbed sums-of-squares theorem for polynomial optimization and its applications. | 0 | 0.34 | 2016 |
| Mixed Integer Nonlinear Program for Minimization of Akaike's Information Criterion. | 0 | 0.34 | 2016 |
| Facial Reduction Algorithms for Conic Optimization Problems. | 14 | 0.80 | 2013 |
| Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems | 11 | 0.61 | 2012 |
| How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization. | 8 | 0.54 | 2012 |
| Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization | 10 | 0.75 | 2012 |
| A facial reduction algorithm for finding sparse SOS representations | 8 | 0.58 | 2010 |
| Exploiting Sparsity in SDP Relaxation for Sensor Network Localization | 39 | 1.36 | 2009 |
| Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems | 62 | 4.00 | 2008 |
| A 146-mm/sup 2/ 8-gb multi-level NAND flash memory with 70-nm CMOS technology | 9 | 2.72 | 2006 |
| Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity | 149 | 7.10 | 2006 |
| Sparsity in sums of squares of polynomials | 40 | 3.79 | 2005 |
| Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems | 24 | 2.45 | 2005 |
