An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (2020)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; HAESER, GABRIEL - IME ; MITO, LEONARDO MAKOTO - IME
- Unidade: IME
- DOI: 10.1007/s40314-019-0991-5
- Subjects: PROGRAMAÇÃO NÃO LINEAR; GEOMETRIA ALGÉBRICA
- Keywords: Augmented Lagrangian; Nonlinear semidefinite programming; Covering problem; Convex algebraic geometry
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 2020
- Source:
- Título: Computational and Applied Mathematics
- ISSN: 1807-0302
- Volume/Número/Paginação/Ano: v. 39, Art. 10, 2020
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
-
ABNT
BIRGIN, Ernesto Julian Goldberg et al. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, v. 39, 2020Tradução . . Disponível em: https://doi.org/10.1007/s40314-019-0991-5. Acesso em: 27 dez. 2025. -
APA
Birgin, E. J. G., Gómez, W., Haeser, G., Mito, L. M., & Santos, D. O. (2020). An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, 39. doi:10.1007/s40314-019-0991-5 -
NLM
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s40314-019-0991-5 -
Vancouver
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s40314-019-0991-5 - Weak notions of nondegeneracy in nonlinear semidefinite programming
- On the best achievable quality of limit points of augmented Lagrangian schemes
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- On optimality conditions for nonlinear conic programming
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A minimal face constant rank constraint qualification for reducible conic programming
- Augmented Lagrangian for nonlinear SDPs applied to the covering problem
- Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
Informações sobre o DOI: 10.1007/s40314-019-0991-5 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2977471.pdf | ||
 |
2977471.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
