Menu

Filtros : "Mathematical Programming" "BIRGIN, ERNESTO JULIAN GOLDBERG" Removido: "Financiamento NSF/NIH" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (2017)

    Birgin, Ernesto Julian Goldberg ; Gardenghi, J. L.; Martínez, J. M.; Santos, S. A.; Toint, Ph. L.

    Source: Mathematical Programming. Unidade: IME

    Subjects: OTIMIZAÇÃO NÃO LINEAR, OTIMIZAÇÃO IRRESTRITA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, v. 163, n. 1-2, p. 359-368, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10107-016-1065-8. Acesso em: 29 nov. 2025.

    • APA

      Birgin, E. J. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., & Toint, P. L. (2017). Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, 163( 1-2), 359-368. doi:10.1007/s10107-016-1065-8

    • NLM

      Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

    • Vancouver

      Birgin EJG, Gardenghi JL, Martínez JM, Santos SA, Toint PL. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models [Internet]. Mathematical Programming. 2017 ; 163( 1-2): 359-368.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1007/s10107-016-1065-8

  • Artigo de periodico

    Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (2008)

    Andreani, Roberto; Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Schuverdt, M. L.

    Source: Mathematical Programming. Unidade: IME

    Assunto: PROGRAMAÇÃO NÃO LINEAR

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      ANDREANI, Roberto et al. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Mathematical Programming, v. 111, n. 1-2, p. 5-32, 2008Tradução . . Disponível em: https://doi.org/10.1007/s10107-006-0077-1. Acesso em: 29 nov. 2025.

    • APA

      Andreani, R., Birgin, E. J. G., Martínez, J. M., & Schuverdt, M. L. (2008). Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Mathematical Programming, 111( 1-2), 5-32. doi:10.1007/s10107-006-0077-1

    • NLM

      Andreani R, Birgin EJG, Martínez JM, Schuverdt ML. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification [Internet]. Mathematical Programming. 2008 ; 111( 1-2): 5-32.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1007/s10107-006-0077-1

    • Vancouver

      Andreani R, Birgin EJG, Martínez JM, Schuverdt ML. Augmented Lagrangian methods under the constant positive linear dependence constraint qualification [Internet]. Mathematical Programming. 2008 ; 111( 1-2): 5-32.[citado 2025 nov. 29 ] Available from: https://doi.org/10.1007/s10107-006-0077-1
  • 1

1 - 2 (2 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2025