On the best achievable quality of limit points of augmented Lagrangian schemes (2022)
- Authors:
- USP affiliated authors: HAESER, GABRIEL - IME ; MITO, LEONARDO MAKOTO - IME
- Unidade: IME
- DOI: 10.1007/s11075-021-01212-8
- Subjects: PROGRAMAÇÃO MATEMÁTICA; OTIMIZAÇÃO NÃO LINEAR; MÉTODOS NUMÉRICOS
- Keywords: Augmented Lagrangian methods; Optimality conditions
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Numerical Algorithms
- ISSN: 1017-1398
- Volume/Número/Paginação/Ano: v. 90, n. 2, p. 851-877, 2022
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
ANDREANI, Roberto et al. On the best achievable quality of limit points of augmented Lagrangian schemes. Numerical Algorithms, v. 90, n. 2, p. 851-877, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11075-021-01212-8. Acesso em: 28 jan. 2026. -
APA
Andreani, R., Haeser, G., Mito, L., Ramos, A., & Secchin, L. D. (2022). On the best achievable quality of limit points of augmented Lagrangian schemes. Numerical Algorithms, 90( 2), 851-877. doi:10.1007/s11075-021-01212-8 -
NLM
Andreani R, Haeser G, Mito L, Ramos A, Secchin LD. On the best achievable quality of limit points of augmented Lagrangian schemes [Internet]. Numerical Algorithms. 2022 ; 90( 2): 851-877.[citado 2026 jan. 28 ] Available from: https://doi.org/10.1007/s11075-021-01212-8 -
Vancouver
Andreani R, Haeser G, Mito L, Ramos A, Secchin LD. On the best achievable quality of limit points of augmented Lagrangian schemes [Internet]. Numerical Algorithms. 2022 ; 90( 2): 851-877.[citado 2026 jan. 28 ] Available from: https://doi.org/10.1007/s11075-021-01212-8 - Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- Weak notions of nondegeneracy in nonlinear semidefinite programming
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- On optimality conditions for nonlinear conic programming
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- A minimal face constant rank constraint qualification for reducible conic programming
- An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Exploiting cone approximations in an augmented Lagrangian method for conic optimization
Informações sobre o DOI: 10.1007/s11075-021-01212-8 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3054164.pdf | ||
|
3054164_Correction.pdf | ||
 |
3054164.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
