ReP USP - Resultado da busca

Artigo de periodico
Optimality conditions and global convergence for nonlinear semidefinite programming (2020)
Andreani, Roberto ; Haeser, Gabriel ; Viana, Daiana S.
Source: Mathematical Programming. Unidade: IME
Subjects: 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
ANDREANI, Roberto e HAESER, Gabriel e VIANA, Daiana S. Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, v. 180, n. 1-2, p. 203-235, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10107-018-1354-5. Acesso em: 08 out. 2025.
APA
Andreani, R., Haeser, G., & Viana, D. S. (2020). Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, 180( 1-2), 203-235. doi:10.1007/s10107-018-1354-5
NLM
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-018-1354-5
Vancouver
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-018-1354-5
Artigo de periodico
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (2019)
Haeser, Gabriel ; Liu, Hongcheng; Ye, Yinyu
Source: Mathematical Programming. Unidade: IME
Subjects: 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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-018-1290-4
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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

USP Schools

ReP

Filtros

Authors

Non normalized affiliation