Exploiting cone approximations in an augmented Lagrangian method for conic optimization (2025)
- Authors:
- USP affiliated authors: FUKUDA, MITUHIRO - EACH ; HAESER, GABRIEL - IME ; MITO, LEONARDO MAKOTO - IME
- Unidades: EACH; IME
- DOI: 10.1080/10556788.2025.2576224
- Subjects: PROGRAMAÇÃO NÃO LINEAR; PESQUISA OPERACIONAL; CÁLCULO DE VARIAÇÕES; CONTROLE ÓTIMO
- Keywords: Nonlinear conic programming; sequential optimality condition; augmented Lagrangian method; nonlinear copositive programming
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Optimization Methods and Software
- ISSN: 1055-6788
- Volume/Número/Paginação/Ano: Publicado online em 2025
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
FUKUDA, Mituhiro et al. Exploiting cone approximations in an augmented Lagrangian method for conic optimization. Optimization Methods and Software, 2025Tradução . . Disponível em: https://doi.org/10.1080/10556788.2025.2576224. Acesso em: 27 fev. 2026. -
APA
Fukuda, M., Gómez, W., Haeser, G., & Mito, L. M. (2025). Exploiting cone approximations in an augmented Lagrangian method for conic optimization. Optimization Methods and Software. doi:10.1080/10556788.2025.2576224 -
NLM
Fukuda M, Gómez W, Haeser G, Mito LM. Exploiting cone approximations in an augmented Lagrangian method for conic optimization [Internet]. Optimization Methods and Software. 2025 ;[citado 2026 fev. 27 ] Available from: https://doi.org/10.1080/10556788.2025.2576224 -
Vancouver
Fukuda M, Gómez W, Haeser G, Mito LM. Exploiting cone approximations in an augmented Lagrangian method for conic optimization [Internet]. Optimization Methods and Software. 2025 ;[citado 2026 fev. 27 ] Available from: https://doi.org/10.1080/10556788.2025.2576224 - On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- Weak notions of nondegeneracy in nonlinear semidefinite programming
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- A minimal face constant rank constraint qualification for reducible conic programming
- On the best achievable quality of limit points of augmented Lagrangian schemes
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- On optimality conditions for nonlinear conic programming
- 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
Informações sobre o DOI: 10.1080/10556788.2025.2576224 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3278065_va_-_Exploiting_c... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
