{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:10:52Z","timestamp":1778821852908,"version":"3.51.4"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123470","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T16:38:45Z","timestamp":1775493525000},"page":"123470","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximating optimal \u03bc-point distributions over a generalized sphere for Riesz s-energy using a gradient descent algorithm"],"prefix":"10.1016","volume":"747","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7637-7635","authenticated-orcid":false,"given":"Mahboubeh","family":"Nezhadmoghaddam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8748-3807","authenticated-orcid":false,"given":"Julio","family":"Ju\u00e1rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1131-098X","authenticated-orcid":false,"given":"Jes\u00fas Guillermo","family":"Falc\u00f3n-Cardona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7342-2090","authenticated-orcid":false,"given":"Michael T.M.","family":"Emmerich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Deutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123470_bib0005","series-title":"Nonlinear Multiobjective Optimization: A Generalized Homotopy Approach, Vol. 135 of Lecture Notes in Economics and Mathematical Systems","author":"Hillermeier","year":"2001"},{"issue":"2","key":"10.1016\/j.ins.2026.123470_bib0010","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","article-title":"Performance assessment of multiobjective optimizers: an analysis and review","volume":"7","author":"Zitzler","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123470_bib0015","first-page":"26:1","article-title":"Quality evaluation of solution sets in multiobjective optimisation: a survey","volume":"52","author":"Li","year":"2019","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.ins.2026.123470_bib0020","series-title":"Proceedings of the Third Mexican International Conference on Artificial Intelligence (MICAI\u20192004), Vol. 2972 of Lecture Notes in Artificial Intelligence","first-page":"688","article-title":"A study of the parallelization of a coevolutionary Multi-Objective evolutionary algorithm","author":"Coello Coello","year":"2004"},{"key":"10.1016\/j.ins.2026.123470_bib0025","series-title":"Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimar\u00e3es, Portugal, March 29\u2013April 1, 2015, Proceedings, Part II, Vol. 9019 of Lecture Notes in Computer Science","first-page":"110","article-title":"Modified distance calculation in generational distance and inverted generational distance","author":"Ishibuchi","year":"2015"},{"issue":"4","key":"10.1016\/j.ins.2026.123470_bib0030","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","article-title":"Using the averaged hausdorff distance as a performance measure in evolutionary Multi-Objective optimization","volume":"16","author":"Sch\u00fctze","year":"2012","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0035","series-title":"Exploring Structural Diversity in Evolutionary Algorithms","author":"Ulrich","year":"2012"},{"issue":"10","key":"10.1016\/j.ins.2026.123470_bib0040","first-page":"1186","article-title":"Discretizing manifolds via minimum energy points","volume":"51","author":"Hardin","year":"2004","journal-title":"Notices of the American Mathematical Society"},{"key":"10.1016\/j.ins.2026.123470_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2026.115833","article-title":"Riesz energy minimization facility location problem in the plane: complexity and a Polynomial-Time approximation scheme","volume":"1070","author":"Atta","year":"2026","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2026.123470_bib0050","series-title":"Evolutionary Multi-Criterion Optimization","first-page":"58","article-title":"Comparative analysis of indicators for multi-objective diversity optimization","author":"Pereverdieva","year":"2025"},{"key":"10.1016\/j.ins.2026.123470_bib0055","series-title":"Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA \u201909)","first-page":"87","article-title":"Theory of the hypervolume indicator: optimal \u03bc-distributions and the choice of the reference point","author":"Auger","year":"2009"},{"key":"10.1016\/j.ins.2026.123470_bib0060","series-title":"Hybrid Metaheuristics, 4th International Workshop, HM 2007, Vol. 4771 of Lecture Notes in Computer Science","first-page":"140","article-title":"Gradient-Based\/evolutionary relay hybrid for computing Pareto front approximations maximizing the S-Metric","author":"Emmerich","year":"2007"},{"key":"10.1016\/j.ins.2026.123470_bib0065","series-title":"IEEE Symposium Series on Computational Intelligence (SSCI)","first-page":"433","article-title":"Empirical hypervolume optimal \u00b5-distributions on complex Pareto fronts","author":"Shang","year":"2023"},{"key":"10.1016\/j.ins.2026.123470_bib0070","first-page":"1","article-title":"Riesz s-energy as a diversity indicator in evolutionary Multi-Objective optimization","author":"Falc\u00f3n-Cardona","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0075","series-title":"2020 IEEE Congress on Evolutionary Computation (CEC)","first-page":"1","article-title":"Riesz s-energy-based reference sets for multi-objective optimization","author":"Falc\u00f3n-Cardona","year":"2020"},{"key":"10.1016\/j.ins.2026.123470_bib0080","first-page":"1","article-title":"Fast High-Diversity subset selection for Multi-Objective optimization by Rieszs-energy","author":"Falc\u00f3n-Cardona","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.ins.2026.123470_bib0085","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TEVC.2020.2992387","article-title":"Generating Well-Spaced points on a unit simplex for evolutionary Many-Objective optimization","volume":"25","author":"Blank","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.ins.2026.123470_bib0090","first-page":"676","article-title":"An analysis of quality indicators using approximated optimal distributions in a three-dimensional objective space","volume":"24","author":"Tanabe","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0095","first-page":"428","article-title":"Generalized decomposition","author":"Giagkiozis","year":"2013"},{"key":"10.1016\/j.ins.2026.123470_bib0100","series-title":"Discrete Energy on Rectifiable Sets","author":"Borodachov","year":"2019"},{"key":"10.1016\/j.ins.2026.123470_bib0105","series-title":"An Introduction to Optimization on Smooth Manifolds","author":"Boumal","year":"2023"},{"key":"10.1016\/j.ins.2026.123470_bib0110","author":"Emmerich"},{"key":"10.1016\/j.ins.2026.123470_bib0115","first-page":"586","article-title":"Theoretically investigating optimal \u00b5-distributions for the hypervolume indicator: first results for three objectives","author":"Auger","year":"2010"},{"key":"10.1016\/j.ins.2026.123470_bib0120","series-title":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","first-page":"1658","article-title":"Improving the search performance of SHADE using linear population size reduction","author":"Tanabe","year":"2014"},{"issue":"2","key":"10.1016\/j.ins.2026.123470_bib0125","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.ins.2026.123470_bib0130","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","article-title":"SMS-EMOA: multiobjective selection based on dominated hypervolume","volume":"181","author":"Beume","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10.1016\/j.ins.2026.123470_bib0135","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1109\/TCYB.2018.2885974","article-title":"The Set-Based hypervolume newton method for Bi-Objective optimization","volume":"50","author":"Hern\u00e1ndez","year":"2020","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.ins.2026.123470_bib0140","first-page":"10","article-title":"The hypervolume newton method for constrained Multi-Objective optimization problems","volume":"28","author":"Wang","year":"2023","journal-title":"Math. Comput. Appl."},{"issue":"10","key":"10.1016\/j.ins.2026.123470_bib0145","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.3390\/math8101822","article-title":"A set based newton method for the averaged hausdorff distance for Multi-Objective reference set problems","volume":"8","author":"Uribe","year":"2020","journal-title":"Mathematics"},{"issue":"5","key":"10.1016\/j.ins.2026.123470_bib0150","doi-asserted-by":"crossref","first-page":"2104","DOI":"10.1109\/TEVC.2024.3469373","article-title":"A newton method for hausdorff approximations of the Pareto front within multi-objective evolutionary algorithms","volume":"29","author":"Wang","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123470_bib0155","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TEVC.2021.3093114","article-title":"Hypervolume-Optimal \u00b5-distributions on line\/Plane-Based Pareto fronts in three dimensions","volume":"26","author":"Shang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0160","author":"Kingma"},{"key":"10.1016\/j.ins.2026.123470_bib0165","first-page":"354","article-title":"An adaptive Reference-Set based evolutionary algorithm for multiobjective optimisation","volume":"509","author":"Jiang","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123470_bib0170","first-page":"544","article-title":"A Decomposition-Based evolutionary algorithm with direction vector adaptation and selection enhancement","volume":"505","author":"Zhou","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123470_bib0175","doi-asserted-by":"crossref","first-page":"5287","DOI":"10.1007\/s40747-022-00759-w","article-title":"Machine learning-based framework to cover optimal Pareto-front in many-objective optimization","volume":"8","author":"Bidgoli","year":"2022","journal-title":"Complex Intell. Syst."},{"issue":"10","key":"10.1016\/j.ins.2026.123470_bib0180","doi-asserted-by":"crossref","DOI":"10.3390\/math13101626","article-title":"Reference set generator: a method for Pareto front approximation and reference set generation","volume":"13","author":"Rodriguez-Fernandez","year":"2025","journal-title":"Mathematics"},{"issue":"6","key":"10.1016\/j.ins.2026.123470_bib0185","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","article-title":"Diversity assessment in many-objective optimization","volume":"47","author":"Wang","year":"2016","journal-title":"IEEE Trans. Cybern."},{"issue":"6","key":"10.1016\/j.ins.2026.123470_bib0190","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","article-title":"Reference point specification in inverted generational distance for triangular linear Pareto front","volume":"22","author":"Ishibuchi","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0195","series-title":"International Conference on Evolutionary Multi-Criterion Optimization","first-page":"922","article-title":"Test problems based on lam\u00e9 superspheres","author":"Emmerich","year":"2007"},{"key":"10.1016\/j.ins.2026.123470_bib0200","series-title":"Proceedings of the 2002 Congress on Evolutionary Computation (CEC\u20192002)","first-page":"825","article-title":"Scalable test problems for evolutionary multiobjective optimization","author":"Deb","year":"2002"},{"key":"10.1016\/j.ins.2026.123470_bib0205","series-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"issue":"3","key":"10.1016\/j.ins.2026.123470_bib0210","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","article-title":"Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems","volume":"8","author":"Das","year":"1998","journal-title":"SIAM J. Optim."},{"issue":"6","key":"10.1016\/j.ins.2026.123470_bib0215","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","article-title":"Reference point specification in inverted generational distance for triangular linear Pareto front","volume":"22","author":"Ishibuchi","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123470_bib0220","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1162\/evco_a_00269","article-title":"What weights work for you? Adapting weights for any Pareto front shape in Decomposition-Based evolutionary multiobjective optimisation","volume":"28","author":"Li","year":"2020","journal-title":"Evol. Comput."},{"key":"10.1016\/j.ins.2026.123470_bib0225","series-title":"2024 IEEE Congress on Evolutionary Computation (CEC)","first-page":"1","article-title":"An analysis of the preferences of distribution indicators in evolutionary Multi-Objective optimization","author":"Falc\u00f3n-Cardona","year":"2024"},{"issue":"1","key":"10.1016\/j.ins.2026.123470_bib0230","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.aim.2004.05.006","article-title":"Minimal Riesz energy point configurations for rectifiable d-dimensional manifolds","volume":"193","author":"Hardin","year":"2005","journal-title":"Adv. Math."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:25:37Z","timestamp":1778819137000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":46,"alternative-id":["S0020025526004019"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123470","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating optimal -point distributions over a generalized sphere for Riesz -energy using a gradient descent algorithm","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123470","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123470"}}