ReP USP - Resultado da busca

Artigo de periodico
On the complexity of solving feasibility problems with regularized models (2022)
Birgin, Ernesto Julian Goldberg ; Bueno, Luís Felipe ; Martínez, José Mário
Source: Optimization Methods and Software. Unidade: IME
Subjects: PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA MÉTODOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e BUENO, Luís Felipe e MARTÍNEZ, José Mário. On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, v. 37, n. 2, p. 405-424, 2022Tradução . . Disponível em: https://doi.org/10.1080/10556788.2020.1786564. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Bueno, L. F., & Martínez, J. M. (2022). On the complexity of solving feasibility problems with regularized models. Optimization Methods and Software, 37( 2), 405-424. doi:10.1080/10556788.2020.1786564
NLM
Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37( 2): 405-424.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1080/10556788.2020.1786564
Vancouver
Birgin EJG, Bueno LF, Martínez JM. On the complexity of solving feasibility problems with regularized models [Internet]. Optimization Methods and Software. 2022 ; 37( 2): 405-424.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1080/10556788.2020.1786564
Artigo de periodico
On the solution of linearly constrained optimization problems by means of barrier algorithms (2021)
Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, S. A
Source: TOP. 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
BIRGIN, Ernesto Julian Goldberg et al. On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, v. 29, n. 2, p. 417-441, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11750-020-00559-w. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2021). On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, 29( 2), 417-441. doi:10.1007/s11750-020-00559-w
NLM
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11750-020-00559-w
Vancouver
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2021 ; 29( 2): 417-441.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11750-020-00559-w
Artigo de periodico
On constrained optimization with nonconvex regularization (2021)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Ramos, Alberto
Source: Numerical Algorithms. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário e RAMOS, Alberto. On constrained optimization with nonconvex regularization. Numerical Algorithms, v. 86, n. 3, p. 1165-1188, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11075-020-00928-3. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Martínez, J. M., & Ramos, A. (2021). On constrained optimization with nonconvex regularization. Numerical Algorithms, 86( 3), 1165-1188. doi:10.1007/s11075-020-00928-3
NLM
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11075-020-00928-3
Vancouver
Birgin EJG, Martínez JM, Ramos A. On constrained optimization with nonconvex regularization [Internet]. Numerical Algorithms. 2021 ; 86( 3): 1165-1188.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11075-020-00928-3
Artigo de periodico
Metaheuristics for the online printing shop scheduling problem (2021)
Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Ronconi, Débora Pretti ; Voos, Holger
Source: European Journal of Operational Research. Unidades: IME, EP
Subjects: PROGRAMAÇÃO MATEMÁTICA, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 09 jul. 2024.
APA
Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021
NLM
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
Vancouver
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
Artigo de periodico
Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (2020)
Martin, Mateus ; Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano ; Morabito, Reinaldo ; Munari, Pedro
Source: International Transactions in Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MATEMÁTICA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTIN, Mateus et al. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, v. 27, n. 2, p. 767-793, 2020Tradução . . Disponível em: https://doi.org/10.1111/itor.12703. Acesso em: 09 jul. 2024.
APA
Martin, M., Birgin, E. J. G., Lobato, R. D., Morabito, R., & Munari, P. (2020). Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, 27( 2), 767-793. doi:10.1111/itor.12703
NLM
Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1111/itor.12703
Vancouver
Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1111/itor.12703
Artigo de periodico
A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (2020)
Birgin, Ernesto Julian Goldberg ; Jesus Filho, José Eurípedes Ferreira de; Ronconi, Débora Pretti
Source: Computers & Operations Research. Unidades: IME, EP
Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, v. 114, n. 1-14, p. 104824, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104824. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2020). A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, 114( 1-14), 104824. doi:10.1016/j.cor.2019.104824
NLM
Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104824
Vancouver
Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104824
Artigo de periodico
On the use of third-order models with fourth-order regularization for unconstrained optimization (2020)
Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, Sandra Augusta
Source: Optimization Letters. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, v. 14, n. 4, p. 815-838, 2020Tradução . . Disponível em: https://doi.org/10.1007/s11590-019-01395-z. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2020). On the use of third-order models with fourth-order regularization for unconstrained optimization. Optimization Letters, 14( 4), 815-838. doi:10.1007/s11590-019-01395-z
NLM
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11590-019-01395-z
Vancouver
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the use of third-order models with fourth-order regularization for unconstrained optimization [Internet]. Optimization Letters. 2020 ; 14( 4): 815-838.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11590-019-01395-z
Artigo de periodico
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (2020)
Birgin, Ernesto Julian Goldberg ; Gómez, Walter; Haeser, Gabriel ; Mito, Leonardo Makoto; Santos, Daiana O
Source: Computational and Applied Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, GEOMETRIA ALGÉBRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, v. 39, 2020Tradução . . Disponível em: https://doi.org/10.1007/s40314-019-0991-5. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Gómez, W., Haeser, G., Mito, L. M., & Santos, D. O. (2020). An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, 39. doi:10.1007/s40314-019-0991-5
NLM
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s40314-019-0991-5
Vancouver
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s40314-019-0991-5
Artigo de periodico
The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers (2020)
Birgin, Ernesto Julian Goldberg ; Romão, Oberlan Christo ; Ronconi, Débora Pretti
Source: International Transactions in Operational Research. Unidades: IME, EP
Assunto: PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e ROMÃO, Oberlan Christo e RONCONI, Débora Pretti. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, v. 27, n. 3, p. 1392-1418, 2020Tradução . . Disponível em: https://doi.org/10.1111/itor.12648. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Romão, O. C., & Ronconi, D. P. (2020). The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, 27( 3), 1392-1418. doi:10.1111/itor.12648
NLM
Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1111/itor.12648
Vancouver
Birgin EJG, Romão OC, Ronconi DP. The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers [Internet]. International Transactions in Operational Research. 2020 ; 27( 3): 1392-1418.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1111/itor.12648
Artigo de periodico
Complexity and performance of an Augmented Lagrangian algorithm (2020)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Source: Optimization Methods and Software. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, v. 35, n. 5, p. 885-920, 2020Tradução . . Disponível em: https://doi.org/10.1080/10556788.2020.1746962. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2020). Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, 35( 5), 885-920. doi:10.1080/10556788.2020.1746962
NLM
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Vancouver
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ; 35( 5): 885-920.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Artigo de periodico
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (2020)
Birgin, Ernesto Julian Goldberg ; Krejić, Nataša ; Martínez, José Mário
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, 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 e KREJIĆ, Nataša e MARTÍNEZ, José Mário. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, v. 89, p. 253-278, 2020Tradução . . Disponível em: https://doi.org/10.1090/mcom/3445. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Krejić, N., & Martínez, J. M. (2020). Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, 89, 253-278. doi:10.1090/mcom/3445
NLM
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1090/mcom/3445
Vancouver
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1090/mcom/3445
Artigo de periodico
Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem (2020)
Lunardi, Willian Tessaro ; Birgin, Ernesto Julian Goldberg ; Laborie, Philippe ; Ronconi, Débora Pretti ; Voos, Holger
Source: Computers & Operations Research. Unidades: IME, EP
Subjects: ALGORITMOS DE SCHEDULING, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LUNARDI, Willian Tessaro et al. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, v. 123, p. 1-20, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2020.105020. Acesso em: 09 jul. 2024.
APA
Lunardi, W. T., Birgin, E. J. G., Laborie, P., Ronconi, D. P., & Voos, H. (2020). Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, 123, 1-20. doi:10.1016/j.cor.2020.105020
NLM
Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.cor.2020.105020
Vancouver
Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.cor.2020.105020
Artigo de periodico
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (2019)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Source: Computational Optimization and Applications. Unidade: IME
Subjects: OTIMIZAÇÃO MATEMÁTICA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, José Mario. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, v. 73, n. 3, p. 707-753, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10589-019-00089-7. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2019). A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, 73( 3), 707-753. doi:10.1007/s10589-019-00089-7
NLM
Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10589-019-00089-7
Vancouver
Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10589-019-00089-7
Artigo de periodico
A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (2019)
Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano
Source: European Journal of Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.07.006. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
NLM
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Vancouver
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Artigo de periodico
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
Birgin, Ernesto Julian Goldberg ; Haeser, Gabriel ; Ramos, Alberto
Source: Computational Optimization and Applications. Unidade: IME
Assunto: 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 e HAESER, Gabriel e RAMOS, Alberto. Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Computational Optimization and Applications, v. 69, n. 1, p. 51–75, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10589-017-9937-2. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Haeser, G., & Ramos, A. (2018). Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Computational Optimization and Applications, 69( 1), 51–75. doi:10.1007/s10589-017-9937-2
NLM
Birgin EJG, Haeser G, Ramos A. Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points [Internet]. Computational Optimization and Applications. 2018 ; 69( 1): 51–75.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10589-017-9937-2
Vancouver
Birgin EJG, Haeser G, Ramos A. Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points [Internet]. Computational Optimization and Applications. 2018 ; 69( 1): 51–75.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10589-017-9937-2
Artigo de periodico
On regularization and active-set methods with complexity for constrained optimization (2018)
Birgin, Ernesto Julian Goldberg ; Martinez, J M
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, J M. On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, v. 28, n. 2, p. 1367-1395, 2018Tradução . . Disponível em: https://doi.org/10.1137/17M1127107. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2018). On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, 28( 2), 1367-1395. doi:10.1137/17M1127107
NLM
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1137/17M1127107
Vancouver
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1137/17M1127107
Artigo de periodico
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors (2018)
Birgin, Ernesto Julian Goldberg ; Krejic, N; Martínez, J. M
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO ESTOCÁSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIC, N e MARTÍNEZ, J. M. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, v. 87, n. 311, p. 1307-1326, 2018Tradução . . Disponível em: https://doi.org/10.1090/mcom/3246. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Krejic, N., & Martínez, J. M. (2018). On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, 87( 311), 1307-1326. doi:10.1090/mcom/3246
NLM
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1090/mcom/3246
Vancouver
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1090/mcom/3246
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: 09 jul. 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 jul. 09 ] 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 jul. 09 ] Available from: https://doi.org/10.1137/16m110280x
Artigo de periodico
A nonlinear programming model with implicit variables for packing ellipsoids (2017)
Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano; Martinez, J M
Source: Journal of Global Optimization. Unidade: IME
Assunto: GEOMETRIA CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano e MARTINEZ, J M. A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, v. 68, n. 3, p. 467-499, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10898-016-0483-8. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Lobato, R. D., & Martinez, J. M. (2017). A nonlinear programming model with implicit variables for packing ellipsoids. Journal of Global Optimization, 68( 3), 467-499. doi:10.1007/s10898-016-0483-8
NLM
Birgin EJG, Lobato RD, Martinez JM. A nonlinear programming model with implicit variables for packing ellipsoids [Internet]. Journal of Global Optimization. 2017 ; 68( 3): 467-499.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10898-016-0483-8
Vancouver
Birgin EJG, Lobato RD, Martinez JM. A nonlinear programming model with implicit variables for packing ellipsoids [Internet]. Journal of Global Optimization. 2017 ; 68( 3): 467-499.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s10898-016-0483-8
Artigo de periodico
On the minimization of possibly discontinuous functions by means of pointwise approximations (2017)
Birgin, Ernesto Julian Goldberg ; Krejic, N; Martinez, José Mario
Source: Optimization Letters. Unidade: IME
Subjects: FUNÇÕES DESCONTÍNUAS, OTIMIZAÇÃ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
BIRGIN, Ernesto Julian Goldberg e KREJIC, N e MARTINEZ, José Mario. On the minimization of possibly discontinuous functions by means of pointwise approximations. Optimization Letters, v. 11, n. 8, p. 1623-1637, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11590-016-1068-7. Acesso em: 09 jul. 2024.
APA
Birgin, E. J. G., Krejic, N., & Martinez, J. M. (2017). On the minimization of possibly discontinuous functions by means of pointwise approximations. Optimization Letters, 11( 8), 1623-1637. doi:10.1007/s11590-016-1068-7
NLM
Birgin EJG, Krejic N, Martinez JM. On the minimization of possibly discontinuous functions by means of pointwise approximations [Internet]. Optimization Letters. 2017 ; 11( 8): 1623-1637.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11590-016-1068-7
Vancouver
Birgin EJG, Krejic N, Martinez JM. On the minimization of possibly discontinuous functions by means of pointwise approximations [Internet]. Optimization Letters. 2017 ; 11( 8): 1623-1637.[citado 2024 jul. 09 ] Available from: https://doi.org/10.1007/s11590-016-1068-7

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration