메뉴 건너뛰기




Volumn , Issue , 2015, Pages 1-437

Optimization: Algorithms and applications

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85053094104     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b18469     Document Type: Book
Times cited : (143)

References (175)
  • 5
    • 0032021498 scopus 로고    scopus 로고
    • Survey of Numerical Methods for Trajectory Optimization
    • Betts, J.T. 1998. Survey of Numerical Methods for Trajectory Optimization. Guidance, Control and Dynamics 21(2):193–207.
    • (1998) Guidance, Control and Dynamics , vol.21 , Issue.2 , pp. 193-207
    • Betts, J.T.1
  • 7
    • 0002911326 scopus 로고
    • Programming of Interdependent Activities: II Mathematical Model
    • Dantzig, G.B. 1949. Programming of Interdependent Activities: II Mathematical Model. Econometrica 17(3):200–211.
    • (1949) Econometrica , vol.17 , Issue.3 , pp. 200-211
    • Dantzig, G.B.1
  • 8
    • 84929226302 scopus 로고
    • The Diet Problem
    • Dantzig, G.B. 1990. The Diet Problem. Interfaces 20(4):43–47.
    • (1990) Interfaces , vol.20 , Issue.4 , pp. 43-47
    • Dantzig, G.B.1
  • 11
    • 84958977914 scopus 로고
    • Outline of an Algorithm for Integer Solutions to Linear Programs
    • Gomory, R.E. 1958. Outline of an Algorithm for Integer Solutions to Linear Programs. Bulletin of American Society 64:275–278.
    • (1958) Bulletin of American Society , vol.64 , pp. 275-278
    • Gomory, R.E.1
  • 36
    • 0000478038 scopus 로고
    • Methode generale pour la resolution des systemes d’equations simultanees
    • Cauchy, A.L. 1847. Methode generale pour la resolution des systemes d’equations simultanees. Comptes Rendus de l’Académie des Sciences 25:536–538.
    • (1847) Comptes Rendus De l’Académie Des Sciences , vol.25 , pp. 536-538
    • Cauchy, A.L.1
  • 37
    • 85053091169 scopus 로고
    • A Comparative Study on Nonlinear Programming Codes, Report 320-2949, IBM. New York Scientific Centre
    • Colville, A.R. 1968. A Comparative Study on Nonlinear Programming Codes, Report 320-2949, IBM. New York Scientific Centre.
    • (1968)
    • Colville, A.R.1
  • 39
    • 0000387235 scopus 로고
    • A Rapidly Convergent Descent Method for Minimization
    • Fletcher, R., and Powell, M.J.D. 1963. A Rapidly Convergent Descent Method for Minimization. The Computer Journal 6:163–168.
    • (1963) The Computer Journal , vol.6 , pp. 163-168
    • Fletcher, R.1    Powell, M.J.D.2
  • 40
    • 0000615669 scopus 로고
    • Function Minimization by Conjugate Gradients
    • Fletcher, R., and Reeves, C.M. 1964. Function Minimization by Conjugate Gradients. The Computer Journal 7(2):149–154.
    • (1964) The Computer Journal , vol.7 , Issue.2 , pp. 149-154
    • Fletcher, R.1    Reeves, C.M.2
  • 41
    • 84932572426 scopus 로고
    • Numerical Solutions of Systems of Nonlinear Equations
    • Freudenstein, F., and Roth, B. 1963. Numerical Solutions of Systems of Nonlinear Equations. Journal of ACM 10(4):550–556.
    • (1963) Journal of ACM , vol.10 , Issue.4 , pp. 550-556
    • Freudenstein, F.1    Roth, B.2
  • 44
    • 0000873069 scopus 로고
    • A Method for the Solution of Certain Nonlinear Problems in Least Squares
    • Levenberg, K. 1944. A Method for the Solution of Certain Nonlinear Problems in Least Squares. Quarterly Applied Mathematics 2(2):164–168.
    • (1944) Quarterly Applied Mathematics , vol.2 , Issue.2 , pp. 164-168
    • Levenberg, K.1
  • 45
    • 0000169232 scopus 로고
    • An Algorithm for Least Squares Estimation of Nonlinear Parameters
    • Marquardt, D. 1963. An Algorithm for Least Squares Estimation of Nonlinear Parameters. SIAM Journal of Applied Mathematics 11(2):431–441.
    • (1963) SIAM Journal of Applied Mathematics , vol.11 , Issue.2 , pp. 431-441
    • Marquardt, D.1
  • 46
    • 0000238336 scopus 로고
    • A Simplex Method for Function Minimization
    • Nelder, J.A., and Mead, R. 1965. A Simplex Method for Function Minimization. Computer Journal 7(2):308–313.
    • (1965) Computer Journal , vol.7 , Issue.2 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 51
    • 0001723141 scopus 로고
    • An Automatic Method for Finding the Greatest or Least Value of a Function
    • Rosenbrock, H.H. 1960. An Automatic Method for Finding the Greatest or Least Value of a Function. The Computer Journal 3(3):175–184.
    • (1960) The Computer Journal , vol.3 , Issue.3 , pp. 175-184
    • Rosenbrock, H.H.1
  • 52
    • 84968497764 scopus 로고
    • Conditioning of Quasi-Newton Methods for Function Minimization
    • Shanno, D.F. 1970. Conditioning of Quasi-Newton Methods for Function Minimization. Mathematics of Computation 24:647–656.
    • (1970) Mathematics of Computation , vol.24 , pp. 647-656
    • Shanno, D.F.1
  • 54
    • 0022808141 scopus 로고
    • A Variation on Karmarkar’s Algorithm for Solving Linear Programming Problems
    • Barnes, E.R. 1986. A Variation on Karmarkar’s Algorithm for Solving Linear Programming Problems. Mathematical Programming 36:174–182.
    • (1986) Mathematical Programming , vol.36 , pp. 174-182
    • Barnes, E.R.1
  • 58
    • 51249181779 scopus 로고
    • A New Polyline-Time Algorithm for Linear Programming
    • Karmarkar, N. 1984. A New Polyline-Time Algorithm for Linear Programming, Combinatorica 4(4):373–395.
    • (1984) Combinatorica , vol.4 , Issue.4 , pp. 373-395
    • Karmarkar, N.1
  • 61
    • 33746951751 scopus 로고
    • A Modification of Karmarkar’s Linear Programming Problem
    • Vanderbei, R.J., Meketon, M.S., and Freedman, B.A. 1986. A Modification of Karmarkar’s Linear Programming Problem. Algorithmica 1:395–407.
    • (1986) Algorithmica , vol.1 , pp. 395-407
    • Vanderbei, R.J.1    Meketon, M.S.2    Freedman, B.A.3
  • 67
    • 0022865373 scopus 로고
    • Future Paths for Integer Programming and Links to Artificial Intelligence
    • Glover, F. 1986. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research 13:533–549.
    • (1986) Computers and Operations Research , vol.13 , pp. 533-549
    • Glover, F.1
  • 79
    • 0346009088 scopus 로고    scopus 로고
    • D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problems
    • Reimann, M., Doerner, K., and Hartl, R.F. 2004. D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problems. Computers & Operations Research 31(4):563–591.
    • (2004) Computers & Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 80
    • 25444462754 scopus 로고    scopus 로고
    • An Ant Colony Optimization Algorithm for the 2D and 3D Hydrophobic Polar Protein Folding Problem
    • Shmygelska, A., and Hoos, H.H. 2005. An Ant Colony Optimization Algorithm for the 2D and 3D Hydrophobic Polar Protein Folding Problem. BMC, Bioinformatics 6:30.
    • (2005) BMC, Bioinformatics , vol.6 , pp. 30
    • Shmygelska, A.1    Hoos, H.H.2
  • 81
    • 0001130234 scopus 로고    scopus 로고
    • A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming
    • Byrd, R.H., Gilbert, J.C., and Nocedal, J. 2000. A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming. Mathematical Programming 89(1):149–185.
    • (2000) Mathematical Programming , vol.89 , Issue.1 , pp. 149-185
    • Byrd, R.H.1    Gilbert, J.C.2    Nocedal, J.3
  • 82
    • 34250095268 scopus 로고
    • Approximate Solution of the Trust Region Problem by Minimization over Two-Dimensional Subspaces
    • Byrd, R.H., Schnabel, R.B., and Shultz, G.A. 1988. Approximate Solution of the Trust Region Problem by Minimization over Two-Dimensional Subspaces. Mathematical Programming 40(3):247–263.
    • (1988) Mathematical Programming , vol.40 , Issue.3 , pp. 247-263
    • Byrd, R.H.1    Schnabel, R.B.2    Shultz, G.A.3
  • 83
    • 0035479777 scopus 로고    scopus 로고
    • A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization
    • Coleman, T.F., and Verma, A. 2001. A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization. Computational Optimization and Applications 20(1):61–72.
    • (2001) Computational Optimization and Applications , vol.20 , Issue.1 , pp. 61-72
    • Coleman, T.F.1    Verma, A.2
  • 85
    • 34250293137 scopus 로고
    • A Globally Convergent Method for Nonlinear Programming
    • Han, S.P. 1977. A Globally Convergent Method for Nonlinear Programming. Journal of Optimization Theory and Applications 22(3):297–309.
    • (1977) Journal of Optimization Theory and Applications , vol.22 , Issue.3 , pp. 297-309
    • Han, S.P.1
  • 91
    • 0016986026 scopus 로고
    • Optimal Design of a Class of Welded Structures Using Geometric Programming
    • Ragsdell, K.M., and Philips, D.T. 1976. Optimal Design of a Class of Welded Structures Using Geometric Programming. ASME Journal of Engineering for Industries 98(3):1021–1025.
    • (1976) ASME Journal of Engineering for Industries , vol.98 , Issue.3 , pp. 1021-1025
    • Ragsdell, K.M.1    Philips, D.T.2
  • 94
    • 84868338380 scopus 로고
    • Nonlinear Integer and Discrete Programming in Mechanical Design Optimization
    • Sandgren, E. 1990. Nonlinear Integer and Discrete Programming in Mechanical Design Optimization. ASME Journal of Mechanical Design 112:223–229.
    • (1990) ASME Journal of Mechanical Design , vol.112 , pp. 223-229
    • Sandgren, E.1
  • 102
    • 0034199912 scopus 로고    scopus 로고
    • Approximating the Non-Dominated Front Using the Pareto Archived Evolution Strategy
    • Knowles, J.D., and Corne, D.W. 2000. Approximating the Non-Dominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation 8(2):149–172.
    • (2000) Evolutionary Computation , vol.8 , Issue.2 , pp. 149-172
    • Knowles, J.D.1    Corne, D.W.2
  • 107
    • 0034199979 scopus 로고    scopus 로고
    • Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
    • Zitzler, E., Deb, K., and Thiele, L. 2000. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2):173–195.
    • (2000) Evolutionary Computation , vol.8 , Issue.2 , pp. 173-195
    • Zitzler, E.1    Deb, K.2    Thiele, L.3
  • 108
    • 0037432482 scopus 로고    scopus 로고
    • Probabilistic Multi-Item Inventory Model with Varying Order Cost Under Two Restrictions: A Geometric Programming Approach
    • Abuo-El-Ata, M., Fergany, H., and El-Wakeel, M. 2003. Probabilistic Multi-Item Inventory Model with Varying Order Cost Under Two Restrictions: A Geometric Programming Approach. International Journal of Production Economics 83(3):223–231.
    • (2003) International Journal of Production Economics , vol.83 , Issue.3 , pp. 223-231
    • Abuo-El-ata, M.1    Fergany, H.2    El-Wakeel, M.3
  • 111
    • 0027111024 scopus 로고
    • Structural Optimization Using Single-Term Posynomial Geometric Programming
    • Chen, T.Y. 1992. Structural Optimization Using Single-Term Posynomial Geometric Programming. Computer and Structures 45(5):911–918.
    • (1992) Computer and Structures , vol.45 , Issue.5 , pp. 911-918
    • Chen, T.Y.1
  • 113
    • 0035567587 scopus 로고    scopus 로고
    • VLSI Circuit Performance Optimization by Geometric Programming
    • Chu, C., and Wong, D.F. 2001. VLSI Circuit Performance Optimization by Geometric Programming. Annals of Operations Research 105:37–60.
    • (2001) Annals of Operations Research , vol.105 , pp. 37-60
    • Chu, C.1    Wong, D.F.2
  • 114
    • 0035085274 scopus 로고    scopus 로고
    • Optimal Allocation of Local Feedback in Multistage Amplifiers via Geometric Programming
    • Dawson, J., Boyd, S., Hershenson, M., and Lee, T.H. 2001. Optimal Allocation of Local Feedback in Multistage Amplifiers via Geometric Programming. IEEE Transactions on Circuits and Systems 48(1):1–11.
    • (2001) IEEE Transactions on Circuits and Systems , vol.48 , Issue.1 , pp. 1-11
    • Dawson, J.1    Boyd, S.2    Hershenson, M.3    Lee, T.H.4
  • 115
    • 0344540555 scopus 로고
    • A Set of Geometric Programming Test Problems and Their Solutions
    • Dembo, R.S. 1976. A Set of Geometric Programming Test Problems and Their Solutions. Mathematical Programming 10:192–213.
    • (1976) Mathematical Programming , vol.10 , pp. 192-213
    • Dembo, R.S.1
  • 120
    • 0022753894 scopus 로고
    • Geometric Programming Strategies for Large Scale Structural Synthesis
    • Hajela, P. 1986. Geometric Programming Strategies for Large Scale Structural Synthesis. AIAA Journal 24(7):1173–1178.
    • (1986) AIAA Journal , vol.24 , Issue.7 , pp. 1173-1178
    • Hajela, P.1
  • 121
    • 84881419025 scopus 로고    scopus 로고
    • 53rd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, Hawaii. AIAA 2012-1680
    • Hoburg, W., and Abbeel, P. 2012. Geometric Programming for Aircraft Design Optimization. 53rd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, Hawaii. AIAA 2012-1680.
    • (2012) Geometric Programming for Aircraft Design Optimization
    • Hoburg, W.1    Abbeel, P.2
  • 122
    • 85053098803 scopus 로고
    • Avenues of Geometric Programming— Applications. NZOR 7-1
    • Jefferson, T.R., and Scott, C.H. 1979. Avenues of Geometric Programming— Applications. NZOR 7-1.
    • (1979)
    • Jefferson, T.R.1    Scott, C.H.2
  • 123
    • 84903375961 scopus 로고    scopus 로고
    • Posynomial Geometric Programming Problems with Multiple Parameters
    • Ojha, A.K., and Biswal, K.K. 2010. Posynomial Geometric Programming Problems with Multiple Parameters. Journal of Computing 2(1).
    • (2010) Journal of Computing , vol.2 , Issue.1
    • Ojha, A.K.1    Biswal, K.K.2
  • 131
    • 34347262420 scopus 로고    scopus 로고
    • Extended Collaboration Pursuing Method for Solving Larger Multidisciplinary Design Optimization Problems
    • Dapeng, W., Gary, W.G., and Naterer, G.F. 2007. Extended Collaboration Pursuing Method for Solving Larger Multidisciplinary Design Optimization Problems. AIAA Journal 45(6):1208–1221.
    • (2007) AIAA Journal , vol.45 , Issue.6 , pp. 1208-1221
    • Dapeng, W.1    Gary, W.G.2    Naterer, G.F.3
  • 133
    • 57649104678 scopus 로고    scopus 로고
    • Component-Oriented Decomposition for Multidisciplinary Design Optimization in Building Design
    • Geyer, P. 2009. Component-Oriented Decomposition for Multidisciplinary Design Optimization in Building Design. Advanced Engineering Informatics 23(1):12–31.
    • (2009) Advanced Engineering Informatics , vol.23 , Issue.1 , pp. 12-31
    • Geyer, P.1
  • 135
    • 27744449628 scopus 로고    scopus 로고
    • Multidisciplinary Optimization of Multi-Body Systems with Application to the Design of Rail Vehicles
    • He, Y., and McPhee, J. 2005. Multidisciplinary Optimization of Multi-Body Systems with Application to the Design of Rail Vehicles. Multi-Body System Dynamics 14(2):111–135.
    • (2005) Multi-Body System Dynamics , vol.14 , Issue.2 , pp. 111-135
    • He, Y.1    McPhee, J.2
  • 138
    • 0034246265 scopus 로고    scopus 로고
    • Bi-Level Integrated System Synthesis with Response Surfaces
    • Kodiyalam, S., and Sobieszczanski-Sobieski, J. 2000. Bi-Level Integrated System Synthesis with Response Surfaces. AIAA Journal 38(8):1479–1485.
    • (2000) AIAA Journal , vol.38 , Issue.8 , pp. 1479-1485
    • Kodiyalam, S.1    Sobieszczanski-Sobieski, J.2
  • 140
    • 63349095021 scopus 로고    scopus 로고
    • Wing Planform Design Optimization for Reusable Launch Vehicle
    • Manokaran, K., Vidya, G., and Sivaramakrishnan, A.E. 2009. Wing Planform Design Optimization for Reusable Launch Vehicle. Journal of Aircraft 46(2):726–730.
    • (2009) Journal of Aircraft , vol.46 , Issue.2 , pp. 726-730
    • Manokaran, K.1    Vidya, G.2    Sivaramakrishnan, A.E.3
  • 141
    • 84880847600 scopus 로고    scopus 로고
    • Multidisciplinary Design Optimization: A Survey of Architectures
    • Martins, J.R.R.A., and Lambe, A.B. 2013. Multidisciplinary Design Optimization: A Survey of Architectures. AIAA Journal 51(9):2049–2075.
    • (2013) AIAA Journal , vol.51 , Issue.9 , pp. 2049-2075
    • Martins, J.R.R.A.1    Lambe, A.B.2
  • 142
    • 0037363742 scopus 로고    scopus 로고
    • Multidisciplinary Robust Design Optimization of an Internal Combustion Engine
    • McAllister, C.D., and Simpson, T.W. 2003. Multidisciplinary Robust Design Optimization of an Internal Combustion Engine. Journal of Mechanical Design 125(1):124–130.
    • (2003) Journal of Mechanical Design , vol.125 , Issue.1 , pp. 124-130
    • McAllister, C.D.1    Simpson, T.W.2
  • 146
    • 77949422782 scopus 로고    scopus 로고
    • Benchmarking Multidisciplinary Design Optimization Algorithms
    • Tedford, N.P., and Martins, J.R.R.A. 2010. Benchmarking Multidisciplinary Design Optimization Algorithms. Optimization and Engineering 11:159–183.
    • (2010) Optimization and Engineering , vol.11 , pp. 159-183
    • Tedford, N.P.1    Martins, J.R.R.A.2
  • 149
    • 33746132731 scopus 로고    scopus 로고
    • Multi-Objective and Multi-Disciplinary Design Optimization of Supersonic Fighter Wing
    • Yushin Kim, Yong-Hee Jeon, and Dong-Ho Lee. 2006. Multi-Objective and Multi-Disciplinary Design Optimization of Supersonic Fighter Wing. Journal of Aircraft 43(3):817–824.
    • (2006) Journal of Aircraft , vol.43 , Issue.3 , pp. 817-824
    • Kim, Y.1    Jeon, Y.-H.2    Lee, D.-H.3
  • 150
    • 0001488483 scopus 로고
    • An Additive Algorithm for Solving Linear Programs with Zero-One Variables
    • Balas, E. 1965. An Additive Algorithm for Solving Linear Programs with Zero-One Variables. Operations Research 13(4):517–546.
    • (1965) Operations Research , vol.13 , Issue.4 , pp. 517-546
    • Balas, E.1
  • 152
    • 0000000310 scopus 로고
    • A Tree-Search Algorithm for Mixed-Integer Programming Problems
    • Dakin, R.J. 1965. A Tree-Search Algorithm for Mixed-Integer Programming Problems. Computer Journal 8(3):250–255.
    • (1965) Computer Journal , vol.8 , Issue.3 , pp. 250-255
    • Dakin, R.J.1
  • 155
    • 0008904734 scopus 로고
    • Integer Programming and Pricing
    • Gomory, R.E., and Baumol, W.J. 1960. Integer Programming and Pricing. Econometrica 28(3):521–550.
    • (1960) Econometrica , vol.28 , Issue.3 , pp. 521-550
    • Gomory, R.E.1    Baumol, W.J.2
  • 157
    • 0001173632 scopus 로고
    • An Automatic Method for Solving Discrete Programming Problems
    • Land, A.H., and Doig, A. 1960. An Automatic Method for Solving Discrete Programming Problems. Econometrica 28:497–520.
    • (1960) Econometrica , vol.28 , pp. 497-520
    • Land, A.H.1    Doig, A.2
  • 162
    • 85012688561 scopus 로고
    • Princeton, NJ: Princeton University Press
    • Bellman, R.E. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
    • (1957) Dynamic Programming
    • Bellman, R.E.1
  • 165
    • 85053100744 scopus 로고    scopus 로고
    • Modern Computational Applications of Dynamic Programming
    • Dreyfus, S. 2010. Modern Computational Applications of Dynamic Programming. Journal of Industrial and Systems Engineering 4(3):152–155.
    • (2010) Journal of Industrial and Systems Engineering , vol.4 , Issue.3 , pp. 152-155
    • Dreyfus, S.1
  • 166
    • 0004426569 scopus 로고
    • Dynamic Programming Application in Finance
    • Edwin, J.E., and Gruber, M.J. 1971. Dynamic Programming Application in Finance. The Journal of Finance 26(2):473–506.
    • (1971) The Journal of Finance , vol.26 , Issue.2 , pp. 473-506
    • Edwin, J.E.1    Gruber, M.J.2
  • 167
    • 85003264257 scopus 로고
    • Nuclear Rocket Thrust Optimization using Dynamic Programming
    • George, R.E. 1963. Nuclear Rocket Thrust Optimization using Dynamic Programming. AIAA Journal 1(5):1159–1166.
    • (1963) AIAA Journal , vol.1 , Issue.5 , pp. 1159-1166
    • George, R.E.1
  • 171
    • 0014781116 scopus 로고
    • Optimization of Interplanetary Orbit Transfers by Dynamic Programming
    • Leondes, C.T., and Smith, F.T. 1970. Optimization of Interplanetary Orbit Transfers by Dynamic Programming. Journal of Spacecraft and Rockets 7(5):558–564.
    • (1970) Journal of Spacecraft and Rockets , vol.7 , Issue.5 , pp. 558-564
    • Leondes, C.T.1    Smith, F.T.2


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