Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization (2014)
- Authors:
- Autor USP: HAESER, GABRIEL - IME
- Unidade: IME
- DOI: 10.1007/s10957-013-0492-4
- Subjects: MÉTODOS DE PONTOS INTERIORES; PROGRAMAÇÃO QUADRÁTICA; PROGRAMAÇÃO CONVEXA
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Optimization Theory and Applications
- ISSN: 0022-3239
- Volume/Número/Paginação/Ano: v. 162, n. 3, p. 705-717, 2014
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BEHLING, Roger e GONZAGA, Clovis Caesar e HAESER, Gabriel. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization. Journal of Optimization Theory and Applications, v. 162, n. 3, p. 705-717, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10957-013-0492-4. Acesso em: 23 abr. 2024. -
APA
Behling, R., Gonzaga, C. C., & Haeser, G. (2014). Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization. Journal of Optimization Theory and Applications, 162( 3), 705-717. doi:10.1007/s10957-013-0492-4 -
NLM
Behling R, Gonzaga CC, Haeser G. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization [Internet]. Journal of Optimization Theory and Applications. 2014 ; 162( 3): 705-717.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/s10957-013-0492-4 -
Vancouver
Behling R, Gonzaga CC, Haeser G. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization [Internet]. Journal of Optimization Theory and Applications. 2014 ; 162( 3): 705-717.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1007/s10957-013-0492-4 - 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
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
Informações sobre o DOI: 10.1007/s10957-013-0492-4 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
