A minimal face constant rank constraint qualification for reducible conic programming (2025)
- Authors:
- USP affiliated authors: HAESER, GABRIEL - IME ; MITO, LEONARDO MAKOTO - IME
- Unidade: IME
- DOI: 10.1007/s10107-025-02237-w
- Subjects: PROGRAMAÇÃO NÃO LINEAR; OTIMIZAÇÃO NÃO LINEAR; PESQUISA OPERACIONAL
- Keywords: Constraint qualifications; Second-order necessary optimality conditions; Cone reducibility; Facial reduction; Conic programming
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Springer
- Publisher place: Heidelberg
- Date published: 2025
- Source:
- Título: Mathematical Programming
- ISSN: 0025-5610
- Volume/Número/Paginação/Ano: p. 1-27, publicado online em 2025
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
ANDREANI, Roberto et al. A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, p. 1-27, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10107-025-02237-w. Acesso em: 27 dez. 2025. -
APA
Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2025). A minimal face constant rank constraint qualification for reducible conic programming. Mathematical Programming, 1-27. doi:10.1007/s10107-025-02237-w -
NLM
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s10107-025-02237-w -
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H. A minimal face constant rank constraint qualification for reducible conic programming [Internet]. Mathematical Programming. 2025 ; 1-27.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s10107-025-02237-w - 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
- 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
- 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
Informações sobre o DOI: 10.1007/s10107-025-02237-w (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3254594_va.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
