乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:02:04Z","timestamp":1725570124032},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642172977"},{"type":"electronic","value":"9783642172984"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17298-4_3","type":"book-chapter","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T10:06:28Z","timestamp":1290420388000},"page":"35-44","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel Algorithm for Solving Large Convex Minimax Problems"],"prefix":"10.1007","author":[{"given":"Ramnik","family":"Arora","sequence":"first","affiliation":[]},{"given":"Utkarsh","family":"Upadhyay","sequence":"additional","affiliation":[]},{"given":"Rupesh","family":"Tulshyan","sequence":"additional","affiliation":[]},{"given":"J.","family":"Dutta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1011211101714","volume":"20","author":"S. Xu","year":"2001","unstructured":"Xu, S.: Smoothing Method for Minimax Problems. Computational Optimization and Applications\u00a020, 267\u2013279 (2001)","journal-title":"Computational Optimization and Applications"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10957-008-9473-4","volume":"141","author":"P. Parpas","year":"2009","unstructured":"Parpas, P., Rustem, B.: An Algorithm for the Global Optimization of a Class of Continuous Minimax Problems. Journal of Optimization Theory and Applications\u00a0141, 461\u2013473 (2009)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01580609","volume":"60","author":"G.D. Pillo","year":"1993","unstructured":"Pillo, G.D., Grippo, L., Lucidi, S.: A Smooth Method for the Finite Minimax Problem. Math. Program.\u00a060, 187\u2013214 (1993)","journal-title":"Math. Program."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10957-007-9290-1","volume":"136","author":"B. Rustem","year":"2008","unstructured":"Rustem, B., Zakovic, S., Parpas, P.: An Interior Point Algorithm for Continuous Minimax. Journal of Optimization Theory and Applications\u00a0136, 87\u2013103 (2008)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10957-008-9355-9","volume":"138","author":"E. Polak","year":"2008","unstructured":"Polak, E., Womersley, R.S., Yin, H.X.: An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems. Journal of Optimization Theory and Applications\u00a0138, 311\u2013328 (2008)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.amc.2003.07.008","volume":"156","author":"W. Sun","year":"2004","unstructured":"Sun, W.: Non-Monotone Trust Region Method for Solving Optimization Problem. Applied Mathematics and Computation\u00a0156, 159\u2013174 (2004)","journal-title":"Applied Mathematics and Computation"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1137\/0715011","volume":"15","author":"C. Charalamous","year":"1978","unstructured":"Charalamous, C., Conn, A.: An Efficient Method to Solve the Minimax Problem Directly. SIAM J. Numer. Anal.\u00a015, 162\u2013187 (1978)","journal-title":"SIAM J. Numer. Anal."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/0898-1221(85)90104-X","volume":"11","author":"R. Chen","year":"1985","unstructured":"Chen, R.: Solution of Minimax Problem using Equivalent Differentiable Functions. Comp. and Maths. with Appls.\u00a011, 1165\u20131169 (1985)","journal-title":"Comp. and Maths. with Appls."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BF01583790","volume":"23","author":"M. Gaudioso","year":"1982","unstructured":"Gaudioso, M., Monaco, M.F.: A Bundle Type Approach to the Unconstrained Minimization of Convex Non-Smooth Functions. Mathematical Programming\u00a023, 216\u2013226 (1982)","journal-title":"Mathematical Programming"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.aml.2008.06.017","volume":"22","author":"Z. Zhua","year":"2009","unstructured":"Zhua, Z., Cai, X., Jian, J.: An Improved SQP Algorithm for Solving Minimax Problems. Applied Mathematical Letters\u00a022, 464\u2013469 (2009)","journal-title":"Applied Mathematical Letters"},{"key":"3_CR11","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals","author":"J.B. Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Springer, Heidelberg (1996)"},{"doi-asserted-by":"crossref","unstructured":"Vardi, A.: New Minimax Algorithm. Journal of Optimization Theory and Applications (1992)","key":"3_CR12","DOI":"10.1007\/BF00940496"},{"doi-asserted-by":"crossref","unstructured":"Wang, F., Zhang, K.: A Hybrid Algorithm for Nonlinear Minimax Problems. Annals of Operation Research (2008)","key":"3_CR13","DOI":"10.1007\/s10479-008-0401-7"},{"key":"3_CR14","volume-title":"Genetic Algorithms for Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms for Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1162\/106365602760972767","volume":"10","author":"K. Deb","year":"2002","unstructured":"Deb, K., et al.: A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization. Evol. Comput.\u00a010(4), 371\u2013395 (2002)","journal-title":"Evol. Comput."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N. Hansen","year":"2003","unstructured":"Hansen, N., Muller, S., Koumoutsakos, P.: Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). Evolutionary Computation\u00a011(1), 1\u201318 (2003)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17298-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T05:56:41Z","timestamp":1553234201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17298-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642172977","9783642172984"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17298-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}