ReP USP - Resultado da busca

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: 19 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. 19 ] 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. 19 ] Available from: https://doi.org/10.1007/s10589-021-00281-8
Artigo de periodico-carta/editorial
Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial] (2020)
Birgin, Ernesto Julian Goldberg
Fonte: Computational Optimization and Applications. 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. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial]. 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-020-00203-0. Acesso em: 19 nov. 2025. , 2020
APA
Birgin, E. J. G. (2020). Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial]. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-020-00203-0
NLM
Birgin EJG. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial] [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 615-619.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-020-00203-0
Vancouver
Birgin EJG. Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. [Editorial] [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 615-619.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-020-00203-0
Trabalho de evento-anais periodico
An Augmented Lagrangian method for quasi-equilibrium problems (2020)
Bueno, L. F; Haeser, Gabriel ; Lara, F; Rojas, Frank Navarro
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, L. F et al. An Augmented Lagrangian method for quasi-equilibrium problems. 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-020-00180-4. Acesso em: 19 nov. 2025. , 2020
APA
Bueno, L. F., Haeser, G., Lara, F., & Rojas, F. N. (2020). An Augmented Lagrangian method for quasi-equilibrium problems. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-020-00180-4
NLM
Bueno LF, Haeser G, Lara F, Rojas FN. An Augmented Lagrangian method for quasi-equilibrium problems [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 737-766.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-020-00180-4
Vancouver
Bueno LF, Haeser G, Lara F, Rojas FN. An Augmented Lagrangian method for quasi-equilibrium problems [Internet]. Computational Optimization and Applications. 2020 ; 76( 3): 737-766.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-020-00180-4
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: 19 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. 19 ] 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. 19 ] Available from: https://doi.org/10.1007/s10589-019-00161-2
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: 19 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. 19 ] 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. 19 ] Available from: https://doi.org/10.1007/s10589-019-00089-7
Artigo de periodico
A fast gradient and function sampling method for finite-max functions (2018)
Helou, Elias Salomão ; Santos, Sandra A.; Simões, Lucas E. A.
Fonte: Computational Optimization and Applications. Unidade: ICMC
Assuntos: FUNÇÕES ESPECIAIS, APROXIMAÇÃO, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, MÉTODOS ITERATIVOS, OTIMIZAÇÃO MATEMÁTICA, OTIMIZAÇÃO GLOBAL, OTIMIZAÇÃO IRRESTRITA, OTIMIZAÇÃO CONVEXA, OTIMIZAÇÃO ESTOCÁSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU, Elias Salomão e SANTOS, Sandra A. e SIMÕES, Lucas E. A. A fast gradient and function sampling method for finite-max functions. Computational Optimization and Applications, v. 71, n. 3, p. 673-717, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10589-018-0030-2. Acesso em: 19 nov. 2025.
APA
Helou, E. S., Santos, S. A., & Simões, L. E. A. (2018). A fast gradient and function sampling method for finite-max functions. Computational Optimization and Applications, 71( 3), 673-717. doi:10.1007/s10589-018-0030-2
NLM
Helou ES, Santos SA, Simões LEA. A fast gradient and function sampling method for finite-max functions [Internet]. Computational Optimization and Applications. 2018 ; 71( 3): 673-717.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-018-0030-2
Vancouver
Helou ES, Santos SA, Simões LEA. A fast gradient and function sampling method for finite-max functions [Internet]. Computational Optimization and Applications. 2018 ; 71( 3): 673-717.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-018-0030-2
Artigo de periodico
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
Birgin, Ernesto Julian Goldberg ; Haeser, Gabriel ; Ramos, Alberto
Fonte: 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: 19 nov. 2025.
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 2025 nov. 19 ] 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 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-017-9937-2
Artigo de periodico
A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (2018)
Haeser, Gabriel
Fonte: Computational Optimization and Applications. 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. A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Computational Optimization and Applications, v. 70, n. 2, p. 615–639, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10589-018-0005-3. Acesso em: 19 nov. 2025.
APA
Haeser, G. (2018). A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Computational Optimization and Applications, 70( 2), 615–639. doi:10.1007/s10589-018-0005-3
NLM
Haeser G. A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms [Internet]. Computational Optimization and Applications. 2018 ; 70( 2): 615–639.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-018-0005-3
Vancouver
Haeser G. A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms [Internet]. Computational Optimization and Applications. 2018 ; 70( 2): 615–639.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-018-0005-3
Artigo de periodico
Sequential equality-constrained optimization for nonlinear programming (2016)
Birgin, Ernesto Julian Goldberg ; Bueno, L. F; Martinez, José Mario
Fonte: Computational Optimization and Applications. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO MATEMÁTICA, PESQUISA OPERACIONAL, 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 BUENO, L. F e MARTINEZ, José Mario. Sequential equality-constrained optimization for nonlinear programming. Computational Optimization and Applications, 2016Tradução . . Disponível em: https://doi.org/10.1007/s10589-016-9849-6. Acesso em: 19 nov. 2025.
APA
Birgin, E. J. G., Bueno, L. F., & Martinez, J. M. (2016). Sequential equality-constrained optimization for nonlinear programming. Computational Optimization and Applications. doi:10.1007/s10589-016-9849-6
NLM
Birgin EJG, Bueno LF, Martinez JM. Sequential equality-constrained optimization for nonlinear programming [Internet]. Computational Optimization and Applications. 2016 ;[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-016-9849-6
Vancouver
Birgin EJG, Bueno LF, Martinez JM. Sequential equality-constrained optimization for nonlinear programming [Internet]. Computational Optimization and Applications. 2016 ;[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-016-9849-6
Artigo de periodico
Optimality properties of an Augmented Lagrangian method on infeasible problems (2015)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario; Prudente, Leandro da Fonseca
Fonte: Computational Optimization and Applications. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS, PROGRAMAÇÃO MATEMÁTICA, CIÊNCIA DA COMPUTAÇÃO
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 e PRUDENTE, Leandro da Fonseca. Optimality properties of an Augmented Lagrangian method on infeasible problems. Computational Optimization and Applications, v. 60, n. 3, p. 609-631, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10589-014-9685-5. Acesso em: 19 nov. 2025.
APA
Birgin, E. J. G., Martinez, J. M., & Prudente, L. da F. (2015). Optimality properties of an Augmented Lagrangian method on infeasible problems. Computational Optimization and Applications, 60( 3), 609-631. doi:10.1007/s10589-014-9685-5
NLM
Birgin EJG, Martinez JM, Prudente L da F. Optimality properties of an Augmented Lagrangian method on infeasible problems [Internet]. Computational Optimization and Applications. 2015 ; 60( 3): 609-631.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-014-9685-5
Vancouver
Birgin EJG, Martinez JM, Prudente L da F. Optimality properties of an Augmented Lagrangian method on infeasible problems [Internet]. Computational Optimization and Applications. 2015 ; 60( 3): 609-631.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-014-9685-5
Artigo de periodico
Second-order negative-curvature methods for box-constrained and general constrained optimization (2010)
Andreani, R.; Birgin, Ernesto Julian Goldberg ; Martinez, J. M.; Schuverdt, M. L.
Fonte: 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
ANDREANI, R. et al. Second-order negative-curvature methods for box-constrained and general constrained optimization. Computational Optimization and Applications, v. 45, n. 2, p. 209-236, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10589-009-9240-y. Acesso em: 19 nov. 2025.
APA
Andreani, R., Birgin, E. J. G., Martinez, J. M., & Schuverdt, M. L. (2010). Second-order negative-curvature methods for box-constrained and general constrained optimization. Computational Optimization and Applications, 45( 2), 209-236. doi:10.1007/s10589-009-9240-y
NLM
Andreani R, Birgin EJG, Martinez JM, Schuverdt ML. Second-order negative-curvature methods for box-constrained and general constrained optimization [Internet]. Computational Optimization and Applications. 2010 ; 45( 2): 209-236.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-009-9240-y
Vancouver
Andreani R, Birgin EJG, Martinez JM, Schuverdt ML. Second-order negative-curvature methods for box-constrained and general constrained optimization [Internet]. Computational Optimization and Applications. 2010 ; 45( 2): 209-236.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-009-9240-y
Artigo de periodico-apres/intr
This special issue is dedicated to the VII Brazilian Workshop on Continuous Optimization... [Prefácio] (2010)
Birgin, Ernesto Julian Goldberg
Fonte: Computational Optimization and Applications. 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. This special issue is dedicated to the VII Brazilian Workshop on Continuous Optimization.. [Prefácio]. 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-010-9325-7. Acesso em: 19 nov. 2025. , 2010
APA
Birgin, E. J. G. (2010). This special issue is dedicated to the VII Brazilian Workshop on Continuous Optimization.. [Prefácio]. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-010-9325-7
NLM
Birgin EJG. This special issue is dedicated to the VII Brazilian Workshop on Continuous Optimization.. [Prefácio] [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 189-191.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-010-9325-7
Vancouver
Birgin EJG. This special issue is dedicated to the VII Brazilian Workshop on Continuous Optimization.. [Prefácio] [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 189-191.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-010-9325-7
Artigo de periodico
Exact penalties for variational inequalities with applications to nonlinear complementary problems (2010)
André, Thiago Afonso de; Silva, Paulo J. S.
Fonte: 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
ANDRÉ, Thiago Afonso de e SILVA, Paulo J. S. Exact penalties for variational inequalities with applications to nonlinear complementary problems. Computational Optimization and Applications, v. 47, n. 3, p. 401-429, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10589-008-9232-3. Acesso em: 19 nov. 2025.
APA
André, T. A. de, & Silva, P. J. S. (2010). Exact penalties for variational inequalities with applications to nonlinear complementary problems. Computational Optimization and Applications, 47( 3), 401-429. doi:10.1007/s10589-008-9232-3
NLM
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementary problems [Internet]. Computational Optimization and Applications. 2010 ; 47( 3): 401-429.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
Vancouver
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementary problems [Internet]. Computational Optimization and Applications. 2010 ; 47( 3): 401-429.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
Trabalho de evento-anais periodico
Proximal methods for nonlinear programming: double regularization and inexact subproblems (2010)
Eckstein, Jonathan; Silva, Paulo J. S.
Fonte: Computational Optimization and Applications. Nome do evento: Brazilian Workshop on Continous Optimization. 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
ECKSTEIN, Jonathan e SILVA, Paulo J. S. Proximal methods for nonlinear programming: double regularization and inexact subproblems. 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-009-9274-1. Acesso em: 19 nov. 2025. , 2010
APA
Eckstein, J., & Silva, P. J. S. (2010). Proximal methods for nonlinear programming: double regularization and inexact subproblems. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-009-9274-1
NLM
Eckstein J, Silva PJS. Proximal methods for nonlinear programming: double regularization and inexact subproblems [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 167-188.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-009-9274-1
Vancouver
Eckstein J, Silva PJS. Proximal methods for nonlinear programming: double regularization and inexact subproblems [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 167-188.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-009-9274-1
Artigo de periodico
Benders, metric and cutset inequalities for multicommodity capacitated network design (2009)
Costa, Alysson Machado; Cordeau, Jean-François; Gendron, Bernard
Fonte: Computational Optimization and Applications. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Alysson Machado e CORDEAU, Jean-François e GENDRON, Bernard. Benders, metric and cutset inequalities for multicommodity capacitated network design. Computational Optimization and Applications, v. 42, n. 3, p. 371-392, 2009Tradução . . Disponível em: https://doi.org/10.1007/s10589-007-9122-0. Acesso em: 19 nov. 2025.
APA
Costa, A. M., Cordeau, J. -F., & Gendron, B. (2009). Benders, metric and cutset inequalities for multicommodity capacitated network design. Computational Optimization and Applications, 42( 3), 371-392. doi:10.1007/s10589-007-9122-0
NLM
Costa AM, Cordeau J-F, Gendron B. Benders, metric and cutset inequalities for multicommodity capacitated network design [Internet]. Computational Optimization and Applications. 2009 ; 42( 3): 371-392.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-007-9122-0
Vancouver
Costa AM, Cordeau J-F, Gendron B. Benders, metric and cutset inequalities for multicommodity capacitated network design [Internet]. Computational Optimization and Applications. 2009 ; 42( 3): 371-392.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-007-9122-0
Artigo de periodico
Nonmonotone projected gradient methods based on barrier and Euclidean distances (2007)
Auslender, Alfred; Silva, Paulo J. S. ; Teboulle, Marc
Fonte: Computational Optimization and Applications. Unidade: IME
Assuntos: OTIMIZAÇÃO RESTRITA, MÉTODOS NUMÉRICOS, OTIMIZAÇÃO CONVEXA, TEORIA ESPECTRAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AUSLENDER, Alfred e SILVA, Paulo J. S. e TEBOULLE, Marc. Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, v. 38, n. 3, p. 305-327, 2007Tradução . . Disponível em: https://doi.org/10.1007/s10589-007-9025-0. Acesso em: 19 nov. 2025.
APA
Auslender, A., Silva, P. J. S., & Teboulle, M. (2007). Nonmonotone projected gradient methods based on barrier and Euclidean distances. Computational Optimization and Applications, 38( 3), 305-327. doi:10.1007/s10589-007-9025-0
NLM
Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-007-9025-0
Vancouver
Auslender A, Silva PJS, Teboulle M. Nonmonotone projected gradient methods based on barrier and Euclidean distances [Internet]. Computational Optimization and Applications. 2007 ; 38( 3): 305-327.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-007-9025-0
Artigo de periodico
Double-regularization proximal methods, with complementarity applications (2006)
Silva, Paulo J. S. ; Eckstein, Jonathan
Fonte: 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
SILVA, Paulo J. S. e ECKSTEIN, Jonathan. Double-regularization proximal methods, with complementarity applications. Computational Optimization and Applications, v. 33, n. 2, p. 115-156, 2006Tradução . . Disponível em: https://doi.org/10.1007/s10589-005-3065-0. Acesso em: 19 nov. 2025.
APA
Silva, P. J. S., & Eckstein, J. (2006). Double-regularization proximal methods, with complementarity applications. Computational Optimization and Applications, 33( 2), 115-156. doi:10.1007/s10589-005-3065-0
NLM
Silva PJS, Eckstein J. Double-regularization proximal methods, with complementarity applications [Internet]. Computational Optimization and Applications. 2006 ; 33( 2): 115-156.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-005-3065-0
Vancouver
Silva PJS, Eckstein J. Double-regularization proximal methods, with complementarity applications [Internet]. Computational Optimization and Applications. 2006 ; 33( 2): 115-156.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1007/s10589-005-3065-0
Artigo de periodico
Large-scale active-set box-constrained optimization method with spectral projected gradients (2002)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Fonte: Computational Optimization and Applications. Unidade: IME
Assunto: MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO
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. Large-scale active-set box-constrained optimization method with spectral projected gradients. Computational Optimization and Applications, v. 23, n. 1, p. 101-125, 2002Tradução . . Disponível em: https://doi.org/10.1023/A:1019928808826. Acesso em: 19 nov. 2025.
APA
Birgin, E. J. G., & Martínez, J. M. (2002). Large-scale active-set box-constrained optimization method with spectral projected gradients. Computational Optimization and Applications, 23( 1), 101-125. doi:10.1023/A:1019928808826
NLM
Birgin EJG, Martínez JM. Large-scale active-set box-constrained optimization method with spectral projected gradients [Internet]. Computational Optimization and Applications. 2002 ; 23( 1): 101-125.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1023/A:1019928808826
Vancouver
Birgin EJG, Martínez JM. Large-scale active-set box-constrained optimization method with spectral projected gradients [Internet]. Computational Optimization and Applications. 2002 ; 23( 1): 101-125.[citado 2025 nov. 19 ] Available from: https://doi.org/10.1023/A:1019928808826

Unidades USP

ReP

Filtros

Autores

Ano de publicação

Assuntos

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