Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017)
- Authors:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1007/s10107-016-1065-8
- Subjects: OTIMIZAÇÃO NÃO LINEAR; OTIMIZAÇÃO IRRESTRITA
- Keywords: Nonlinear optimization; Unconstrained optimization; Evaluation complexity; High-order models; Regularization
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 2017
- Source:
- Título: Mathematical Programming
- ISSN: 0025-5610
- Volume/Número/Paginação/Ano: v. 163, n. 1-2, p. 359-368, 2017
- Este artigo possui versão em acesso aberto
- URL de acesso aberto
- Versão do Documento: Versão publicada (Published version)
-
Status: Artigo possui versão em acesso aberto em repositório (Green Open Access) -
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, v. 163, n. 1-2, p. 359-368, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1065-8. Acesso em: 10 mar. 2026. -
APA
Birgin, E. J. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., & Toint, P. L. (2017). Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, 163( 1-2), 359-368. doi:10.1007/s10107-016-1065-8 -
NLM
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2026 mar. 10 ] Available from: https://doi.org/10.1007/s10107-016-1065-8 -
Vancouver
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2026 mar. 10 ] Available from: https://doi.org/10.1007/s10107-016-1065-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 a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2839206.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
