2008
DOI: 10.1093/ietfec/e91-a.9.2426
|View full text |Cite
|
Sign up to set email alerts
|

Sensitivity Analysis and Optimization Algorithm --- Based on Nonlinear Programming ---

Abstract: Masayoshi ODA †a) , Nonmember, Yoshihiro YAMAGAMI †b) , Junji KAWATA † †c) , Yoshifumi NISHIO †d) , Members, and Akio USHIDA † †e) , Fellow SUMMARY We propose here a fully Spice-oriented design algorithm of op-amps for attaining the maximum gains under low power consumptions and assigned slew-rates. Our optimization algorithm is based on a well-known steepest descent method combining with nonlinear programming. The algorithm is realized by equivalent RC circuits with ABMs (analog behavior models) of Spice. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
1
0
Order By: Relevance
“…In addition to the above-mentioned work, various recurrent neural network models for optimization problems have been investigated in the literature (see e.g., [11,12] and references therein). Also, some authors proposed to use SPICE, the most widely used circuit simulator, for solving constrained optimization problems [13][14][15] Recently, Sato et al [16] proposed a class of nonlinear circuits 1 for solving maximum flow problems. A maximum flow problem is the problem to find the maximum amount of flow from the source to the sink through capacitated edges in a given network.…”
Section: Introductionmentioning
confidence: 99%
“…In addition to the above-mentioned work, various recurrent neural network models for optimization problems have been investigated in the literature (see e.g., [11,12] and references therein). Also, some authors proposed to use SPICE, the most widely used circuit simulator, for solving constrained optimization problems [13][14][15] Recently, Sato et al [16] proposed a class of nonlinear circuits 1 for solving maximum flow problems. A maximum flow problem is the problem to find the maximum amount of flow from the source to the sink through capacitated edges in a given network.…”
Section: Introductionmentioning
confidence: 99%
“…На додаток до вищезгаданої роботи, у літературі досліджувалися різні моделі рекурентних нейронних мереж для задач оптимізації (див., наприклад, [11,12]). Крім того, деякі автори пропонували використовувати SPICE, що найбільш широко використовується симулятор схем, для вирішення завдань оптимізації з обмеженнями [13][14][15].…”
unclassified