Artículos de revistas
Packing Ellipsoids By Nonlinear Optimization
Registro en:
1573-2916
Journal Of Global Optimization. SPRINGER, n. 65, n. 4, p. 709 - 743.
0925-5001
WOS:000379862500004
10.1007/s10898-015-0395-z
Autor
Birgin
EG; Lobato
RD; Martinez
JM
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) In this paper, continuous and differentiable nonlinear programming models and algorithms for packing ellipsoids in the n-dimensional space are introduced. Two different models for the non-overlapping and models for the inclusion of ellipsoids within half-spaces and ellipsoids are presented. By applying a simple multi-start strategy combined with a clever choice of starting guesses and a nonlinear programming local solver, illustrative numerical experiments are presented. 65
709 743 PRONEX-CNPq/FAPERJ [E-26/111.449/2010-APQ1] FAPESP [2010/10133-0, 2013/03447-6, 2013/05475-7, 2013/07375-0, 2012/23916-8] CNPq Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)