Some theoretical limitations of second-order algorithms for smooth constrained optimization (2018)
- Autor:
- Autor USP: HAESER, GABRIEL - IME
- Unidade: IME
- DOI: 10.1016/j.orl.2018.02.007
- Assunto: PROGRAMAÇÃO NÃO LINEAR
- Keywords: global convergence; second-order algorithms; constant rank; constraint qualification; second-order optimality conditions
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Operations Research Letters
- ISSN: 0167-6377
- Volume/Número/Paginação/Ano: v. 46, n. 3, p. 295-299, 2018
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
HAESER, Gabriel. Some theoretical limitations of second-order algorithms for smooth constrained optimization. Operations Research Letters, v. 46, n. 3, p. 295-299, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.orl.2018.02.007. Acesso em: 23 abr. 2024. -
APA
Haeser, G. (2018). Some theoretical limitations of second-order algorithms for smooth constrained optimization. Operations Research Letters, 46( 3), 295-299. doi:10.1016/j.orl.2018.02.007 -
NLM
Haeser G. Some theoretical limitations of second-order algorithms for smooth constrained optimization [Internet]. Operations Research Letters. 2018 ; 46( 3): 295-299.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.orl.2018.02.007 -
Vancouver
Haeser G. Some theoretical limitations of second-order algorithms for smooth constrained optimization [Internet]. Operations Research Letters. 2018 ; 46( 3): 295-299.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.orl.2018.02.007 - On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- A note on linearly dependent symmetric matrices
- Optimality conditions and global convergence for nonlinear semidefinite programming
- A flexible inexact-restoration method for constrained optimization
- On a conjecture in second-order optimality conditions
- Posto constante para cones de segunda-ordem
- An extension of Yuan's lemma and its applications in optimization
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
Informações sobre o DOI: 10.1016/j.orl.2018.02.007 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2889891.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
