메뉴 건너뛰기




Volumn 26, Issue 9, 1979, Pages 784-794

A New Algorithm for Statistical Circuit Design Based on Quasi-Newton Methods and Function Splitting

Author keywords

[No Author keywords available]

Indexed keywords

TOLERANCE OPTIMIZATION;

EID: 0018522163     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1979.1084701     Document Type: Article
Times cited : (190)

References (9)
  • 1
    • 84921099989 scopus 로고    scopus 로고
    • Algorithms for worst case tolerance optimization
    • Numerisk Institute, Danmarks Tekniske Hojskole, Lyngby, Danmark Rep. No. NI-78-05, 1978; also “New Algorithms for Worst-Case Tolerance Optimization”(New York) pp.
    • K. Madsen and H. Schjaer-Jacobsen, “Algorithms for worst case tolerance optimization,” Numerisk Institute, Danmarks Tekniske Hojskole, Lyngby, Danmark Rep. No. NI-78-05, 1978; also “New Algorithms for Worst-Case Tolerance Optimization”, Proc. IEEE Inter. Symp. Circuits Syst. (New York) pp. 681–685.
    • Proc. IEEE Inter. Symp. Circuits Syst , pp. 681-685
    • Madsen, K.1    Schjaer-Jacobsen, H.2
  • 2
    • 0013467366 scopus 로고
    • An algorithm for minimax solution of overdetermined systems of nonlinear equations
    • K. Madsen, “An algorithm for minimax solution of overdetermined systems of nonlinear equations,” J. Inst Maths. Applics., vol. 16, pp. 321–328, 1975.
    • (1975) J. Inst Maths. Applics. , vol.16 , pp. 321-328
    • Madsen, K.1
  • 3
    • 0016980563 scopus 로고
    • Singularities in minimax optimization of networks
    • K. Madsen and H. Schjaer-Jacobsen, “Singularities in minimax optimization of networks,” IEEE Trans. Circuits Syst., vol. CAS-23, pp: 456–460, 1976.
    • (1976) IEEE Trans. Circuits Syst. , vol.CAS-23 , pp. 456-460
    • Madsen, K.1    Schjaer-Jacobsen, H.2
  • 4
    • 0001859637 scopus 로고
    • Constrained minimization using recursive quadratic programming: Some alternative subproblem formulations
    • L. C. W. Dixon and G. P. Szego, Eds. North Holland
    • M. C. Biggs, “Constrained minimization using recursive quadratic programming: Some alternative subproblem formulations,” in Towards Global Optimization, L. C. W. Dixon and G. P. Szego, Eds. North Holland, 1975.
    • (1975) Towards Global Optimization
    • Biggs, M.C.1
  • 5
    • 0000373474 scopus 로고
    • Super linearly convergent variable metric algorithms for general nonlinear programming problems
    • S. P. Han, “Super linearly convergent variable metric algorithms for general nonlinear programming problems,” Mathematical Programming, vol. 11, pp. 263–282, 1967.
    • (1967) Mathematical Programming , vol.11 , pp. 263-282
    • Han, S.P.1
  • 6
    • 0002336269 scopus 로고
    • The convergence of variable metric methods for nonlinearly constrained optimization calculations
    • Madison, WI
    • M. J. D. Powell, “The convergence of variable metric methods for nonlinearly constrained optimization calculations,” in Nonlinear Programming 3, Madison, WI, 1977.
    • (1977) Nonlinear Programming , vol.3
    • Powell, M.J.D.1
  • 7
    • 84938002570 scopus 로고
    • A fast algorithm for nonlinearly constrained optimization calculations
    • A. Dold and 11. Eckmann, Eds., (Lecture Notes in Mathematics). New York. Springer-Verlag
    • ――, “A fast algorithm for nonlinearly constrained optimization calculations,” in Proc. Dundee Conf. Numerical Analysis. A. Dold and 11. Eckmann, Eds., (Lecture Notes in Mathematics). New York. Springer-Verlag, 1977, p. 630.
    • (1977) Proc. Dundee Conf. Numerical Analysis , pp. 630
    • Powell, M.J.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.