ReP USP - Resultado da busca

Artigo de periodico
On the convergence of iterative schemes for solving a piecewise linear system of equations (2023)
Armijo, Nicolas F. ; Bello-Cruz, Yunier ; Haeser, Gabriel
Fonte: Linear Algebra and its Applications. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARMIJO, Nicolas F. e BELLO-CRUZ, Yunier e HAESER, Gabriel. On the convergence of iterative schemes for solving a piecewise linear system of equations. Linear Algebra and its Applications, v. 665, p. 291-314, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.laa.2023.02.001. Acesso em: 06 set. 2024.
APA
Armijo, N. F., Bello-Cruz, Y., & Haeser, G. (2023). On the convergence of iterative schemes for solving a piecewise linear system of equations. Linear Algebra and its Applications, 665, 291-314. doi:10.1016/j.laa.2023.02.001
NLM
Armijo NF, Bello-Cruz Y, Haeser G. On the convergence of iterative schemes for solving a piecewise linear system of equations [Internet]. Linear Algebra and its Applications. 2023 ; 665 291-314.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.laa.2023.02.001
Vancouver
Armijo NF, Bello-Cruz Y, Haeser G. On the convergence of iterative schemes for solving a piecewise linear system of equations [Internet]. Linear Algebra and its Applications. 2023 ; 665 291-314.[citado 2024 set. 06 ] Available from: https://doi.org/10.1016/j.laa.2023.02.001
Artigo de periodico
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (2021)
Haeser, Gabriel ; Hinder, Oliver ; Ye, Yinyu
Fonte: Mathematical Programming. Unidade: IME
Assuntos: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO CONVEXA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e HINDER, Oliver e YE, Yinyu. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Mathematical Programming, v. 186, n. 1-2, p. 257-288, 2021Tradução . . Disponível em: https://doi.org/10.1007/s10107-019-01454-4. Acesso em: 06 set. 2024.
APA
Haeser, G., Hinder, O., & Ye, Y. (2021). On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Mathematical Programming, 186( 1-2), 257-288. doi:10.1007/s10107-019-01454-4
NLM
Haeser G, Hinder O, Ye Y. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods [Internet]. Mathematical Programming. 2021 ; 186( 1-2): 257-288.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10107-019-01454-4
Vancouver
Haeser G, Hinder O, Ye Y. On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods [Internet]. Mathematical Programming. 2021 ; 186( 1-2): 257-288.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10107-019-01454-4
Artigo de periodico
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (2019)
Haeser, Gabriel ; Liu, Hongcheng; Ye, Yinyu
Fonte: Mathematical Programming. Unidade: IME
Assuntos: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e LIU, Hongcheng e YE, Yinyu. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, v. 178, n. 1-2, p. 263-299, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10107-018-1290-4. Acesso em: 06 set. 2024.
APA
Haeser, G., Liu, H., & Ye, Y. (2019). Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming, 178( 1-2), 263-299. doi:10.1007/s10107-018-1290-4
NLM
Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
Vancouver
Haeser G, Liu H, Ye Y. Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary [Internet]. Mathematical Programming. 2019 ; 178( 1-2): 263-299.[citado 2024 set. 06 ] Available from: https://doi.org/10.1007/s10107-018-1290-4

Unidades USP

ReP

Filtros

Autores