Local convergence of an inexact-restoration method and numerical experiments (2005)
- Authors:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1007/s10957-005-6537-6
- Assunto: PROGRAMAÇÃO NÃO LINEAR
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Optimization Theory and Applications
- ISSN: 0022-3239
- Volume/Número/Paginação/Ano: v. 127, n. 2, p. 229-247, 2005
- Este artigo NÃO possui versão em acesso aberto
-
Status: Nenhuma versão em acesso aberto identificada -
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Local convergence of an inexact-restoration method and numerical experiments. Journal of Optimization Theory and Applications, v. 127, n. 2, p. 229-247, 2005Tradução . . Disponível em: https://doi.org/10.1007/s10957-005-6537-6. Acesso em: 11 mar. 2026. -
APA
Birgin, E. J. G., & Martínez, J. M. (2005). Local convergence of an inexact-restoration method and numerical experiments. Journal of Optimization Theory and Applications, 127( 2), 229-247. doi:10.1007/s10957-005-6537-6 -
NLM
Birgin EJG, Martínez JM. Local convergence of an inexact-restoration method and numerical experiments [Internet]. Journal of Optimization Theory and Applications. 2005 ; 127( 2): 229-247.[citado 2026 mar. 11 ] Available from: https://doi.org/10.1007/s10957-005-6537-6 -
Vancouver
Birgin EJG, Martínez JM. Local convergence of an inexact-restoration method and numerical experiments [Internet]. Journal of Optimization Theory and Applications. 2005 ; 127( 2): 229-247.[citado 2026 mar. 11 ] Available from: https://doi.org/10.1007/s10957-005-6537-6 - 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).
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
