ReP USP - Resultado da busca

Artigo de periodico
Bounds on the optimal radius when covering a set with minimum radius identical disks (2024)
Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Laurain, Antoine
Source: Mathematics of Operations Research. Unidade: IME
Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e GARDENGHI, John Lenon Cardoso e LAURAIN, Antoine. Bounds on the optimal radius when covering a set with minimum radius identical disks. Mathematics of Operations Research, v. 49, n. 3, p. 1855-1889, 2024Tradução . . Disponível em: https://doi.org/10.1287/moor.2022.0104. Acesso em: 02 nov. 2024.
APA
Birgin, E. J. G., Gardenghi, J. L. C., & Laurain, A. (2024). Bounds on the optimal radius when covering a set with minimum radius identical disks. Mathematics of Operations Research, 49( 3), 1855-1889. doi:10.1287/moor.2022.0104
NLM
Birgin EJG, Gardenghi JLC, Laurain A. Bounds on the optimal radius when covering a set with minimum radius identical disks [Internet]. Mathematics of Operations Research. 2024 ; 49( 3): 1855-1889.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1287/moor.2022.0104
Vancouver
Birgin EJG, Gardenghi JLC, Laurain A. Bounds on the optimal radius when covering a set with minimum radius identical disks [Internet]. Mathematics of Operations Research. 2024 ; 49( 3): 1855-1889.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1287/moor.2022.0104
Artigo de periodico
Sensitivity analysis and tailored design of minimization diagrams (2023)
Birgin, Ernesto Julian Goldberg ; Laurain, Antoine ; Menezes, Tiago da Costa
Source: Mathematics of Computation. Unidade: IME
Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e LAURAIN, Antoine e MENEZES, Tiago da Costa. Sensitivity analysis and tailored design of minimization diagrams. Mathematics of Computation, v. 92, p. 2715-2768, 2023Tradução . . Disponível em: https://doi.org/10.1090/mcom/3839. Acesso em: 02 nov. 2024.
APA
Birgin, E. J. G., Laurain, A., & Menezes, T. da C. (2023). Sensitivity analysis and tailored design of minimization diagrams. Mathematics of Computation, 92, 2715-2768. doi:10.1090/mcom/3839
NLM
Birgin EJG, Laurain A, Menezes T da C. Sensitivity analysis and tailored design of minimization diagrams [Internet]. Mathematics of Computation. 2023 ; 92 2715-2768.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1090/mcom/3839
Vancouver
Birgin EJG, Laurain A, Menezes T da C. Sensitivity analysis and tailored design of minimization diagrams [Internet]. Mathematics of Computation. 2023 ; 92 2715-2768.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1090/mcom/3839
Artigo de periodico
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (2022)
Amaral, V. S.; Andreani, Roberto ; Birgin, Ernesto Julian Goldberg ; Marcondes, Diaulas Murize Santana Vieira ; Martínez, José Mário
Source: Journal of Global Optimization. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, MÉTODOS NUMÉRICOS, ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AMARAL, V. S. et al. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. Journal of Global Optimization, v. 84, p. 527-561, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10898-022-01168-6. Acesso em: 02 nov. 2024.
APA
Amaral, V. S., Andreani, R., Birgin, E. J. G., Marcondes, D. M. S. V., & Martínez, J. M. (2022). On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. Journal of Global Optimization, 84, 527-561. doi:10.1007/s10898-022-01168-6
NLM
Amaral VS, Andreani R, Birgin EJG, Marcondes DMSV, Martínez JM. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization [Internet]. Journal of Global Optimization. 2022 ; 84 527-561.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s10898-022-01168-6
Vancouver
Amaral VS, Andreani R, Birgin EJG, Marcondes DMSV, Martínez JM. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization [Internet]. Journal of Global Optimization. 2022 ; 84 527-561.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s10898-022-01168-6
Artigo de periodico
A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls (2021)
Birgin, Ernesto Julian Goldberg ; Laurain, Antoine ; Massambone, Rafael ; Santana, Arthur Gabriel
Source: SIAM Journal on Scientific Computing. Unidade: IME
Subjects: CÁLCULO DE VARIAÇÕES, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM Journal on Scientific Computing, v. 43, n. 3, p. A2047-A2078, 2021Tradução . . Disponível em: https://doi.org/10.1137/20M135950X. Acesso em: 02 nov. 2024.
APA
Birgin, E. J. G., Laurain, A., Massambone, R., & Santana, A. G. (2021). A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls. SIAM Journal on Scientific Computing, 43( 3), A2047-A2078. doi:10.1137/20M135950X
NLM
Birgin EJG, Laurain A, Massambone R, Santana AG. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls [Internet]. SIAM Journal on Scientific Computing. 2021 ; 43( 3): A2047-A2078.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/20M135950X
Vancouver
Birgin EJG, Laurain A, Massambone R, Santana AG. A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls [Internet]. SIAM Journal on Scientific Computing. 2021 ; 43( 3): A2047-A2078.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/20M135950X
Artigo de periodico
The use of quadratic regularization with a cubic descent condition for unconstrained optimization (2017)
Birgin, Ernesto Julian Goldberg ; Martinez, Jose Mario
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO NÃO LINEAR, ANÁLISE NUMÉRICA, CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, OTIMIZAÇÃO IRRESTRITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, Jose Mario. The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, v. 27, n. 2, p. 1049-1074, 2017Tradução . . Disponível em: https://doi.org/10.1137/16m110280x. Acesso em: 02 nov. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2017). The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, 27( 2), 1049-1074. doi:10.1137/16m110280x
NLM
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/16m110280x
Vancouver
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1137/16m110280x
Trabalho de evento-anais periodico
A Mountain Pass Lemma and its implications regarding the uniqueness of constrained minimizers (2011)
Mascarenhas, Walter Figueiredo
Source: Optimization. Conference titles: Brazilian Workshop on Continuous Optimization. Unidade: IME
Subjects: ANÁLISE GLOBAL, SEMIGRUPOS NÃO LINEARES, CÁLCULO DE VARIAÇÕES, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MASCARENHAS, Walter Figueiredo. A Mountain Pass Lemma and its implications regarding the uniqueness of constrained minimizers. Optimization. Abingdon: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1080/02331934.2010.527973. Acesso em: 02 nov. 2024. , 2011
APA
Mascarenhas, W. F. (2011). A Mountain Pass Lemma and its implications regarding the uniqueness of constrained minimizers. Optimization. Abingdon: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1080/02331934.2010.527973
NLM
Mascarenhas WF. A Mountain Pass Lemma and its implications regarding the uniqueness of constrained minimizers [Internet]. Optimization. 2011 ; 60( 8-9): 1121-1159.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1080/02331934.2010.527973
Vancouver
Mascarenhas WF. A Mountain Pass Lemma and its implications regarding the uniqueness of constrained minimizers [Internet]. Optimization. 2011 ; 60( 8-9): 1121-1159.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1080/02331934.2010.527973
Artigo de periodico
A relaxed constant positive linear dependence constraint qualification and applications (2011)
Andreani, Roberto; Haeser, Gabriel ; Schuverdt, María Laura ; Silva, Paulo J. S.
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, v. 135, n. 1-2, p. 255-273, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10107-011-0456-0. Acesso em: 02 nov. 2024.
APA
Andreani, R., Haeser, G., Schuverdt, M. L., & Silva, P. J. S. (2011). A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, 135( 1-2), 255-273. doi:10.1007/s10107-011-0456-0
NLM
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s10107-011-0456-0
Vancouver
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/s10107-011-0456-0

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation