A nonlinear programming model with implicit variables for packing ellipsoids (2017)
- Authors:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1007/s10898-016-0483-8
- Assunto: GEOMETRIA CONVEXA
- Keywords: Cutting and packing ellipsoids; Optimization; Nonlinear programming; Models; Numerical experiments
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Global Optimization
- ISSN: 0925-5001
- Volume/Número/Paginação/Ano: v. 68, n. 3, p. 467-499, 2017
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano e MARTINEZ, J M. A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, v. 68, n. 3, p. 467-499, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10898-016-0483-8. Acesso em: 20 fev. 2026. -
APA
Birgin, E. J. G., Lobato, R. D., & Martinez, J. M. (2017). A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, 68( 3), 467-499. doi:10.1007/s10898-016-0483-8 -
NLM
Birgin EJG, Lobato RD, Martinez JM. A nonlinear programming model with implicit variables for packing ellipsoids [Internet]. Journal of Global Optimization. 2017 ; 68( 3): 467-499.[citado 2026 fev. 20 ] Available from: https://doi.org/10.1007/s10898-016-0483-8 -
Vancouver
Birgin EJG, Lobato RD, Martinez JM. A nonlinear programming model with implicit variables for packing ellipsoids [Internet]. Journal of Global Optimization. 2017 ; 68( 3): 467-499.[citado 2026 fev. 20 ] Available from: https://doi.org/10.1007/s10898-016-0483-8 - An augmented Lagrangian method with finite termination
- Packing circles within ellipses
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods
- Penalizing simple constraints on augmented Lagrangian methods
- Dykstra’s algorithm and robust stopping criteria
- Outer trust-region method for constrained optimization
- On the application of an augmented Lagrangian algorithm to some portfolio problems
Informações sobre o DOI: 10.1007/s10898-016-0483-8 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2861533.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
