Non-linear optimization with constraints: A cook-book approach

作者: L. O. Chua , G. N. Lin

DOI: 10.1002/CTA.4490110204

关键词:

摘要: Based on the stationary co-content theorem in non-linear circuit theory and penalty function approach programming theory, a canonical for simulating general problems with equality and/or inequality constraints has been developed. task of solving optimization problem reduces to that finding solution associated using simulation program, such as SPICE. A catalogue circuits is given each class problem. Using this catalogue, an engineer can solve by cook-book without learning any programming. Several examples are which demonstrate how SPICE be used, modification, linear problems, quadratic polynomial problems.

参考文章(6)
Charles S Beightler, Douglass J Wilde, Foundations of Optimization. ,(1967)
Elmor L. Peterson, Richard James Duffin, Clarence Zener, Geometric Programming : Theory and Application ,(1967)
L.O. Chua, Stationary principles and potential functions for nonlinear networks Journal of the Franklin Institute. ,vol. 296, pp. 91- 113 ,(1973) , 10.1016/0016-0032(73)90077-X
Leon O. Chua, Robin L. P. Ying, Finding all solutions of piecewise‐linear circuits International Journal of Circuit Theory and Applications. ,vol. 10, pp. 201- 229 ,(1982) , 10.1002/CTA.4490100303