ReP USP - Resultado da busca

Artigo de periodico
Derivative-free superiorization: principle and algorithm (2021)
Censor, Yair ; Garduño, Edgar ; Helou, Elias Salomão ; Herman, Garbor
Fonte: Numerical Algorithms. Unidade: ICMC
Assuntos: ANÁLISE NUMÉRICA, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CENSOR, Yair et al. Derivative-free superiorization: principle and algorithm. Numerical Algorithms, v. 88, p. 227-248, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11075-020-01038-w. Acesso em: 07 nov. 2025.
APA
Censor, Y., Garduño, E., Helou, E. S., & Herman, G. (2021). Derivative-free superiorization: principle and algorithm. Numerical Algorithms, 88, 227-248. doi:10.1007/s11075-020-01038-w
NLM
Censor Y, Garduño E, Helou ES, Herman G. Derivative-free superiorization: principle and algorithm [Internet]. Numerical Algorithms. 2021 ; 88 227-248.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s11075-020-01038-w
Vancouver
Censor Y, Garduño E, Helou ES, Herman G. Derivative-free superiorization: principle and algorithm [Internet]. Numerical Algorithms. 2021 ; 88 227-248.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s11075-020-01038-w
Artigo de periodico
Near-perfect clique-factors in sparse pseudorandom graphs (2021)
Han, Jie ; Kohayakawa, Yoshiharu ; Person, Yury
Fonte: Combinatorics, Probability & Computing. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, v. 30, n. 4, p. 570-590, 2021Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000577. Acesso em: 07 nov. 2025.
APA
Han, J., Kohayakawa, Y., & Person, Y. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, 30( 4), 570-590. doi:10.1017/S0963548320000577
NLM
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/S0963548320000577
Vancouver
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1017/S0963548320000577
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
Fonte: TOP. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1007/s11750-020-00559-w
Artigo de periodico
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming (2021)
Andreani, Roberto ; Fukuda, Ellen Hidemi ; Haeser, Gabriel ; Santos, D. O.; Secchin, Leornardo Delarmelina
Fonte: Computational Optimization and Applications. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming. Computational Optimization and Applications, v. 79, p. 633-648, 2021Tradução . . Disponível em: https://doi.org/10.1007/s10589-021-00281-8. Acesso em: 07 nov. 2025.
APA
Andreani, R., Fukuda, E. H., Haeser, G., Santos, D. O., & Secchin, L. D. (2021). On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming. Computational Optimization and Applications, 79, 633-648. doi:10.1007/s10589-021-00281-8
NLM
Andreani R, Fukuda EH, Haeser G, Santos DO, Secchin LD. On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming [Internet]. Computational Optimization and Applications. 2021 ; 79 633-648.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10589-021-00281-8
Vancouver
Andreani R, Fukuda EH, Haeser G, Santos DO, Secchin LD. On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming [Internet]. Computational Optimization and Applications. 2021 ; 79 633-648.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10589-021-00281-8
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
Fonte: European Journal of Operational Research. Unidades: IME, EP
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021
Artigo de periodico
A new sequential optimality condition for constrained nonsmooth optimization (2020)
Helou, Elias Salomão ; Santos, Sandra Augusta ; Simões, Lucas Eduardo Azevedo
Fonte: SIAM Journal on Optimization. Unidade: ICMC
Assuntos: ALGORITMOS ÚTEIS E ESPECÍFICOS, OTIMIZAÇÃO GLOBAL, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU, Elias Salomão e SANTOS, Sandra Augusta e SIMÕES, Lucas Eduardo Azevedo. A new sequential optimality condition for constrained nonsmooth optimization. SIAM Journal on Optimization, v. 30, n. 2, p. 1610-1637, 2020Tradução . . Disponível em: https://doi.org/10.1137/18M1228608. Acesso em: 07 nov. 2025.
APA
Helou, E. S., Santos, S. A., & Simões, L. E. A. (2020). A new sequential optimality condition for constrained nonsmooth optimization. SIAM Journal on Optimization, 30( 2), 1610-1637. doi:10.1137/18M1228608
NLM
Helou ES, Santos SA, Simões LEA. A new sequential optimality condition for constrained nonsmooth optimization [Internet]. SIAM Journal on Optimization. 2020 ; 30( 2): 1610-1637.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M1228608
Vancouver
Helou ES, Santos SA, Simões LEA. A new sequential optimality condition for constrained nonsmooth optimization [Internet]. SIAM Journal on Optimization. 2020 ; 30( 2): 1610-1637.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M1228608
Artigo de periodico
Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints (2020)
Helou, Elias Salomão ; Santos, Sandra Augusta ; Simões, Lucas Eduardo Azevedo
Fonte: Journal of Optimization Theory and Applications. Unidade: ICMC
Assuntos: EQUILÍBRIO, PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO RESTRITA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU, Elias Salomão e SANTOS, Sandra Augusta e SIMÕES, Lucas Eduardo Azevedo. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints. Journal of Optimization Theory and Applications, v. 185, p. 433-447, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10957-020-01658-1. Acesso em: 07 nov. 2025.
APA
Helou, E. S., Santos, S. A., & Simões, L. E. A. (2020). Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints. Journal of Optimization Theory and Applications, 185, 433-447. doi:10.1007/s10957-020-01658-1
NLM
Helou ES, Santos SA, Simões LEA. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints [Internet]. Journal of Optimization Theory and Applications. 2020 ; 185 433-447.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-020-01658-1
Vancouver
Helou ES, Santos SA, Simões LEA. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints [Internet]. Journal of Optimization Theory and Applications. 2020 ; 185 433-447.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-020-01658-1
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
Fonte: International Transactions in Operational Research. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1111/itor.12703
Artigo de periodico
Complexity and performance of an Augmented Lagrangian algorithm (2020)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Fonte: Optimization Methods and Software. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1080/10556788.2020.1746962
Artigo de periodico
New constraint qualifications with second-order properties in nonlinear optimization (2020)
Haeser, Gabriel ; Ramos, A.
Fonte: Journal of Optimization Theory and Applications. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-019-01603-x
Trabalho de evento-anais periodico
Towards an efficient augmented Lagrangian method for convex quadratic programming (2020)
Bueno, Luís Felipe ; Haeser, Gabriel ; Santos, Luiz-Rafael
Fonte: Computational Optimization and Applications. Nome do evento: Brazilian Workshop on Continuous Optimization. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Luís Felipe e HAESER, Gabriel e SANTOS, Luiz-Rafael. Towards an efficient augmented Lagrangian method for convex quadratic programming. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/s10589-019-00161-2. Acesso em: 07 nov. 2025. , 2020
APA
Bueno, L. F., Haeser, G., & Santos, L. -R. (2020). Towards an efficient augmented Lagrangian method for convex quadratic programming. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-019-00161-2
NLM
Bueno LF, Haeser G, Santos L-R. Towards an efficient augmented Lagrangian method for convex quadratic programming [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 767-800.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10589-019-00161-2
Vancouver
Bueno LF, Haeser G, Santos L-R. Towards an efficient augmented Lagrangian method for convex quadratic programming [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 767-800.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10589-019-00161-2
Artigo de periodico
Optimality conditions and global convergence for nonlinear semidefinite programming (2020)
Andreani, Roberto ; Haeser, Gabriel ; Viana, Daiana S.
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
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: 07 nov. 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 nov. 07 ] 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 nov. 07 ] Available from: https://doi.org/10.1007/s10107-018-1354-5
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
Fonte: Mathematics of Computation. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1090/mcom/3445
Trabalho de evento-anais periodico
Algebras, graphs and thetas (2019)
Silva, Marcel Kenji de Carli ; Coutinho, Gabriel ; Godsil, Chris ; Roberson, David E
Fonte: Electronic Notes in Theoretical Computer Science. Nome do evento: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli et al. Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2019.08.025. Acesso em: 07 nov. 2025. , 2019
APA
Silva, M. K. de C., Coutinho, G., Godsil, C., & Roberson, D. E. (2019). Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.025
NLM
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Vancouver
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Artigo de periodico
Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP (2019)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Fonte: SIAM Journal on Optimization. Unidade: IME
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, v. 29, n. 4, p. 2650-2676, 2019Tradução . . Disponível em: https://doi.org/10.1137/18M1193657. Acesso em: 07 nov. 2025.
APA
Silva, M. K. de C., & Tunçel, L. (2019). Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, 29( 4), 2650-2676. doi:10.1137/18M1193657
NLM
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M1193657
Vancouver
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M1193657
Artigo de periodico
New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences (2019)
Andreani, Roberto ; Haeser, Gabriel ; Secchin, Leornardo Delarmelina ; Silva, P. J. S.
Fonte: SIAM Journal on Optimization. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, TEOREMA DE EXISTÊNCIA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM Journal on Optimization, v. 29, n. 4, p. 3201-3230, 2019Tradução . . Disponível em: https://doi.org/10.1137/18M121040X. Acesso em: 07 nov. 2025.
APA
Andreani, R., Haeser, G., Secchin, L. D., & Silva, P. J. S. (2019). New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM Journal on Optimization, 29( 4), 3201-3230. doi:10.1137/18M121040X
NLM
Andreani R, Haeser G, Secchin LD, Silva PJS. New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 3201-3230.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M121040X
Vancouver
Andreani R, Haeser G, Secchin LD, Silva PJS. New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 3201-3230.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/18M121040X
Artigo de periodico
A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (2019)
Nascimento, Oliviana Xavier do ; Queiroz, Thiago Alves de ; Junqueira, Leonardo
Fonte: Annals of Operations Research. Unidade: EP
Assuntos: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO POR RESTRIÇÕES, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NASCIMENTO, Oliviana Xavier do e QUEIROZ, Thiago Alves de e JUNQUEIRA, Leonardo. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, v. 20 No 2019, p. 31 on-line, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10479-019-03466-x. Acesso em: 07 nov. 2025.
APA
Nascimento, O. X. do, Queiroz, T. A. de, & Junqueira, L. (2019). A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, 20 No 2019, 31 on-line. doi:10.1007/s10479-019-03466-x
NLM
Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
Vancouver
Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
Artigo de periodico
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (2019)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Fonte: Computational Optimization and Applications. Unidade: IME
Assuntos: 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: 07 nov. 2025.
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 2025 nov. 07 ] 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 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10589-019-00089-7
Artigo de periodico
Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications (2019)
Bueno, Luís Felipe ; Haeser, Gabriel ; Rojas, Frank Navarro
Fonte: SIAM Journal on Optimization. Unidade: IME
Assuntos: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR, TEORIA DOS JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Luís Felipe e HAESER, Gabriel e ROJAS, Frank Navarro. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM Journal on Optimization, v. 29, n. 1, p. 31-54, 2019Tradução . . Disponível em: https://doi.org/10.1137/17m1162524. Acesso em: 07 nov. 2025.
APA
Bueno, L. F., Haeser, G., & Rojas, F. N. (2019). Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM Journal on Optimization, 29( 1), 31-54. doi:10.1137/17m1162524
NLM
Bueno LF, Haeser G, Rojas FN. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications [Internet]. SIAM Journal on Optimization. 2019 ; 29( 1): 31-54.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/17m1162524
Vancouver
Bueno LF, Haeser G, Rojas FN. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications [Internet]. SIAM Journal on Optimization. 2019 ; 29( 1): 31-54.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1137/17m1162524
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: 07 nov. 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 nov. 07 ] 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 nov. 07 ] Available from: https://doi.org/10.1007/s10107-018-1290-4

Unidades USP

ReP

Filtros

Autores

Autores USP

Assuntos

Título da fonte

Agência de fomento

Indexado em

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos