default search action
Paulo J. S. Silva
Person information
- affiliation: University of Campinas, Institute of Mathematics, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j29]Felipe Atenas
, Claudia A. Sagastizábal
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods. SIAM J. Optim. 33(1): 89-115 (2023) - 2022
- [j28]Luis Gustavo Nonato, Pedro S. Peixoto
Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network. EURO J. Comput. Optim. 10: 100025 (2022) - [j27]Roberto Andreani, Gabriel Haeser, María Laura Schuverdt, Leonardo D. Secchin
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees. Math. Program. Comput. 14(1): 121-146 (2022) - 2021
- [j26]Harish Doraiswamy, Julien Tierny, Paulo J. S. Silva
TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Data. IEEE Trans. Vis. Comput. Graph. 27(2): 561-571 (2021) - 2020
- [i1]Harish Doraiswamy, Julien Tierny, Paulo J. S. Silva, Luis Gustavo Nonato, Cláudio T. Silva:
TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Data. CoRR abs/2009.01512 (2020)
2010 – 2019
- 2019
- [j25]Ronaldo Lopes, Sandra A. Santos
Accelerating block coordinate descent methods with identification strategies. Comput. Optim. Appl. 72(3): 609-640 (2019) - [j24]Roberto Andreani, Gabriel Haeser, Leonardo D. Secchin
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences. SIAM J. Optim. 29(4): 3201-3230 (2019) - 2018
- [j23]Roberto Andreani, José Mario Martínez
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization. Math. Oper. Res. 43(3): 693-717 (2018) - [j22]Roberto Andreani, Leonardo D. Secchin
Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 28(3): 2574-2600 (2018) - 2017
- [j21]Roberto Andreani, Roger Behling, Gabriel Haeser
On second-order optimality conditions in nonlinear optimization. Optim. Methods Softw. 32(1): 22-38 (2017) - 2016
- [j20]Roberto Andreani, José Mario Martínez
A Cone-Continuity Constraint Qualification and Algorithmic Consequences. SIAM J. Optim. 26(1): 96-110 (2016) - 2014
- [j19]Roberto Cominetti
A Newton's method for the continuous quadratic knapsack problem. Math. Program. Comput. 6(2): 151-169 (2014) - 2013
- [j18]Roberto Andreani, Ellen H. Fukuda, Paulo J. S. Silva
A Gauss-Newton Approach for Solving Constrained Optimization Problems Using Differentiable Exact Penalties. J. Optim. Theory Appl. 156(2): 417-449 (2013) - [j17]Jonathan Eckstein
A practical relative error criterion for augmented Lagrangians. Math. Program. 141(1-2): 319-348 (2013) - 2012
- [j16]Roberto Andreani, Gabriel Haeser
A relaxed constant positive linear dependence constraint qualification and applications. Math. Program. 135(1-2): 255-273 (2012) - [j15]Roberto Andreani, Gabriel Haeser
Two New Weak Constraint Qualifications and Applications. SIAM J. Optim. 22(3): 1109-1135 (2012) - [j14]Ellen H. Fukuda, Paulo J. S. Silva
Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs. SIAM J. Optim. 22(4): 1607-1633 (2012) - 2010
- [j13]Jonathan Eckstein, Paulo J. S. Silva
Proximal methods for nonlinear programming: double regularization and inexact subproblems. Comput. Optim. Appl. 46(2): 279-304 (2010) - [j12]Thiago A. de André, Paulo J. S. Silva
Exact penalties for variational inequalities with applications to nonlinear complementarity problems. Comput. Optim. Appl. 47(3): 401-429 (2010)
2000 – 2009
- 2009
- [c1]David Correa Martins Jr., Evaldo Araújo de Oliveira, Paulo J. S. Silva
Revealing temporal genetic regulatory networks from steady-state distributions. GENSiPS 2009: 1-4 - 2007
- [j11]Junior Barrera
A feature selection approach for identification of signature genes from SAGE data. BMC Bioinform. 8 (2007) - [j10]Alfred Auslender, Paulo J. S. Silva
Nonmonotone projected gradient methods based on barrier and Euclidean distances. Comput. Optim. Appl. 38(3): 305-327 (2007) - [j9]Paulo J. S. Silva
Rescaled proximal methods for linearly constrained convex problems. RAIRO Oper. Res. 41(4): 367-380 (2007) - [j8]Domingos Dellamonica Jr., Paulo J. S. Silva
An Exact Algorithm for Optimal MAE Stack Filter Design. IEEE Trans. Image Process. 16(2): 453-462 (2007) - 2006
- [j7]Paulo J. S. Silva
Double-Regularization Proximal Methods, with Complementarity Applications. Comput. Optim. Appl. 33(2-3): 115-156 (2006) - 2005
- [j6]Paulo J. S. Silva
Feature selection algorithms to find strong genes. Pattern Recognit. Lett. 26(10): 1444-1453 (2005) - 2004
- [j5]Alfredo Goldman
Being Extreme in the Classroom: Experiences Teaching XP. J. Braz. Comput. Soc. 10(2): 5-21 (2004) - [j4]Carlos Humes Jr., Paulo J. S. Silva
Some Inexact Hybrid Proximal Augmented Lagrangian Algorithms. Numer. Algorithms 35(2-4): 175-184 (2004) - [j3]Sabine Broda
The decidability of a fragment of BB'IW-logic. Theor. Comput. Sci. 318(3): 373-408 (2004) - 2001
- [j2]Paulo José da Silva e Silva
Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances. SIAM J. Optim. 12(1): 238-261 (2001) - 2000
- [j1]Carlos Humes Jr., Paulo José da Silva e Silva:
Strict convex regularizations, proximal points and augmented lagrangians. RAIRO Oper. Res. 34(3): 283-303 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: