{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:53:47Z","timestamp":1648986827876},"reference-count":40,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2020,2,27]],"date-time":"2020-02-27T00:00:00Z","timestamp":1582761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"name":"Portuguese Foundation for Science and Technology","award":["UID\/MAT\/00297\/2019"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2019,9,29]]},"published-print":{"date-parts":[[2020,3]]},"abstract":"Solving nonlinear programming problems usually involve difficulties to obtain a starting point that produces convergence to a local feasible solution, for which the objective function value is sufficiently good. A novel approach is proposed, combining metaheuristic techniques with modern deterministic optimization schemes, with the aim to solve a sequence of penalized related problems to generate convenient starting points. The metaheuristic ideas are used to choose the penalty parameters associated with the constraints, and for each set of penalty parameters a deterministic scheme is used to evaluate a properly chosen metaheuristic merit function. Based on this starting-point approach, we describe two different strategies for solving the nonlinear programming problem. We illustrate the properties of the combined schemes on three nonlinear programming benchmark-test problems, and also on the well-known and hard-to-solve disk-packing problem, that possesses a huge amount of local-nonglobal solutions, obtaining encouraging results both in terms of optimality and feasibility.<\/jats:p>","DOI":"10.1051\/ro\/2019096","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T18:49:19Z","timestamp":1569955759000},"page":"451-469","source":"Crossref","is-referenced-by-count":0,"title":["A metaheuristic penalty approach for the starting point in nonlinear programming"],"prefix":"10.1051","volume":"54","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7256-3094","authenticated-orcid":false,"given":"David R.","family":"Penas","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0417-7981","authenticated-orcid":false,"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2020,2,27]]},"reference":[{"key":"R1","unstructured":"Artelys, Knitro nonlinear optimization solver. https:\/\/www.artelys.com\/en\/optimization-tools\/knitro (2019)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1752-0509-2-47","volume":"2","author":"Banga","year":"2008","journal-title":"BMC Syst. Biol."},{"key":"R3","unstructured":"Byrd R.H., Nocedal J. and Waltz R.A., Knitro: an integrated package for nonlinear optimization. In: Large-scale Nonlinear Optimization. Springer (2006) 35\u201359."},{"key":"R4","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"Coello","year":"2002","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"R5","unstructured":"Conn A.R., Gould G. and Toint P.L., In: 17 of LANCELOT: A Fortran Package for Large-scale Nonlinear Optimization (Release A). Springer Science & Business Media (2013)."},{"key":"R6","unstructured":"Fiacco A.V. and McCormick G.P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley and Sons, New York (1968)."},{"key":"R7","unstructured":"GAMS World site. Cute models section. http:\/\/www.gamsworld.org\/performance\/princetonlib\/htm\/group5stat.htm (2019)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-4076(94)90038-8","volume":"60","author":"Goffe","year":"1994","journal-title":"J. Econ."},{"key":"R9","first-page":"36","volume":"2010","author":"Griffin","year":"2010","journal-title":"Appl. Math. Res. Express"},{"key":"R10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01589332","volume":"20","author":"Hald","year":"1981","journal-title":"Math. Program."},{"key":"R11","unstructured":"Hansen N.. A Python implementation of CMA-ES. https:\/\/github.com\/CMA-ES\/pycma (2017)."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Hansen N. and Kern S., Evaluating the CMA evolution strategy on multimodal test functions. Springer (2004) 282\u2013291.","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"R13","unstructured":"Hansen N. and Ostermeier A., Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In: Proceedings of IEEE International Conference on Evolutionary Computation. IEEE (1996) 312\u2013317."},{"key":"R14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"Hansen","year":"2003","journal-title":"Evol. Comput."},{"key":"R15","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1177\/003754979406200405","volume":"62","author":"Homaifar","year":"1994","journal-title":"Simulation"},{"key":"R16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10898-012-9913-4","volume":"55","author":"Kaucic","year":"2013","journal-title":"J. Global Optim."},{"key":"R17","unstructured":"Kennedy J. and Eberhart R., Pso optimization. In: Vol. 4 of Proc. IEEE Int. Conf. Neural Networks. IEEE Service Center, Piscataway, NJ (1995) 1941\u20131948."},{"key":"R18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"R19","unstructured":"Lee A., Particle swarm optimization (PSO) with constraint support. https:\/\/github.com\/tisimst\/pyswarm (2015)."},{"key":"R20","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","volume":"194","author":"Lee","year":"2005","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"R21","unstructured":"Luenberger D.G., Linear and Nonlinear Programming. Addison-Wesley, Menlo Park, CA (1984)."},{"key":"R22","unstructured":"Luke S., Essentials of Metaheuristics, 2nd edition. Lulu. Available for free at http:\/\/cs.gmu.edu\/sean\/book\/metaheuristics\/ (2013)."},{"key":"R23","unstructured":"Menai M.E.-B., Batouche M., Efficient initial solution to extremal optimization algorithm for weighted maxsat problem. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer (2003) 592\u2013603."},{"key":"R24","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1111\/1475-3995.d01-23","volume":"1","author":"Michalewicz","year":"1994","journal-title":"Int. Trans. Oper. Res."},{"key":"R25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01889983","volume":"1","author":"Michalewicz","year":"1991","journal-title":"Stat. Comput."},{"key":"R26","first-page":"214","volume":"76","author":"Parsopoulos","year":"2002","journal-title":"Int. Technol.\u2013Theory App.: New Trends Intell. Technol."},{"key":"R27","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.procs.2015.05.331","volume":"51","author":"Penas","year":"2015","journal-title":"Proc. Comput. Sci."},{"key":"R28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0182186","volume":"12","author":"Penas","year":"2017","journal-title":"PLoS One"},{"key":"R29","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"Poli","year":"2007","journal-title":"Swarm Intell."},{"key":"R30","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/BF01589118","volume":"45","author":"Powell","year":"1989","journal-title":"Math. Program."},{"key":"R31","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1011319115230","volume":"7","author":"Rardin","year":"2001","journal-title":"J. Heuristics"},{"key":"R32","unstructured":"Rieck M., Richter M., Bittner M. and Holzapfel F., Generation of initial guesses for optimal control problems with mixed integer dependent constraints. In: ICAS 29th International Conference (2014)."},{"key":"R33","unstructured":"Robert J., Vanderbei website. University of Princeton. https:\/\/vanderbei.princeton.edu\/ampl\/nlmodels\/ (2019)."},{"key":"R34","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1057\/palgrave.jors.2602068","volume":"57","author":"Suman","year":"2006","journal-title":"J. Oper. Res. Soc."},{"key":"R35","unstructured":"Takahashi T., Metaheuristic Algorithms Python. https:\/\/github.com\/tadatoshi\/ (2015)."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"Talbi E., Metaheuristics: From Design to Implementation, 1st edition. Wiley (2009). ISBN 9780470278581.","DOI":"10.1002\/9780470496916"},{"key":"R37","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.1060.0175","volume":"19","author":"Ugray","year":"2007","journal-title":"INFORMS J. Comput."},{"key":"R38","unstructured":"University of Magdeburg, The best known packings of equal circles in a square. http:\/\/hydra.nat.uni-magdeburg.de\/packing\/csq\/csq.html (2013)."},{"key":"R39","first-page":"45","volume":"10","author":"Yeniay","year":"2005","journal-title":"Math. Comput. App."},{"key":"R40","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1022317229206","volume":"35","author":"Zhang","year":"2003","journal-title":"Math. Geol."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019096\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:46:50Z","timestamp":1584690410000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2019096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,27]]},"references-count":40,"journal-issue":{"issue":"2"},"alternative-id":["ro190096"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2019096","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,27]]}}}