Menu

Filtros : "PROGRAMAÇÃO MATEMÁTICA" "Journal of Optimization Theory and Applications" Removido: "Financiado pela FAPESP" Limpar

Filtros

Refine with date range

  • 1

1 - 4 (4 records)

  • Artigo de periodico

    Global convergence of a second-order augmented lagrangian method under an error bound condition (2025)

    Andreani, Roberto ; Haeser, Gabriel ; Prado, Renan William ; Schuverdt, Maria Laura ; Secchin, Leornardo Delarmelina

    Source: Journal of Optimization Theory and Applications. Unidade: IME

    Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR, ANÁLISE NUMÉRICA

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

    • ABNT

      ANDREANI, Roberto et al. Global convergence of a second-order augmented lagrangian method under an error bound condition. Journal of Optimization Theory and Applications, v. 206, n. artigo 54, p. 1-30, 2025Tradução . . Disponível em: https://doi.org/10.1007/s10957-025-02731-3. Acesso em: 07 nov. 2025.

    • APA

      Andreani, R., Haeser, G., Prado, R. W., Schuverdt, M. L., & Secchin, L. D. (2025). Global convergence of a second-order augmented lagrangian method under an error bound condition. Journal of Optimization Theory and Applications, 206( artigo 54), 1-30. doi:10.1007/s10957-025-02731-3

    • NLM

      Andreani R, Haeser G, Prado RW, Schuverdt ML, Secchin LD. Global convergence of a second-order augmented lagrangian method under an error bound condition [Internet]. Journal of Optimization Theory and Applications. 2025 ; 206( artigo 54): 1-30.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-025-02731-3

    • Vancouver

      Andreani R, Haeser G, Prado RW, Schuverdt ML, Secchin LD. Global convergence of a second-order augmented lagrangian method under an error bound condition [Internet]. Journal of Optimization Theory and Applications. 2025 ; 206( artigo 54): 1-30.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-025-02731-3

  • Artigo de periodico

    Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming (2022)

    Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, C. Héctor ; Silveira, Thiago Parente da

    Source: Journal of Optimization Theory and Applications. Unidade: IME

    Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR

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

    • ABNT

      ANDREANI, Roberto et al. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, v. 195, p. 42-78, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10957-022-02056-5. Acesso em: 07 nov. 2025.

    • APA

      Andreani, R., Haeser, G., Mito, L., Ramírez, C. H., & Silveira, T. P. da. (2022). Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, 195, 42-78. doi:10.1007/s10957-022-02056-5

    • NLM

      Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-022-02056-5

    • Vancouver

      Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-022-02056-5

  • Artigo de periodico

    Constraint qualifications for Karush–Kuhn–Tucker conditions in multiobjective optimization (2020)

    Haeser, Gabriel ; Ramos, Alberto

    Source: Journal of Optimization Theory and Applications. Unidade: IME

    Assunto: PROGRAMAÇÃO MATEMÁTICA

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

    • ABNT

      HAESER, Gabriel e RAMOS, Alberto. Constraint qualifications for Karush–Kuhn–Tucker conditions in multiobjective optimization. Journal of Optimization Theory and Applications, v. 187, n. 2, p. 469-487, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10957-020-01749-z. Acesso em: 07 nov. 2025.

    • APA

      Haeser, G., & Ramos, A. (2020). Constraint qualifications for Karush–Kuhn–Tucker conditions in multiobjective optimization. Journal of Optimization Theory and Applications, 187( 2), 469-487. doi:10.1007/s10957-020-01749-z

    • NLM

      Haeser G, Ramos A. Constraint qualifications for Karush–Kuhn–Tucker conditions in multiobjective optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 187( 2): 469-487.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-020-01749-z

    • Vancouver

      Haeser G, Ramos A. Constraint qualifications for Karush–Kuhn–Tucker conditions in multiobjective optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 187( 2): 469-487.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-020-01749-z

  • Artigo de periodico

    A flexible inexact-restoration method for constrained optimization (2015)

    Bueno, Luis Felipe; Haeser, Gabriel ; Martínez, José Mario

    Source: Journal of Optimization Theory and Applications. Unidade: IME

    Subjects: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, PROGRAMAÇÃO MATEMÁTICA, ANÁLISE NUMÉRICA

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

    • ABNT

      BUENO, Luis Felipe e HAESER, Gabriel e MARTÍNEZ, José Mario. A flexible inexact-restoration method for constrained optimization. Journal of Optimization Theory and Applications, v. 165, n. 1, p. 188-208, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10957-014-0572-0. Acesso em: 07 nov. 2025.

    • APA

      Bueno, L. F., Haeser, G., & Martínez, J. M. (2015). A flexible inexact-restoration method for constrained optimization. Journal of Optimization Theory and Applications, 165( 1), 188-208. doi:10.1007/s10957-014-0572-0

    • NLM

      Bueno LF, Haeser G, Martínez JM. A flexible inexact-restoration method for constrained optimization [Internet]. Journal of Optimization Theory and Applications. 2015 ; 165( 1): 188-208.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-014-0572-0

    • Vancouver

      Bueno LF, Haeser G, Martínez JM. A flexible inexact-restoration method for constrained optimization [Internet]. Journal of Optimization Theory and Applications. 2015 ; 165( 1): 188-208.[citado 2025 nov. 07 ] Available from: https://doi.org/10.1007/s10957-014-0572-0
  • 1

1 - 4 (4 records)

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