FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4238129251> ?p ?o ?g. }

• W4238129251 endingPage "772" @default.
• W4238129251 startingPage "767" @default.
• W4238129251 abstract "Free Access Some Computational Aspects of Optimization Singiresu S Rao, Singiresu S Rao University of Miami, Coral Gables, Florida, United StatesSearch for more papers by this author Book Author(s):Singiresu S Rao, Singiresu S Rao University of Miami, Coral Gables, Florida, United StatesSearch for more papers by this author First published: 22 October 2019 https://doi.org/10.1002/9781119454816.app2 AboutPDFPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShareShare a linkShare onFacebookTwitterLinked InRedditWechat References and Bibliography Moré, J.J., Garbow, B.S., and Hillstrom, K.E. (1981). Testing unconstrained optimization software. ACM Transactions on Mathematical Software 7 (1): 17– 41. Box, M.J. (1966). A comparison of several current optimization methods, and the use of transformations in constrained problems. Computer Journal 9 (1): 67– 77. Straeter, T.A. and Hogge, J.E. (1970). A comparison of gradient dependent techniques for the minimization of an unconstrained function of several variables. AIAA Journal 8 (12): 2226– 2229. Shanno, D.F. and Phua, K.H. (1978). Numerical comparison of several variable-metric algorithms. Journal of Optimization Theory and Applications 25 (4): 507– 518. Sargent, R.W.H. and Sebastian, D.J. (1972). Numerical experience with algorithms for unconstrained minimization. In: Numerical Methods for Nonlinear Optimization (ed. F.A. Lootsma), 45– 113. London: Academic Press. Colville, A.R. (1968). A Comparative Study of Nonlinear Programming Codes , Technical Report 320–2949. IBM New York Scientific Center, June. Eason, E.D. and Fenton, R.G. (1974). A comparison of numerical optimization methods for engineering design. Journal of Engineering for Industry 96 (1): 196– 200. Sandgren, E. and Ragsdell, K.M. (1980). The utility of nonlinear programming algorithms: a comparative study, parts I and II. Journal of Mechanical Design 102 (3): 540– 551. Schittkowski, K. (1980). Nonlinear Programming Codes: Information, Tests, Performance, Lecture Notes in Economics and Mathematical Systems, vol. 183. New York: Springer-Verlag. Sarma, P.V.L.N., Martens, X.M., Reklaitis, G.V., and Rijckaert, M.J. (1978). A comparison of computational strategies for geometric programs. Journal of Optimization Theory and Applications 26 (2): 185– 203. Fattler, J.E., Sin, Y.T., Root, R.R. et al. (1982). On the computational utility of posynomial geometric programming solution methods. Mathematical Programming 22: 163– 201. Dembo, R.S. (1978). The current state-of-the-art of algorithms and computer software for geometric programming. Journal of Optimization Theory and Applications 26: 149. Kuester, J.L. and Mize, J.H. (1973). Optimization Techniques with Fortran. New York: McGraw-Hill. Johnson, E.H. (1993). Tools for structural optimization. Chapter 29,. In: Structural Optimization: Status and Promise (ed. M.P. Kamat), 851– 863. Washington, DC: AIAA. Hörnlein, H.R.E.M. and Schittkowski, K. (1993). Software Systems for Structural Optimization. Basel: Birkhauser. Moré, J.J. and Wright, S.J. (1993). Optimization Software Guide. Philadelphia, PA: Society of Industrial and Applied Mathematics. Engineering Optimization Theory and Practice, Fifth Edition ReferencesRelatedInformation" @default.
• W4238129251 created "2022-05-12" @default.
• W4238129251 date "2019-10-22" @default.
• W4238129251 modified "2023-09-24" @default.
• W4238129251 title "Some Computational Aspects of Optimization" @default.
• W4238129251 cites W1981376511 @default.
• W4238129251 cites W2020237353 @default.
• W4238129251 cites W2021890679 @default.
• W4238129251 cites W2041016752 @default.
• W4238129251 cites W2056603712 @default.
• W4238129251 cites W2073235806 @default.
• W4238129251 cites W2075032833 @default.
• W4238129251 cites W2318609557 @default.
• W4238129251 cites W2476502391 @default.
• W4238129251 cites W3006716693 @default.
• W4238129251 cites W4241113036 @default.
• W4238129251 cites W4301681840 @default.
• W4238129251 doi "https://doi.org/10.1002/9781119454816.app2" @default.
• W4238129251 hasPublicationYear "2019" @default.
• W4238129251 type Work @default.
• W4238129251 citedByCount "0" @default.
• W4238129251 crossrefType "other" @default.
• W4238129251 hasBestOaLocation W42381292511 @default.
• W4238129251 hasConcept C11413529 @default.
• W4238129251 hasConcept C115527620 @default.
• W4238129251 hasConcept C121332964 @default.
• W4238129251 hasConcept C127313418 @default.
• W4238129251 hasConcept C127413603 @default.
• W4238129251 hasConcept C147764199 @default.
• W4238129251 hasConcept C158622935 @default.
• W4238129251 hasConcept C159390177 @default.
• W4238129251 hasConcept C161191863 @default.
• W4238129251 hasConcept C176217482 @default.
• W4238129251 hasConcept C199360897 @default.
• W4238129251 hasConcept C21547014 @default.
• W4238129251 hasConcept C2606647 @default.
• W4238129251 hasConcept C41008148 @default.
• W4238129251 hasConcept C62520636 @default.
• W4238129251 hasConceptScore W4238129251C11413529 @default.
• W4238129251 hasConceptScore W4238129251C115527620 @default.
• W4238129251 hasConceptScore W4238129251C121332964 @default.
• W4238129251 hasConceptScore W4238129251C127313418 @default.
• W4238129251 hasConceptScore W4238129251C127413603 @default.
• W4238129251 hasConceptScore W4238129251C147764199 @default.
• W4238129251 hasConceptScore W4238129251C158622935 @default.
• W4238129251 hasConceptScore W4238129251C159390177 @default.
• W4238129251 hasConceptScore W4238129251C161191863 @default.
• W4238129251 hasConceptScore W4238129251C176217482 @default.
• W4238129251 hasConceptScore W4238129251C199360897 @default.
• W4238129251 hasConceptScore W4238129251C21547014 @default.
• W4238129251 hasConceptScore W4238129251C2606647 @default.
• W4238129251 hasConceptScore W4238129251C41008148 @default.
• W4238129251 hasConceptScore W4238129251C62520636 @default.
• W4238129251 hasLocation W42381292511 @default.
• W4238129251 hasOpenAccess W4238129251 @default.
• W4238129251 hasPrimaryLocation W42381292511 @default.
• W4238129251 hasRelatedWork W1963792834 @default.
• W4238129251 hasRelatedWork W1994015885 @default.
• W4238129251 hasRelatedWork W1994670597 @default.
• W4238129251 hasRelatedWork W2047824136 @default.
• W4238129251 hasRelatedWork W228334917 @default.
• W4238129251 hasRelatedWork W2386767533 @default.
• W4238129251 hasRelatedWork W258285887 @default.
• W4238129251 hasRelatedWork W2800728502 @default.
• W4238129251 hasRelatedWork W4234764532 @default.
• W4238129251 hasRelatedWork W4246360927 @default.
• W4238129251 isParatext "false" @default.
• W4238129251 isRetracted "false" @default.
• W4238129251 workType "other" @default.