ReP USP - Resultado da busca

Tese (Doutorado)
Complexity analysis for a third-order algorithm to reach second-order stationarity (2024)
Silva, David Ricardo Barreto Lima; Haeser, Gabriel (Orientador)
Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, ANÁLISE NUMÉRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, David Ricardo Barreto Lima. Complexity analysis for a third-order algorithm to reach second-order stationarity. 2024. Tese (Doutorado) – Universidade de São Paulo, São Paulo, 2024. Disponível em: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27092024-163832/. Acesso em: 24 fev. 2026.
APA
Silva, D. R. B. L. (2024). Complexity analysis for a third-order algorithm to reach second-order stationarity (Tese (Doutorado). Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27092024-163832/
NLM
Silva DRBL. Complexity analysis for a third-order algorithm to reach second-order stationarity [Internet]. 2024 ;[citado 2026 fev. 24 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27092024-163832/
Vancouver
Silva DRBL. Complexity analysis for a third-order algorithm to reach second-order stationarity [Internet]. 2024 ;[citado 2026 fev. 24 ] Available from: https://www.teses.usp.br/teses/disponiveis/45/45132/tde-27092024-163832/
Artigo de periodico
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (2021)
Haeser, Gabriel ; Hinder, Oliver ; Ye, Yinyu
Source: Mathematical Programming. Unidade: IME
Subjects: 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: 24 fev. 2026.
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 2026 fev. 24 ] 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 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10107-019-01454-4
Artigo de periodico
On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier (2021)
Haeser, Gabriel ; Ramos, Alberto
Source: Operations Research Letters. Unidade: IME
Assunto: OTIMIZAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e RAMOS, Alberto. On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier. Operations Research Letters, v. 49, n. 6, p. 883-889, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.orl.2021.09.008. Acesso em: 24 fev. 2026.
APA
Haeser, G., & Ramos, A. (2021). On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier. Operations Research Letters, 49( 6), 883-889. doi:10.1016/j.orl.2021.09.008
NLM
Haeser G, Ramos A. On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier [Internet]. Operations Research Letters. 2021 ; 49( 6): 883-889.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1016/j.orl.2021.09.008
Vancouver
Haeser G, Ramos A. On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier [Internet]. Operations Research Letters. 2021 ; 49( 6): 883-889.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1016/j.orl.2021.09.008
Artigo de periodico
New constraint qualifications with second-order properties in nonlinear optimization (2020)
Haeser, Gabriel ; Ramos, A.
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel e RAMOS, A. New constraint qualifications with second-order properties in nonlinear optimization. Journal of Optimization Theory and Applications, v. 184, p. 494-506, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10957-019-01603-x. Acesso em: 24 fev. 2026.
APA
Haeser, G., & Ramos, A. (2020). New constraint qualifications with second-order properties in nonlinear optimization. Journal of Optimization Theory and Applications, 184, 494-506. doi:10.1007/s10957-019-01603-x
NLM
Haeser G, Ramos A. New constraint qualifications with second-order properties in nonlinear optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 184 494-506.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10957-019-01603-x
Vancouver
Haeser G, Ramos A. New constraint qualifications with second-order properties in nonlinear optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 184 494-506.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10957-019-01603-x
Artigo de periodico
On a conjecture in second-order optimality conditions (2018)
Behling, Roger; Haeser, Gabriel ; Ramos, Alberto; Viana, Daiana S.
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, ÁLGEBRA LINEAR, ÁLGEBRA MULTILINEAR, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEHLING, Roger et al. On a conjecture in second-order optimality conditions. Journal of Optimization Theory and Applications, v. 176, n. 3, p. 625-633, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10957-018-1229-1. Acesso em: 24 fev. 2026.
APA
Behling, R., Haeser, G., Ramos, A., & Viana, D. S. (2018). On a conjecture in second-order optimality conditions. Journal of Optimization Theory and Applications, 176( 3), 625-633. doi:10.1007/s10957-018-1229-1
NLM
Behling R, Haeser G, Ramos A, Viana DS. On a conjecture in second-order optimality conditions [Internet]. Journal of Optimization Theory and Applications. 2018 ; 176( 3): 625-633.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10957-018-1229-1
Vancouver
Behling R, Haeser G, Ramos A, Viana DS. On a conjecture in second-order optimality conditions [Internet]. Journal of Optimization Theory and Applications. 2018 ; 176( 3): 625-633.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10957-018-1229-1
Artigo de periodico
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017)
Birgin, Ernesto Julian Goldberg ; Gardenghi, J. L.; Martínez, J. M.; Santos, S. A.; Toint, Ph. L.
Source: Mathematical Programming. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, OTIMIZAÇÃO IRRESTRITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, v. 163, n. 1-2, p. 359-368, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1065-8. Acesso em: 24 fev. 2026.
APA
Birgin, E. J. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., & Toint, P. L. (2017). Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, 163( 1-2), 359-368. doi:10.1007/s10107-016-1065-8
NLM
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10107-016-1065-8
Vancouver
Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2026 fev. 24 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Non normalized affiliation