ReP USP - Resultado da busca

Artigo de periodico
Weak notions of nondegeneracy in nonlinear semidefinite programming (2024)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo Makoto ; Ramírez, Héctor
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, v. 205, n. 1-2, p. 1-32, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10107-023-01970-4. Acesso em: 30 ago. 2024.
APA
Andreani, R., Haeser, G., Mito, L. M., & Ramírez, H. (2024). Weak notions of nondegeneracy in nonlinear semidefinite programming. Mathematical Programming, 205( 1-2), 1-32. doi:10.1007/s10107-023-01970-4
NLM
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Vancouver
Andreani R, Haeser G, Mito LM, Ramírez H. Weak notions of nondegeneracy in nonlinear semidefinite programming [Internet]. Mathematical Programming. 2024 ; 205( 1-2): 1-32.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s10107-023-01970-4
Artigo de periodico
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications (2023)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor
Source: Set-Valued and Variational Analysis. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO GLOBAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications. Set-Valued and Variational Analysis, v. 31, n. artigo 3, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s11228-023-00666-3. Acesso em: 30 ago. 2024.
APA
Andreani, R., Haeser, G., Mito, L., & Ramírez, H. (2023). Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications. Set-Valued and Variational Analysis, 31( artigo 3), 1-27. doi:10.1007/s11228-023-00666-3
NLM
Andreani R, Haeser G, Mito L, Ramírez H. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications [Internet]. Set-Valued and Variational Analysis. 2023 ; 31( artigo 3): 1-27.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11228-023-00666-3
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H. Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications [Internet]. Set-Valued and Variational Analysis. 2023 ; 31( artigo 3): 1-27.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11228-023-00666-3
Trabalho de evento-resumo
Constant rank constraint qualification for nonlinear second-order cone programming (2023)
Haeser, Gabriel ; Andreani, Roberto ; Mito, Leonardo Makoto ; Ramírez, Héctor ; Silveira, Thiago Parente da
Source: Abstracts. Conference titles: Conference on Optimization - OP23. 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
HAESER, Gabriel et al. Constant rank constraint qualification for nonlinear second-order cone programming. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 30 ago. 2024.
APA
Haeser, G., Andreani, R., Mito, L. M., Ramírez, H., & Silveira, T. P. da. (2023). Constant rank constraint qualification for nonlinear second-order cone programming. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
NLM
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 ago. 30 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Vancouver
Haeser G, Andreani R, Mito LM, Ramírez H, Silveira TP da. Constant rank constraint qualification for nonlinear second-order cone programming [Internet]. Abstracts. 2023 ;[citado 2024 ago. 30 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf
Artigo de periodico
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition (2023)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, Héctor; Silveira, Thiago Parente da
Source: Mathematical Programming. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, v. 202, p. 473-513, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10107-023-01942-8. Acesso em: 30 ago. 2024.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, H., & Silveira, T. P. da. (2023). First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, 202, 473-513. doi:10.1007/s10107-023-01942-8
NLM
Andreani R, Haeser G, Mito L, Ramírez H, Silveira TP da. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition [Internet]. Mathematical Programming. 2023 ; 202 473-513.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H, Silveira TP da. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition [Internet]. Mathematical Programming. 2023 ; 202 473-513.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s10107-023-01942-8
Artigo de periodico
On optimality conditions for nonlinear conic programming (2022)
Andreani, Roberto ; Gómez, Walter ; Haeser, Gabriel ; Mito, Leonardo ; Ramos, Alberto
Source: Mathematics of Operations Research. Unidade: IME
Subjects: PESQUISA OPERACIONAL, 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
ANDREANI, Roberto et al. On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, v. 47, n. 3, p. 2160-2185, 2022Tradução . . Disponível em: https://doi.org/10.1287/moor.2021.1203. Acesso em: 30 ago. 2024.
APA
Andreani, R., Gómez, W., Haeser, G., Mito, L., & Ramos, A. (2022). On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, 47( 3), 2160-2185. doi:10.1287/moor.2021.1203
NLM
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Vancouver
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Artigo de periodico
Erratum to New constraint qualifications and optimality conditions for second order cone programs (2022)
Andreani, Roberto ; Fukuda, Ellen Hidemi ; Haeser, Gabriel ; Ramírez, H; Santos, Daiana O; Silva, Paulo J. S. ; Silveira, Thiago Parente da
Source: Set-Valued and Varational Analysis. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Erratum to New constraint qualifications and optimality conditions for second order cone programs. Set-Valued and Varational Analysis, v. 30, n. 1, p. 329-333, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11228-018-0487-2. Acesso em: 30 ago. 2024.
APA
Andreani, R., Fukuda, E. H., Haeser, G., Ramírez, H., Santos, D. O., Silva, P. J. S., & Silveira, T. P. da. (2022). Erratum to New constraint qualifications and optimality conditions for second order cone programs. Set-Valued and Varational Analysis, 30( 1), 329-333. doi:10.1007/s11228-018-0487-2
NLM
Andreani R, Fukuda EH, Haeser G, Ramírez H, Santos DO, Silva PJS, Silveira TP da. Erratum to New constraint qualifications and optimality conditions for second order cone programs [Internet]. Set-Valued and Varational Analysis. 2022 ; 30( 1): 329-333.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11228-018-0487-2
Vancouver
Andreani R, Fukuda EH, Haeser G, Ramírez H, Santos DO, Silva PJS, Silveira TP da. Erratum to New constraint qualifications and optimality conditions for second order cone programs [Internet]. Set-Valued and Varational Analysis. 2022 ; 30( 1): 329-333.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11228-018-0487-2
Artigo de periodico
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (2022)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, H. ; Santos, D. O.; Silveira, ‪Thiago Parente da
Source: Optimization Letters. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, v. 16, n. 2, p. 589-610, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11590-021-01737-w. Acesso em: 30 ago. 2024.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, H., Santos, D. O., & Silveira, ‪T. P. da. (2022). Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, 16( 2), 589-610. doi:10.1007/s11590-021-01737-w
NLM
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira ‪TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11590-021-01737-w
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira ‪TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s11590-021-01737-w
Artigo de periodico
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (2020)
Birgin, Ernesto Julian Goldberg ; Gómez, Walter; Haeser, Gabriel ; Mito, Leonardo Makoto; Santos, Daiana O
Source: Computational and Applied Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, GEOMETRIA ALGÉBRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, v. 39, 2020Tradução . . Disponível em: https://doi.org/10.1007/s40314-019-0991-5. Acesso em: 30 ago. 2024.
APA
Birgin, E. J. G., Gómez, W., Haeser, G., Mito, L. M., & Santos, D. O. (2020). An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem. Computational and Applied Mathematics, 39. doi:10.1007/s40314-019-0991-5
NLM
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s40314-019-0991-5
Vancouver
Birgin EJG, Gómez W, Haeser G, Mito LM, Santos DO. An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem [Internet]. Computational and Applied Mathematics. 2020 ; 39[citado 2024 ago. 30 ] Available from: https://doi.org/10.1007/s40314-019-0991-5
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: 30 ago. 2024. , 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 2024 ago. 30 ] 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 2024 ago. 30 ] Available from: https://doi.org/10.1007/s10589-020-00180-4

USP Schools

ReP

Filtros

Authors

Subjects

Source title

Funding Agencies

Non normalized affiliation