ReP USP - Resultado da busca

Artigo de periodico
Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems (2025)
Birgin, Ernesto Julian Goldberg ; Haeser, Gabriel ; Martínez, José Mário
Source: Computational Optimization and Applications. Unidade: IME
Assunto: OTIMIZAÇÃ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 MARTÍNEZ, José Mário. Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems. Computational Optimization and Applications, v. 91, p. 491-509, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10589-024-00572-w. Acesso em: 10 nov. 2025.
APA
Birgin, E. J. G., Haeser, G., & Martínez, J. M. (2025). Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems. Computational Optimization and Applications, 91, 491-509. doi:10.1007/s10589-024-00572-w
NLM
Birgin EJG, Haeser G, Martínez JM. Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems [Internet]. Computational Optimization and Applications. 2025 ; 91 491-509.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s10589-024-00572-w
Vancouver
Birgin EJG, Haeser G, Martínez JM. Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems [Internet]. Computational Optimization and Applications. 2025 ; 91 491-509.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s10589-024-00572-w
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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] 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: 10 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. 10 ] 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. 10 ] 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: 10 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. 10 ] 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. 10 ] 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: 10 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. 10 ] 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. 10 ] Available from: https://doi.org/10.1007/s10589-019-00161-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
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: 10 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. 10 ] 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. 10 ] 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
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: 10 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. 10 ] 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. 10 ] Available from: https://doi.org/10.1007/s10589-018-0005-3

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Non normalized affiliation