ReP USP - Resultado da busca

Artigo de periodico
A notion of total dual integrality for convex, semidefinite, and extended formulations (2020)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, PROGRAMAÇÃO CONVEXA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, v. 34, n. 1, p. 470-496, 2020Tradução . . Disponível em: https://doi.org/10.1137/18M1169710. Acesso em: 10 nov. 2025.
APA
Silva, M. K. de C., & Tunçel, L. (2020). A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, 34( 1), 470-496. doi:10.1137/18M1169710
NLM
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1137/18M1169710
Vancouver
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1137/18M1169710
Artigo de periodico
Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization (2014)
Behling, Roger; Gonzaga, Clovis Caesar; Haeser, Gabriel
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: MÉTODOS DE PONTOS INTERIORES, PROGRAMAÇÃO QUADRÁTICA, PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEHLING, Roger e GONZAGA, Clovis Caesar e HAESER, Gabriel. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization. Journal of Optimization Theory and Applications, v. 162, n. 3, p. 705-717, 2014Tradução . . Disponível em: https://doi.org/10.1007/s10957-013-0492-4. Acesso em: 10 nov. 2025.
APA
Behling, R., Gonzaga, C. C., & Haeser, G. (2014). Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization. Journal of Optimization Theory and Applications, 162( 3), 705-717. doi:10.1007/s10957-013-0492-4
NLM
Behling R, Gonzaga CC, Haeser G. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization [Internet]. Journal of Optimization Theory and Applications. 2014 ; 162( 3): 705-717.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s10957-013-0492-4
Vancouver
Behling R, Gonzaga CC, Haeser G. Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization [Internet]. Journal of Optimization Theory and Applications. 2014 ; 162( 3): 705-717.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s10957-013-0492-4
Artigo de periodico
Inexact proximal point algorithms and descent methods in optimization (2005)
Humes Júnior, Carlos; Silva, Paulo J. S.
Source: Optimization and Engineering. Unidade: IME
Assunto: PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos e SILVA, Paulo J. S. Inexact proximal point algorithms and descent methods in optimization. Optimization and Engineering, v. 6, n. 2, p. 257-271, 2005Tradução . . Disponível em: https://doi.org/10.1007/s11081-005-6798-9. Acesso em: 10 nov. 2025.
APA
Humes Júnior, C., & Silva, P. J. S. (2005). Inexact proximal point algorithms and descent methods in optimization. Optimization and Engineering, 6( 2), 257-271. doi:10.1007/s11081-005-6798-9
NLM
Humes Júnior C, Silva PJS. Inexact proximal point algorithms and descent methods in optimization [Internet]. Optimization and Engineering. 2005 ; 6( 2): 257-271.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s11081-005-6798-9
Vancouver
Humes Júnior C, Silva PJS. Inexact proximal point algorithms and descent methods in optimization [Internet]. Optimization and Engineering. 2005 ; 6( 2): 257-271.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1007/s11081-005-6798-9
Trabalho de evento-anais periodico
Some inexact hybrid proximal augmented Lagrangian algorithms (2004)
Humes Júnior, Carlos; Silva, Paulo J. S. ; Svaiter, Benar Fux
Source: Numerical Algorithms. Conference titles: International Workshop on Numerical Linear Algebra, Numerical Methods for Partial Differential Equations and Optimization. Unidade: IME
Assunto: PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos e SILVA, Paulo J. S. e SVAITER, Benar Fux. Some inexact hybrid proximal augmented Lagrangian algorithms. Numerical Algorithms. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1023/B:NUMA.0000021768.30330.4b. Acesso em: 10 nov. 2025. , 2004
APA
Humes Júnior, C., Silva, P. J. S., & Svaiter, B. F. (2004). Some inexact hybrid proximal augmented Lagrangian algorithms. Numerical Algorithms. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1023/B:NUMA.0000021768.30330.4b
NLM
Humes Júnior C, Silva PJS, Svaiter BF. Some inexact hybrid proximal augmented Lagrangian algorithms [Internet]. Numerical Algorithms. 2004 ; 35( 2-4): 175-184.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1023/B:NUMA.0000021768.30330.4b
Vancouver
Humes Júnior C, Silva PJS, Svaiter BF. Some inexact hybrid proximal augmented Lagrangian algorithms [Internet]. Numerical Algorithms. 2004 ; 35( 2-4): 175-184.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1023/B:NUMA.0000021768.30330.4b

USP Schools

ReP

Filtros

Authors

Funding Agencies