{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:07:02Z","timestamp":1761919622691,"version":"3.40.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T00:00:00Z","timestamp":1348531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10898-012-9981-5","type":"journal-article","created":{"date-parts":[[2012,9,24]],"date-time":"2012-09-24T09:05:09Z","timestamp":1348477509000},"page":"891-933","source":"Crossref","is-referenced-by-count":6,"title":["Solving dual problems using a coevolutionary optimization algorithm"],"prefix":"10.1007","volume":"57","author":[{"given":"Kalyanmoy","family":"Deb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivam","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhoomija","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,25]]},"reference":[{"issue":"2","key":"9981_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10957-007-9335-5","volume":"137","author":"A. Bagirov","year":"2008","unstructured":"Bagirov A., Karasozen B., Sezer M.: Discrete gradient method: derivative-free method for nonsmooth optimization. J. Optim. Theory Appl. 137(2), 317\u2013334 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"9981_CR2","unstructured":"Barbosa, H.J.C.: A genetic algorithm for min-max problems. In: Proceedings of the First International Conference on Evolutionary Computation and Its Application (EvCA\u201996), pp. 99\u2013109 (1996)"},{"key":"9981_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa, H.J.C.: A coevolutionary genetic algorithm for constraint optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC-99), pp. 1605\u20131611 (1999)","DOI":"10.1109\/CEC.1999.785466"},{"key":"9981_CR4","volume-title":"Nonlinear programming: Theory and algorithms","author":"M.S. Bazaraa","year":"2004","unstructured":"Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear programming: Theory and algorithms. Wiley, Singapore (2004)"},{"key":"9981_CR5","volume-title":"Applied Mathematical Programming","author":"S. Bradley","year":"1977","unstructured":"Bradley S., Hax A., Magnanti T.: Applied Mathematical Programming. Addison-Wesley, Reading (1977)"},{"key":"9981_CR6","doi-asserted-by":"crossref","unstructured":"Branke, J., Rosenbusch, J.: New approaches to coevolutionary worst-case optimization. In: Proceedings of the Parallel Problem Solving from Nature Conference (PPSN-X), (LNCS 5199), pp. 144\u2013153 (2008)","DOI":"10.1007\/978-3-540-87700-4_15"},{"key":"9981_CR7","volume-title":"Optimization for Engineering Design: Algorithms and Examples","author":"K. Deb","year":"1995","unstructured":"Deb K.: Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall, New Delhi (1995)"},{"key":"9981_CR8","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K. Deb","year":"2001","unstructured":"Deb K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"issue":"2","key":"9981_CR9","first-page":"115","volume":"9","author":"K. Deb","year":"1995","unstructured":"Deb K., Agrawal R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115\u2013148 (1995)","journal-title":"Complex Syst."},{"key":"9981_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Datta, R.: A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach. In: Proceedings of the IEEE World Congress on Computational Intelligence (WCCI-2010), pp. 165\u2013172 (2010)","DOI":"10.1109\/CEC.2010.5586543"},{"issue":"4","key":"9981_CR11","first-page":"333","volume":"6","author":"D.E. Goldberg","year":"1992","unstructured":"Goldberg D.E., Deb K., Clark J. H.: Genetic algorithms, noise, and the sizing of populations. Complex Syst. 6(4), 333\u2013362 (1992)","journal-title":"Complex Syst."},{"key":"9981_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D. Goldfarb","year":"1983","unstructured":"Goldfarb D., Idnani A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1\u201333 (1983)","journal-title":"Math. Program."},{"issue":"6","key":"9981_CR13","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1080\/10556780410001689225","volume":"19","author":"M. Haarala","year":"2004","unstructured":"Haarala M., Miettinen K., M\u00e4el\u00e4 M.M.: New limited memory bundle method for large-scale nonsmooth optimization. Optim. Methods Softw. 19(6), 673\u2013692 (2004)","journal-title":"Optim. Methods Softw."},{"key":"9981_CR14","doi-asserted-by":"crossref","unstructured":"Herrmann, J.W.: A genetic algorithm for min-max optimization problems. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC-09), pp. 1099\u20131103 (2009)","DOI":"10.1109\/CEC.1999.782545"},{"key":"9981_CR15","unstructured":"Jensen, M.T.: A new look at solving minmax problems with coevolution. In: Proceedings of the Fourth Metaheuristics International Conference (MIC-2001), pp. 103\u2013107 (2001)"},{"key":"9981_CR16","unstructured":"Karmitsa, N.: LMBM FORTRAN subroutines for large-scale nonsmooth minimization: user\u2019s manual. Technical Report TUCS Technical Report, No. 856, Turku Centre for Computer Science, Turku, Finland (2007)"},{"key":"9981_CR17","unstructured":"Kiwiel, K.C.: Restricted step and Levenberg-Marquardt techniques in proximal bundle methods in nondifferentiable optimization. Technical Report, Polish Academy of Sciences (1994)"},{"key":"9981_CR18","doi-asserted-by":"crossref","unstructured":"Lemarechal, C., Zowe, J.: A condensed introduction to bundle methods in nonsmooth optimization, algorithms for continuous optimization: the state of the art. In: Proceedings of the NATO Advanced Study Institute, pp. 357\u2013382 (1993)","DOI":"10.1007\/978-94-009-0369-2_12"},{"key":"9981_CR19","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"R.M. Lewis","year":"2003","unstructured":"Lewis R.M., Kolda T.G., Torczon V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"issue":"1","key":"9981_CR20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.amc.2004.06.081","volume":"167","author":"A. Malek","year":"2005","unstructured":"Malek A., Yari A.: Primal-dual solution for the linear programming problems using neural networks. Appl. Math. Comput. 167(1), 198\u2013211 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9981_CR21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/02331939508844109","volume":"34","author":"K. Miettinen","year":"1995","unstructured":"Miettinen K., M\u00e4kel\u00e4 M. M.: Interactive bundle-based method for nondifferentiable multiobjective optimization: NIMBUS. Optimization 34, 231\u2013246 (1995)","journal-title":"Optimization"},{"issue":"2","key":"9981_CR22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.11650\/twjm\/1500403827","volume":"10","author":"B.S. Mordukhovich","year":"2006","unstructured":"Mordukhovich B.S., Nam N. M.: Subgradients of distance functions at out-of-set points. Taiwan. J. Math. 10(2), 299\u2013326 (2006)","journal-title":"Taiwan. J. Math."},{"key":"9981_CR23","doi-asserted-by":"crossref","unstructured":"Oduguwa, V., Roy, R.: Bi-level optimisation using genetic algorithm. In: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS-02), pp. 322\u2013327 (2002)","DOI":"10.1109\/ICAIS.2002.1048121"},{"key":"9981_CR24","unstructured":"Rao, S.S.: Genetic algorithmic approach for multiobjective optimization of structures. In: Proceedings of the ASME Annual Winter Meeting on Structures and Controls Optimization, vol. 38, pp. 29\u201338 (1993)"},{"key":"9981_CR25","volume-title":"Engineering Optimization Methods and Applications","author":"G.V. Reklaitis","year":"1983","unstructured":"Reklaitis G.V., Ravindran A., Ragsdell K.M.: Engineering Optimization Methods and Applications. Wiley, New York (1983)"},{"key":"9981_CR26","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1996","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1996)"},{"issue":"1","key":"9981_CR27","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G. Rudolph","year":"1994","unstructured":"Rudolph G.: Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Netw. 5(1), 96\u2013101 (1994)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9981_CR28","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A. Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"key":"9981_CR29","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"Schramm H., Zowe J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"key":"9981_CR30","doi-asserted-by":"crossref","unstructured":"Tulshyan R., Arora, R., Deb, K., Dutta, J.: Investigating EA solutions for approximate KKT conditions for smooth problems. In: Proceedings of Genetic and Evolutionary Algorithms Conference (GECCO-2010), pp. 689\u2013696 (2010)","DOI":"10.1145\/1830483.1830609"},{"issue":"2","key":"9981_CR31","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1014839227049","volume":"113","author":"X. Zhao","year":"2002","unstructured":"Zhao X., Luh P.B.: New bundle methods for solving Lagrangian relaxation dual problems. J. Optim. Theory Appl. 113(2), 373\u2013397 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"9981_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, A., Zhang, Q.: A surrogate assisted evolutionary algorithm for minimax optimization. In: Proceedings of the 2010 Congress on Evolutionary Computation (CEC-10) (2010)","DOI":"10.1109\/CEC.2010.5586122"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9981-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9981-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9981-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T08:45:30Z","timestamp":1744188330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9981-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,25]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9981"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9981-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2012,9,25]]}}}