Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (2022)
- Authors:
- USP affiliated authors: HAESER, GABRIEL - IME ; MITO, LEONARDO MAKOTO - IME
- Unidade: IME
- DOI: 10.1007/s11590-021-01737-w
- Subjects: PROGRAMAÇÃO NÃO LINEAR; OTIMIZAÇÃO NÃO LINEAR
- Keywords: Constraint qualifications; Optimality conditions; Second-order cone programming; Semidefinite programming; Global convergence
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Springer
- Publisher place: Heidelberg
- Date published: 2022
- Source:
- Título do periódico: Optimization Letters
- ISSN: 1862-4472
- Volume/Número/Paginação/Ano: v. 16, n. 2, p. 589-610, 2022
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
ANDREANI, Roberto et al. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, v. 16, n. 2, p. 589-610, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11590-021-01737-w. Acesso em: 29 maio 2024. -
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, H., Santos, D. O., & Silveira, T. P. da. (2022). Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, 16( 2), 589-610. doi:10.1007/s11590-021-01737-w -
NLM
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 maio 29 ] Available from: https://doi.org/10.1007/s11590-021-01737-w -
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 maio 29 ] Available from: https://doi.org/10.1007/s11590-021-01737-w - Weak notions of nondegeneracy in nonlinear 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
- On the best achievable quality of limit points of augmented Lagrangian schemes
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
- An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- O problema de cobertura via geometria algébrica convexa
- Topics in nonlinear conic optimization and applications
Informações sobre o DOI: 10.1007/s11590-021-01737-w (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3036077.pdf | ||
 | 3036077.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
