ReP USP - Resultado da busca

Artigo de periodico
Strong global convergence properties of algorithms for nonlinear symmetric cone programming (2025)
Andreani, Roberto ; Haeser, Gabriel ; Ramos, A.; Santos, D. O.; Secchin, Leornardo Delarmelina ; Serranoni, A.
Source: Computational Optimization and Applications. Unidade: IME
Subjects: ANÁLISE CONVEXA, ÁLGEBRAS DE JORDAN
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Strong global convergence properties of algorithms for nonlinear symmetric cone programming. Computational Optimization and Applications, v. 91, p. 397-421, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10589-024-00642-z. Acesso em: 16 jun. 2025.
APA
Andreani, R., Haeser, G., Ramos, A., Santos, D. O., Secchin, L. D., & Serranoni, A. (2025). Strong global convergence properties of algorithms for nonlinear symmetric cone programming. Computational Optimization and Applications, 91, 397-421. doi:10.1007/s10589-024-00642-z
NLM
Andreani R, Haeser G, Ramos A, Santos DO, Secchin LD, Serranoni A. Strong global convergence properties of algorithms for nonlinear symmetric cone programming [Internet]. Computational Optimization and Applications. 2025 ;91 397-421.[citado 2025 jun. 16 ] Available from: https://doi.org/10.1007/s10589-024-00642-z
Vancouver
Andreani R, Haeser G, Ramos A, Santos DO, Secchin LD, Serranoni A. Strong global convergence properties of algorithms for nonlinear symmetric cone programming [Internet]. Computational Optimization and Applications. 2025 ;91 397-421.[citado 2025 jun. 16 ] Available from: https://doi.org/10.1007/s10589-024-00642-z
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
Source: Computational Optimization and Applications. Unidade: IME
Subjects: 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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] Available from: https://doi.org/10.1007/s10589-021-00281-8
Trabalho de evento-anais periodico
An Augmented Lagrangian method for quasi-equilibrium problems (2020)
Bueno, L. F; Haeser, Gabriel ; Lara, F; Rojas, Frank Navarro
Source: Computational Optimization and Applications. Conference titles: 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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] 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
Source: Computational Optimization and Applications. Conference titles: 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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] Available from: https://doi.org/10.1007/s10589-019-00161-2
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.
Source: Computational Optimization and Applications. Unidade: ICMC
Subjects: 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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] Available from: https://doi.org/10.1007/s10589-018-0030-2
Artigo de periodico
A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (2018)
Haeser, Gabriel
Source: Computational Optimization and Applications. 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
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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] Available from: https://doi.org/10.1007/s10589-018-0005-3
Artigo de periodico
Benders, metric and cutset inequalities for multicommodity capacitated network design (2009)
Costa, Alysson Machado; Cordeau, Jean-François; Gendron, Bernard
Source: Computational Optimization and Applications. Unidade: ICMC
Subjects: 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: 16 jun. 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 jun. 16 ] 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 jun. 16 ] Available from: https://doi.org/10.1007/s10589-007-9122-0

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Indexado em

Non normalized affiliation