메뉴 건너뛰기




Volumn 11, Issue 3-4, 1996, Pages 187-194

Norm-relaxed method of feasible directions: Application in structural optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; FINITE ELEMENT METHOD; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; STRUCTURAL ANALYSIS;

EID: 0030166155     PISSN: 09344373     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01197034     Document Type: Article
Times cited : (6)

References (17)
  • 2
    • 0010825922 scopus 로고
    • Formal and heuristic system decomposition methods in multidisciplinary synthesis
    • Bloebaum, C.L. 1991: Formal and heuristic system decomposition methods in multidisciplinary synthesis. NASA CR4413
    • (1991) NASA CR4413
    • Bloebaum, C.L.1
  • 3
    • 0028540063 scopus 로고
    • Norm-relaxed method of feasible directions for solving nonlinear programming problems
    • Cawood, M.E.; Kostreva, M.M. 1994: Norm-relaxed method of feasible directions for solving nonlinear programming problems. J. Optimiz. Theory Appl. 83, 311-320
    • (1994) J. Optimiz. Theory Appl. , vol.83 , pp. 311-320
    • Cawood, M.E.1    Kostreva, M.M.2
  • 4
    • 0000968422 scopus 로고
    • Two-point exponential approximation method for structural optimization
    • Fadel, G.M.; Riley, M.F.; Barthelemy, J.M. 1990: Two-point exponential approximation method for structural optimization. Struct. Optim. 2, 117-124
    • (1990) Struct. Optim. , vol.2 , pp. 117-124
    • Fadel, G.M.1    Riley, M.F.2    Barthelemy, J.M.3
  • 7
    • 9444243178 scopus 로고
    • Convergence analysis of normrelaxed method of feasible directions
    • Department of Mathematical Sciences, Clemson University
    • Korycki, J.; Kostreva, M.M. 1994: Convergence analysis of normrelaxed method of feasible directions. Technical Report # 636, Department of Mathematical Sciences, Clemson University
    • (1994) Technical Report # 636
    • Korycki, J.1    Kostreva, M.M.2
  • 9
    • 0002110483 scopus 로고
    • Generalization of Murty's direct algorithm to linear and convex quadratic programming
    • Kostreva, M.M. 1989: Generalization of Murty's direct algorithm to linear and convex quadratic programming. J. Optimiz. Theory Appl. 62, 63-76
    • (1989) J. Optimiz. Theory Appl. , vol.62 , pp. 63-76
    • Kostreva, M.M.1
  • 10
    • 0020632946 scopus 로고
    • An efficient method of feasible directions
    • Meyer, G.L. 1983: An efficient method of feasible directions. SIAM J. Control & Optimiz. 21, 153-162
    • (1983) SIAM J. Control & Optimiz. , vol.21 , pp. 153-162
    • Meyer, G.L.1
  • 11
    • 0002364867 scopus 로고
    • Rate of convergence of a class of methods of feasible directions
    • Pironneau, O.; Polak, E. 1973: Rate of convergence of a class of methods of feasible directions. SIAM J. Num. Anal. 10, 161-173
    • (1973) SIAM J. Num. Anal. , vol.10 , pp. 161-173
    • Pironneau, O.1    Polak, E.2
  • 13
    • 0002207938 scopus 로고
    • A fast algorithm for nonlinearly constrained calculations
    • Berlin, Heidelberg, New York: Springer
    • Powell, M.J.D. 1977: A fast algorithm for nonlinearly constrained calculations. Numerical Analysis, Lecture Notes in Mathematics 630. Berlin, Heidelberg, New York: Springer
    • (1977) Numerical Analysis, Lecture Notes in Mathematics , vol.630
    • Powell, M.J.D.1
  • 15
    • 0001555742 scopus 로고
    • On the convergence of some feasible direction algorithms for nonlinear programming
    • Topkis, D.M.; Veinott, A.F. 1967: On the convergence of some feasible direction algorithms for nonlinear programming. SIAM J. Control 5, 268-279
    • (1967) SIAM J. Control , vol.5 , pp. 268-279
    • Topkis, D.M.1    Veinott, A.F.2


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