ReP USP - Resultado da busca

Artigo de periodico
On achieving strong necessary second-order properties in nonlinear programming (2024)
Fischer, Andreas ; Haeser, Gabriel ; Silveira, Thiago Parente da
Source: Pacific Journal of Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO NÃO LINEAR, CONVERGÊNCIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FISCHER, Andreas e HAESER, Gabriel e SILVEIRA, Thiago Parente da. On achieving strong necessary second-order properties in nonlinear programming. Pacific Journal of Optimization, v. 20, n. 4, p. 683-697, 2024Tradução . . Disponível em: https://doi.org/10.61208/pjo-2024-002. Acesso em: 22 abr. 2026.
APA
Fischer, A., Haeser, G., & Silveira, T. P. da. (2024). On achieving strong necessary second-order properties in nonlinear programming. Pacific Journal of Optimization, 20( 4), 683-697. doi:10.61208/pjo-2024-002
NLM
Fischer A, Haeser G, Silveira TP da. On achieving strong necessary second-order properties in nonlinear programming [Internet]. Pacific Journal of Optimization. 2024 ; 20( 4): 683-697.[citado 2026 abr. 22 ] Available from: https://doi.org/10.61208/pjo-2024-002
Vancouver
Fischer A, Haeser G, Silveira TP da. On achieving strong necessary second-order properties in nonlinear programming [Internet]. Pacific Journal of Optimization. 2024 ; 20( 4): 683-697.[citado 2026 abr. 22 ] Available from: https://doi.org/10.61208/pjo-2024-002
Artigo de periodico
Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds (2024)
Andreani, Roberto ; Couto, Kelvin R. ; Ferreira, Orizon Pereira ; Haeser, Gabriel
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, ANÁLISE NUMÉRICA, 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. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, v. 34, n. 2, p. 1799-1825, 2024Tradução . . Disponível em: https://doi.org/10.1137/23M1582382. Acesso em: 22 abr. 2026.
APA
Andreani, R., Couto, K. R., Ferreira, O. P., & Haeser, G. (2024). Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, 34( 2), 1799-1825. doi:10.1137/23M1582382
NLM
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1137/23M1582382
Vancouver
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1137/23M1582382
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: 22 abr. 2026.
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 2026 abr. 22 ] 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 2026 abr. 22 ] Available from: https://doi.org/10.1287/moor.2021.1203
Artigo de periodico
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (2020)
Birgin, Ernesto Julian Goldberg ; Krejić, Nataša ; Martínez, José Mário
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, 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 KREJIĆ, Nataša e MARTÍNEZ, José Mário. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, v. 89, p. 253-278, 2020Tradução . . Disponível em: https://doi.org/10.1090/mcom/3445. Acesso em: 22 abr. 2026.
APA
Birgin, E. J. G., Krejić, N., & Martínez, J. M. (2020). Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, 89, 253-278. doi:10.1090/mcom/3445
NLM
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1090/mcom/3445
Vancouver
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1090/mcom/3445
Artigo de periodico
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors (2018)
Birgin, Ernesto Julian Goldberg ; Krejic, N; Martínez, J. M
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO ESTOCÁSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIC, N e MARTÍNEZ, J. M. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, v. 87, n. 311, p. 1307-1326, 2018Tradução . . Disponível em: https://doi.org/10.1090/mcom/3246. Acesso em: 22 abr. 2026.
APA
Birgin, E. J. G., Krejic, N., & Martínez, J. M. (2018). On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, 87( 311), 1307-1326. doi:10.1090/mcom/3246
NLM
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1090/mcom/3246
Vancouver
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1090/mcom/3246
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: 22 abr. 2026.
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 2026 abr. 22 ] 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 2026 abr. 22 ] Available from: https://doi.org/10.1007/s10589-018-0005-3
Artigo de periodico
Some theoretical limitations of second-order algorithms for smooth constrained optimization (2018)
Haeser, Gabriel
Source: Operations Research Letters. 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. Some theoretical limitations of second-order algorithms for smooth constrained optimization. Operations Research Letters, v. 46, n. 3, p. 295-299, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.orl.2018.02.007. Acesso em: 22 abr. 2026.
APA
Haeser, G. (2018). Some theoretical limitations of second-order algorithms for smooth constrained optimization. Operations Research Letters, 46( 3), 295-299. doi:10.1016/j.orl.2018.02.007
NLM
Haeser G. Some theoretical limitations of second-order algorithms for smooth constrained optimization [Internet]. Operations Research Letters. 2018 ; 46( 3): 295-299.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1016/j.orl.2018.02.007
Vancouver
Haeser G. Some theoretical limitations of second-order algorithms for smooth constrained optimization [Internet]. Operations Research Letters. 2018 ; 46( 3): 295-299.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1016/j.orl.2018.02.007
Artigo de periodico
On augmented Lagrangian methods with general lower-level constraints (2008)
Andreani, R; Birgin, Ernesto Julian Goldberg ; Martínez, J. M; Schuverdt, M. L
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PROGRAMAÇÃO LINEAR, MÉTODOS DIRETOS PARA INVERSÃO DE MATRIZES, MÉTODOS DIRETOS PARA SISTEMAS LINEARES, 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, R et al. On augmented Lagrangian methods with general lower-level constraints. SIAM Journal on Optimization, v. 18, n. 4, p. 1286-1309, 2008Tradução . . Disponível em: https://doi.org/10.1137/060654797. Acesso em: 22 abr. 2026.
APA
Andreani, R., Birgin, E. J. G., Martínez, J. M., & Schuverdt, M. L. (2008). On augmented Lagrangian methods with general lower-level constraints. SIAM Journal on Optimization, 18( 4), 1286-1309. doi:10.1137/060654797
NLM
Andreani R, Birgin EJG, Martínez JM, Schuverdt ML. On augmented Lagrangian methods with general lower-level constraints [Internet]. SIAM Journal on Optimization. 2008 ; 18( 4): 1286-1309.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1137/060654797
Vancouver
Andreani R, Birgin EJG, Martínez JM, Schuverdt ML. On augmented Lagrangian methods with general lower-level constraints [Internet]. SIAM Journal on Optimization. 2008 ; 18( 4): 1286-1309.[citado 2026 abr. 22 ] Available from: https://doi.org/10.1137/060654797

USP Schools

ReP

Filtros

Authors

Subjects

Source title

Funding Agencies

Non normalized affiliation