ReP USP - Resultado da busca

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: 03 nov. 2024. , 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 2024 nov. 03 ] 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 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/b8e94ff9-b53b-4143-8ae1-b16dcd7e6547/1583278.pdf
Relatorio tecnico
Rescaled proximal methods for linearly constrained convex problems (2004)
Silva, Paulo J. S. ; Humes Júnior, Carlos
Unidade: IME
Assunto: PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo J. S. e HUMES JÚNIOR, Carlos. Rescaled proximal methods for linearly constrained convex problems. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/f260cc8f-232e-4b39-b096-e2c66033435e/1414922.pdf. Acesso em: 03 nov. 2024. , 2004
APA
Silva, P. J. S., & Humes Júnior, C. (2004). Rescaled proximal methods for linearly constrained convex problems. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/f260cc8f-232e-4b39-b096-e2c66033435e/1414922.pdf
NLM
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. 2004 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/f260cc8f-232e-4b39-b096-e2c66033435e/1414922.pdf
Vancouver
Silva PJS, Humes Júnior C. Rescaled proximal methods for linearly constrained convex problems [Internet]. 2004 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/f260cc8f-232e-4b39-b096-e2c66033435e/1414922.pdf
Relatorio tecnico
A note on a existence of zeroes of convexly regularized sums of maximal monotone operators (2002)
Burachik, Regina Sandra; Scheimberg, Susana; Silva, Paulo J. S.
Unidade: IME
Assunto: PROGRAMAÇÃO CONVEXA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BURACHIK, Regina Sandra e SCHEIMBERG, Susana e SILVA, Paulo J. S. A note on a existence of zeroes of convexly regularized sums of maximal monotone operators. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/7f4f4295-f41e-4318-b24c-524281b6ddb8/1255424.pdf. Acesso em: 03 nov. 2024. , 2002
APA
Burachik, R. S., Scheimberg, S., & Silva, P. J. S. (2002). A note on a existence of zeroes of convexly regularized sums of maximal monotone operators. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/7f4f4295-f41e-4318-b24c-524281b6ddb8/1255424.pdf
NLM
Burachik RS, Scheimberg S, Silva PJS. A note on a existence of zeroes of convexly regularized sums of maximal monotone operators [Internet]. 2002 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/7f4f4295-f41e-4318-b24c-524281b6ddb8/1255424.pdf
Vancouver
Burachik RS, Scheimberg S, Silva PJS. A note on a existence of zeroes of convexly regularized sums of maximal monotone operators [Internet]. 2002 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/7f4f4295-f41e-4318-b24c-524281b6ddb8/1255424.pdf
Relatorio tecnico
Some inexact hybrid proximal augmented Lagrangian algorithms (2002)
Humes Júnior, Carlos; Silva, Paulo J. S. ; Svaiter, Benar Fux
Unidade: IME
Subjects: PROGRAMAÇÃO CONVEXA, OTIMIZAÇÃO RESTRITA
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. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/08fc800e-1e73-4e8e-a860-6b336ad2f5eb/1229766.pdf. Acesso em: 03 nov. 2024. , 2002
APA
Humes Júnior, C., Silva, P. J. S., & Svaiter, B. F. (2002). Some inexact hybrid proximal augmented Lagrangian algorithms. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/08fc800e-1e73-4e8e-a860-6b336ad2f5eb/1229766.pdf
NLM
Humes Júnior C, Silva PJS, Svaiter BF. Some inexact hybrid proximal augmented Lagrangian algorithms [Internet]. 2002 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/08fc800e-1e73-4e8e-a860-6b336ad2f5eb/1229766.pdf
Vancouver
Humes Júnior C, Silva PJS, Svaiter BF. Some inexact hybrid proximal augmented Lagrangian algorithms [Internet]. 2002 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/08fc800e-1e73-4e8e-a860-6b336ad2f5eb/1229766.pdf
Relatorio tecnico
A note on stability of clearing open loop policies in manufacturing systems (2000)
Silva, Paulo Jose da Silva e; Queiroz, Marcelo Gomes de ; Humes Júnior, Carlos
Unidade: IME
Assunto: PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Paulo Jose da Silva e e QUEIROZ, Marcelo Gomes de e HUMES JÚNIOR, Carlos. A note on stability of clearing open loop policies in manufacturing systems. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/49dd30bb-0bb9-4903-9e89-80125cb70065/1093902.pdf. Acesso em: 03 nov. 2024. , 2000
APA
Silva, P. J. da S. e, Queiroz, M. G. de, & Humes Júnior, C. (2000). A note on stability of clearing open loop policies in manufacturing systems. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/49dd30bb-0bb9-4903-9e89-80125cb70065/1093902.pdf
NLM
Silva PJ da S e, Queiroz MG de, Humes Júnior C. A note on stability of clearing open loop policies in manufacturing systems [Internet]. 2000 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/49dd30bb-0bb9-4903-9e89-80125cb70065/1093902.pdf
Vancouver
Silva PJ da S e, Queiroz MG de, Humes Júnior C. A note on stability of clearing open loop policies in manufacturing systems [Internet]. 2000 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/49dd30bb-0bb9-4903-9e89-80125cb70065/1093902.pdf
Relatorio tecnico
Strict convex regularizations, proximal points and augmented Lagrangians (1999)
Humes Júnior, Carlos; Silva, Paulo Jose da Silva e
Unidade: IME
Assunto: ANÁLISE NUMÉRICA
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. Strict convex regularizations, proximal points and augmented Lagrangians. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/4db4d0e8-61bf-4f78-879b-e03731268bdf/1057298.pdf. Acesso em: 03 nov. 2024. , 1999
APA
Humes Júnior, C., & Silva, P. J. da S. e. (1999). Strict convex regularizations, proximal points and augmented Lagrangians. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/4db4d0e8-61bf-4f78-879b-e03731268bdf/1057298.pdf
NLM
Humes Júnior C, Silva PJ da S e. Strict convex regularizations, proximal points and augmented Lagrangians [Internet]. 1999 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/4db4d0e8-61bf-4f78-879b-e03731268bdf/1057298.pdf
Vancouver
Humes Júnior C, Silva PJ da S e. Strict convex regularizations, proximal points and augmented Lagrangians [Internet]. 1999 ;[citado 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/4db4d0e8-61bf-4f78-879b-e03731268bdf/1057298.pdf
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: 03 nov. 2024. , 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 2024 nov. 03 ] 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 2024 nov. 03 ] Available from: https://repositorio.usp.br/directbitstream/5333dc29-d188-46ae-8920-745161d8808e/1057318.pdf

USP Schools

ReP

Filtros

Authors