Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations (2013)
- Authors:
- Autor USP: BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidade: IME
- DOI: 10.1021/ct3009683
- Subjects: QUÍMICA TEÓRICA; OTIMIZAÇÃO COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher place: Washington
- Date published: 2013
- Source:
- Título: Journal of Chemical Theory and Computation
- ISSN: 1549-9618
- Volume/Número/Paginação/Ano: v. 9, n. 2, p. 1043-1051, 2013
- Status:
- Artigo possui versão em acesso aberto em repositório (Green Open Access)
- Versão do Documento:
- Versão publicada (Published version)
- Acessar versão aberta:
-
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations. Journal of Chemical Theory and Computation, v. 9, n. 2, p. 1043-1051, 2013Tradução . . Disponível em: https://doi.org/10.1021/ct3009683. Acesso em: 30 mar. 2026. -
APA
Birgin, E. J. G., Martinez, J. M., Martínez, L., & Rocha, G. B. (2013). Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations. Journal of Chemical Theory and Computation, 9( 2), 1043-1051. doi:10.1021/ct3009683 -
NLM
Birgin EJG, Martinez JM, Martínez L, Rocha GB. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations [Internet]. Journal of Chemical Theory and Computation. 2013 ; 9( 2): 1043-1051.[citado 2026 mar. 30 ] Available from: https://doi.org/10.1021/ct3009683 -
Vancouver
Birgin EJG, Martinez JM, Martínez L, Rocha GB. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations [Internet]. Journal of Chemical Theory and Computation. 2013 ; 9( 2): 1043-1051.[citado 2026 mar. 30 ] Available from: https://doi.org/10.1021/ct3009683 - An augmented Lagrangian method with finite termination
- Packing circles within ellipses
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- 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
- Sequential equality-constrained optimization for nonlinear programming
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Por se tratar de integração com serviço externo, podem existir diferentes versões do trabalho (como preprints ou postprints), que podem diferir da versão publicada.
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
