ReP USP - Resultado da busca

Trabalho de evento-resumo
Spectral projected gradients: reviewing ten years of applications (2012)
Birgin, Ernesto Julian Goldberg
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). 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. Spectral projected gradients: reviewing ten years of applications. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Birgin, E. J. G. (2012). Spectral projected gradients: reviewing ten years of applications. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Birgin EJG. Spectral projected gradients: reviewing ten years of applications [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Birgin EJG. Spectral projected gradients: reviewing ten years of applications [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Trabalho de evento-resumo
Polyhedral and computational results on the k-hop connected dominating set problem (2015)
Moura, Phablo Fernando Soares; Coelho, Rafael Santos; Wakabayashi, Yoshiko
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e COELHO, Rafael Santos e WAKABAYASHI, Yoshiko. Polyhedral and computational results on the k-hop connected dominating set problem. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 18 abr. 2024.
APA
Moura, P. F. S., Coelho, R. S., & Wakabayashi, Y. (2015). Polyhedral and computational results on the k-hop connected dominating set problem. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
NLM
Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Vancouver
Moura PFS, Coelho RS, Wakabayashi Y. Polyhedral and computational results on the k-hop connected dominating set problem [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Trabalho de evento-resumo
Penalizing simple constraints on augmented Lagrangian methods (2015)
Bueno, Luis Felipe; Martínez, José Mario; Birgin, Ernesto Julian Goldberg
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). 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
BUENO, Luis Felipe e MARTÍNEZ, José Mario e BIRGIN, Ernesto Julian Goldberg. Penalizing simple constraints on augmented Lagrangian methods. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 18 abr. 2024.
APA
Bueno, L. F., Martínez, J. M., & Birgin, E. J. G. (2015). Penalizing simple constraints on augmented Lagrangian methods. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
NLM
Bueno LF, Martínez JM, Birgin EJG. Penalizing simple constraints on augmented Lagrangian methods [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Vancouver
Bueno LF, Martínez JM, Birgin EJG. Penalizing simple constraints on augmented Lagrangian methods [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Trabalho de evento-resumo
Packing entering sets in kernel systems (2012)
Leston-Rey, Mario; Wakabayashi, Yoshiko
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LESTON-REY, Mario e WAKABAYASHI, Yoshiko. Packing entering sets in kernel systems. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Leston-Rey, M., & Wakabayashi, Y. (2012). Packing entering sets in kernel systems. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Leston-Rey M, Wakabayashi Y. Packing entering sets in kernel systems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Leston-Rey M, Wakabayashi Y. Packing entering sets in kernel systems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Trabalho de evento-resumo
On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods (2015)
Birgin, Ernesto Julian Goldberg ; Bueno, Luis Felipe; Martínez, José Mario
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). 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
BIRGIN, Ernesto Julian Goldberg e BUENO, Luis Felipe e MARTÍNEZ, José Mario. On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 18 abr. 2024.
APA
Birgin, E. J. G., Bueno, L. F., & Martínez, J. M. (2015). On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
NLM
Birgin EJG, Bueno LF, Martínez JM. On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Vancouver
Birgin EJG, Bueno LF, Martínez JM. On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Trabalho de evento-resumo
Low order-value approach for solving VaR-constrained optimization problems (2012)
Bueno, Luis Felipe; Birgin, Ernesto Julian Goldberg ; Krejic, Natavsa; Martinez, José Mario
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Luis Felipe et al. Low order-value approach for solving VaR-constrained optimization problems. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Bueno, L. F., Birgin, E. J. G., Krejic, N., & Martinez, J. M. (2012). Low order-value approach for solving VaR-constrained optimization problems. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Bueno LF, Birgin EJG, Krejic N, Martinez JM. Low order-value approach for solving VaR-constrained optimization problems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Bueno LF, Birgin EJG, Krejic N, Martinez JM. Low order-value approach for solving VaR-constrained optimization problems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Trabalho de evento-resumo
Deterministic and stochastic global optimization techniques for planar covering with elipses problems (2012)
Andretta, Marina ; Birgin, Ernesto Julian Goldberg
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). Unidades: ICMC, IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDRETTA, Marina e BIRGIN, Ernesto Julian Goldberg. Deterministic and stochastic global optimization techniques for planar covering with elipses problems. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Andretta, M., & Birgin, E. J. G. (2012). Deterministic and stochastic global optimization techniques for planar covering with elipses problems. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with elipses problems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Andretta M, Birgin EJG. Deterministic and stochastic global optimization techniques for planar covering with elipses problems [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Trabalho de evento-resumo
Augmented Lagrangian for nonlinear SDPs applied to the covering problem (2018)
Mito, Leonardo; Haeser, Gabriel ; Birgin, Ernesto Julian Goldberg ; Viana, Daiana; Bofill, Walter
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming - ISMP. 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
MITO, Leonardo et al. Augmented Lagrangian for nonlinear SDPs applied to the covering problem. 2018, Anais.. Philadelphia: Mathematical Optimization Society, 2018. Disponível em: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf. Acesso em: 18 abr. 2024.
APA
Mito, L., Haeser, G., Birgin, E. J. G., Viana, D., & Bofill, W. (2018). Augmented Lagrangian for nonlinear SDPs applied to the covering problem. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
NLM
Mito L, Haeser G, Birgin EJG, Viana D, Bofill W. Augmented Lagrangian for nonlinear SDPs applied to the covering problem [Internet]. Book of abstracts. 2018 ;[citado 2024 abr. 18 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
Vancouver
Mito L, Haeser G, Birgin EJG, Viana D, Bofill W. Augmented Lagrangian for nonlinear SDPs applied to the covering problem [Internet]. Book of abstracts. 2018 ;[citado 2024 abr. 18 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
Trabalho de evento-resumo
An inner-outer nonlinear programming approach for constrained quadratic matrix model updating (2015)
Andretta, Marina ; Birgin, Ernesto Julian Goldberg
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). Unidades: ICMC, 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
ANDRETTA, Marina e BIRGIN, Ernesto Julian Goldberg. An inner-outer nonlinear programming approach for constrained quadratic matrix model updating. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 18 abr. 2024.
APA
Andretta, M., & Birgin, E. J. G. (2015). An inner-outer nonlinear programming approach for constrained quadratic matrix model updating. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
NLM
Andretta M, Birgin EJG. An inner-outer nonlinear programming approach for constrained quadratic matrix model updating [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Vancouver
Andretta M, Birgin EJG. An inner-outer nonlinear programming approach for constrained quadratic matrix model updating [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Trabalho de evento-resumo
An extension of Yuan’s Lemma and its applications in optimization (2018)
Haeser, Gabriel
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming - ISMP. Unidade: IME
Assunto: OTIMIZAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel. An extension of Yuan’s Lemma and its applications in optimization. 2018, Anais.. Philadelphia: Mathematical Optimization Society, 2018. Disponível em: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf. Acesso em: 18 abr. 2024.
APA
Haeser, G. (2018). An extension of Yuan’s Lemma and its applications in optimization. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
NLM
Haeser G. An extension of Yuan’s Lemma and its applications in optimization [Internet]. Book of abstracts. 2018 ;[citado 2024 abr. 18 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
Vancouver
Haeser G. An extension of Yuan’s Lemma and its applications in optimization [Internet]. Book of abstracts. 2018 ;[citado 2024 abr. 18 ] Available from: https://ismp2018.sciencesconf.org/data/bookFullProgram.pdf
Trabalho de evento-resumo
An axiomatic duality framework for the theta body and related convex corners (2015)
Silva, Marcel Kenji de Carli ; Tuncel, Levent
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2015). Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNCEL, Levent. An axiomatic duality framework for the theta body and related convex corners. 2015, Anais.. Philadelphia: Mathematical Optimization Society, 2015. Disponível em: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf. Acesso em: 18 abr. 2024.
APA
Silva, M. K. de C., & Tuncel, L. (2015). An axiomatic duality framework for the theta body and related convex corners. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
NLM
Silva MK de C, Tuncel L. An axiomatic duality framework for the theta body and related convex corners [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Vancouver
Silva MK de C, Tuncel L. An axiomatic duality framework for the theta body and related convex corners [Internet]. Book of abstracts. 2015 ;[citado 2024 abr. 18 ] Available from: http://www.mathopt.org/ISMP-Programs/ismp2015_program.pdf
Trabalho de evento-resumo
An augmented Lagrangian method with finite termination (2012)
Prudente, Leandro; Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). 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
PRUDENTE, Leandro e BIRGIN, Ernesto Julian Goldberg e MARTINEZ, José Mario. An augmented Lagrangian method with finite termination. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Prudente, L., Birgin, E. J. G., & Martinez, J. M. (2012). An augmented Lagrangian method with finite termination. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Prudente L, Birgin EJG, Martinez JM. An augmented Lagrangian method with finite termination [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Prudente L, Birgin EJG, Martinez JM. An augmented Lagrangian method with finite termination [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Trabalho de evento-resumo
A new linear time algorithm to construct dominator trees of reducible flow graphs (2012)
Franco, Álvaro; Ferreira, Carlos Eduardo
Source: Book of abstracts. Conference titles: International Symposium on Mathematical Programming (ISMP 2012). Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FRANCO, Álvaro e FERREIRA, Carlos Eduardo. A new linear time algorithm to construct dominator trees of reducible flow graphs. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 18 abr. 2024.
APA
Franco, Á., & Ferreira, C. E. (2012). A new linear time algorithm to construct dominator trees of reducible flow graphs. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
NLM
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf
Vancouver
Franco Á, Ferreira CE. A new linear time algorithm to construct dominator trees of reducible flow graphs [Internet]. Book of abstracts. 2012 ;[citado 2024 abr. 18 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects