scispace - formally typeset
N

Nobuo Sannomiya

Researcher at Kyoto University

Publications -  30
Citations -  351

Nobuo Sannomiya is an academic researcher from Kyoto University. The author has contributed to research in topics: Linear programming & Nonlinear system. The author has an hindex of 5, co-authored 30 publications receiving 344 citations.

Papers
More filters
Journal ArticleDOI

Paper: A method for auto-tuning of PID control parameters

TL;DR: A method for automatic tuning of the PID process control parameters, usually called 'auto-tuning', is developed, and is implemented on a digital controller using microprocessors and applied to some real processes, yielding satisfactory results.
Journal ArticleDOI

A method for suboptimal design of nonlinear feedback systems

TL;DR: In this article, an approximation method is presented to construct an optimal state regulator for a nonlinear system with quadratic performance index, where the nonlinearity is taken to be a perturbation to the system, and a parameter @e is introduced to stand for it.
Journal ArticleDOI

A Method for Auto-Tuning of PID Control Parameters

TL;DR: A new type of performance index, i.e., a weighted integral of squared error is introduced and is implemented on a small size digital controller and applied to some real processes, yielding satisfactory results.
Journal ArticleDOI

A method for decomposing mixed-integer linear programming problems with angular structure

TL;DR: In this paper, an algorithm for solving mixed-integer linear programming problems with an angular structure has been proposed, where the problem cannot be relaxed simultaneously relative to all the coupling constraints, and the decomposition procedure consists of first relaxing the problem relative to the coupling constraint for the integer variables, and then decomposing it with respect to the continuous variables.
Journal ArticleDOI

A method for decomposing mixed-integer linear programs with staircase structure

TL;DR: In this paper, a branch-and-bound algorithm for solving mixed-integer linear programs with a staircase structure is presented, where the feasibility of the solution is always assured, but the optimality condition is checked restrictedly for the solution obtained.