ReP USP - Resultado da busca

Artigo de periodico
A practical relative error criterion for augmented Lagrangians (2012)
Eckstein, Jonathan; Silva, Paulo J. S.
Source: Mathematical Programming. Ser. A. 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
ECKSTEIN, Jonathan e SILVA, Paulo J. S. A practical relative error criterion for augmented Lagrangians. Mathematical Programming. Ser. A, v. 141, n. 1-2, p. 319-348, 2012Tradução . . Disponível em: https://doi.org/10.1007/s10107-012-0528-9. Acesso em: 27 nov. 2025.
APA
Eckstein, J., & Silva, P. J. S. (2012). A practical relative error criterion for augmented Lagrangians. Mathematical Programming. Ser. A, 141( 1-2), 319-348. doi:10.1007/s10107-012-0528-9
NLM
Eckstein J, Silva PJS. A practical relative error criterion for augmented Lagrangians [Internet]. Mathematical Programming. Ser. A. 2012 ; 141( 1-2): 319-348.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10107-012-0528-9
Vancouver
Eckstein J, Silva PJS. A practical relative error criterion for augmented Lagrangians [Internet]. Mathematical Programming. Ser. A. 2012 ; 141( 1-2): 319-348.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10107-012-0528-9
Artigo de periodico
A relaxed constant positive linear dependence constraint qualification and applications (2011)
Andreani, Roberto; Haeser, Gabriel ; Schuverdt, María Laura ; Silva, Paulo J. S.
Source: Mathematical Programming. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, v. 135, n. 1-2, p. 255-273, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10107-011-0456-0. Acesso em: 27 nov. 2025.
APA
Andreani, R., Haeser, G., Schuverdt, M. L., & Silva, P. J. S. (2011). A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, 135( 1-2), 255-273. doi:10.1007/s10107-011-0456-0
NLM
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10107-011-0456-0
Vancouver
Andreani R, Haeser G, Schuverdt ML, Silva PJS. A relaxed constant positive linear dependence constraint qualification and applications [Internet]. Mathematical Programming. 2011 ; 135( 1-2): 255-273.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10107-011-0456-0
Artigo de periodico
Exact penalties for variational inequalities with applications to nonlinear complementary problems (2010)
André, Thiago Afonso de; Silva, Paulo J. S.
Source: Computational Optimization and Applications. 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
ANDRÉ, Thiago Afonso de e SILVA, Paulo J. S. Exact penalties for variational inequalities with applications to nonlinear complementary problems. Computational Optimization and Applications, v. 47, n. 3, p. 401-429, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10589-008-9232-3. Acesso em: 27 nov. 2025.
APA
André, T. A. de, & Silva, P. J. S. (2010). Exact penalties for variational inequalities with applications to nonlinear complementary problems. Computational Optimization and Applications, 47( 3), 401-429. doi:10.1007/s10589-008-9232-3
NLM
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementary problems [Internet]. Computational Optimization and Applications. 2010 ; 47( 3): 401-429.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
Vancouver
André TA de, Silva PJS. Exact penalties for variational inequalities with applications to nonlinear complementary problems [Internet]. Computational Optimization and Applications. 2010 ; 47( 3): 401-429.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-008-9232-3
Trabalho de evento-anais periodico
Proximal methods for nonlinear programming: double regularization and inexact subproblems (2010)
Eckstein, Jonathan; Silva, Paulo J. S.
Source: Computational Optimization and Applications. Conference titles: Brazilian Workshop on Continous Optimization. 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
ECKSTEIN, Jonathan e SILVA, Paulo J. S. Proximal methods for nonlinear programming: double regularization and inexact subproblems. 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-009-9274-1. Acesso em: 27 nov. 2025. , 2010
APA
Eckstein, J., & Silva, P. J. S. (2010). Proximal methods for nonlinear programming: double regularization and inexact subproblems. Computational Optimization and Applications. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10589-009-9274-1
NLM
Eckstein J, Silva PJS. Proximal methods for nonlinear programming: double regularization and inexact subproblems [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 167-188.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-009-9274-1
Vancouver
Eckstein J, Silva PJS. Proximal methods for nonlinear programming: double regularization and inexact subproblems [Internet]. Computational Optimization and Applications. 2010 ; 46( 2): 167-188.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-009-9274-1
Relatorio tecnico
Exact penalties for KKT systems associated to variational inequalities (2007)
André, Thiago A. de; Silva, Paulo J. S.
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
ANDRÉ, Thiago A. de e SILVA, Paulo J. S. Exact penalties for KKT systems associated to variational inequalities. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/b8e94ff9-b53b-4143-8ae1-b16dcd7e6547/1583278.pdf. Acesso em: 27 nov. 2025. , 2007
APA
André, T. A. de, & Silva, P. J. S. (2007). Exact penalties for KKT systems associated to variational inequalities. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/b8e94ff9-b53b-4143-8ae1-b16dcd7e6547/1583278.pdf
NLM
André TA de, Silva PJS. Exact penalties for KKT systems associated to variational inequalities [Internet]. 2007 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/b8e94ff9-b53b-4143-8ae1-b16dcd7e6547/1583278.pdf
Vancouver
André TA de, Silva PJS. Exact penalties for KKT systems associated to variational inequalities [Internet]. 2007 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/b8e94ff9-b53b-4143-8ae1-b16dcd7e6547/1583278.pdf
Artigo de periodico
Double-regularization proximal methods, with complementarity applications (2006)
Silva, Paulo J. S. ; Eckstein, Jonathan
Source: Computational Optimization and Applications. 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
SILVA, Paulo J. S. e ECKSTEIN, Jonathan. Double-regularization proximal methods, with complementarity applications. Computational Optimization and Applications, v. 33, n. 2, p. 115-156, 2006Tradução . . Disponível em: https://doi.org/10.1007/s10589-005-3065-0. Acesso em: 27 nov. 2025.
APA
Silva, P. J. S., & Eckstein, J. (2006). Double-regularization proximal methods, with complementarity applications. Computational Optimization and Applications, 33( 2), 115-156. doi:10.1007/s10589-005-3065-0
NLM
Silva PJS, Eckstein J. Double-regularization proximal methods, with complementarity applications [Internet]. Computational Optimization and Applications. 2006 ; 33( 2): 115-156.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-005-3065-0
Vancouver
Silva PJS, Eckstein J. Double-regularization proximal methods, with complementarity applications [Internet]. Computational Optimization and Applications. 2006 ; 33( 2): 115-156.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10589-005-3065-0
Relatorio tecnico
An inexact classical proximal point algorithm viewed as a descent method in the optimization case (1999)
Humes Júnior, Carlos; Silva, Paulo Jose da Silva e
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
HUMES JÚNIOR, Carlos e SILVA, Paulo Jose da Silva e. An inexact classical proximal point algorithm viewed as a descent method in the optimization case. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/5333dc29-d188-46ae-8920-745161d8808e/1057318.pdf. Acesso em: 27 nov. 2025. , 1999
APA
Humes Júnior, C., & Silva, P. J. da S. e. (1999). An inexact classical proximal point algorithm viewed as a descent method in the optimization case. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/5333dc29-d188-46ae-8920-745161d8808e/1057318.pdf
NLM
Humes Júnior C, Silva PJ da S e. An inexact classical proximal point algorithm viewed as a descent method in the optimization case [Internet]. 1999 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/5333dc29-d188-46ae-8920-745161d8808e/1057318.pdf
Vancouver
Humes Júnior C, Silva PJ da S e. An inexact classical proximal point algorithm viewed as a descent method in the optimization case [Internet]. 1999 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/5333dc29-d188-46ae-8920-745161d8808e/1057318.pdf

USP Schools

ReP

Filtros

Authors

Date published