Paulo J. S. Silva

Orcid: 0000-0003-1340-965X

Affiliations:
  • University of Campinas, Institute of Mathematics, Brazil


According to our database1, Paulo J. S. Silva authored at least 30 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods.
SIAM J. Optim., March, 2023

2022
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees.
Math. Program. Comput., 2022

Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network.
EURO J. Comput. Optim., 2022

2021
TopoMap: A 0-dimensional Homology Preserving Projection of High-Dimensional Data.
IEEE Trans. Vis. Comput. Graph., 2021

2019
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences.
SIAM J. Optim., 2019

Accelerating block coordinate descent methods with identification strategies.
Comput. Optim. Appl., 2019

2018
Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints.
SIAM J. Optim., 2018

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization.
Math. Oper. Res., 2018

2017
On second-order optimality conditions in nonlinear optimization.
Optim. Methods Softw., 2017

2016
A Cone-Continuity Constraint Qualification and Algorithmic Consequences.
SIAM J. Optim., 2016

2014
A Newton's method for the continuous quadratic knapsack problem.
Math. Program. Comput., 2014

2013
A practical relative error criterion for augmented Lagrangians.
Math. Program., 2013

A Gauss-Newton Approach for Solving Constrained Optimization Problems Using Differentiable Exact Penalties.
J. Optim. Theory Appl., 2013

2012
Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs.
SIAM J. Optim., 2012

Two New Weak Constraint Qualifications and Applications.
SIAM J. Optim., 2012

A relaxed constant positive linear dependence constraint qualification and applications.
Math. Program., 2012

2010
Proximal methods for nonlinear programming: double regularization and inexact subproblems.
Comput. Optim. Appl., 2010

Exact penalties for variational inequalities with applications to nonlinear complementarity problems.
Comput. Optim. Appl., 2010

2009
Revealing temporal genetic regulatory networks from steady-state distributions.
Proceedings of the 2009 IEEE International Workshop on Genomic Signal Processing and Statistics, 2009

2007
An Exact Algorithm for Optimal MAE Stack Filter Design.
IEEE Trans. Image Process., 2007

Rescaled proximal methods for linearly constrained convex problems.
RAIRO Oper. Res., 2007

Nonmonotone projected gradient methods based on barrier and Euclidean distances.
Comput. Optim. Appl., 2007

A feature selection approach for identification of signature genes from SAGE data.
BMC Bioinform., 2007

2006
Double-Regularization Proximal Methods, with Complementarity Applications.
Comput. Optim. Appl., 2006

2005
Feature selection algorithms to find strong genes.
Pattern Recognit. Lett., 2005

2004
The decidability of a fragment of BB'IW-logic.
Theor. Comput. Sci., 2004

Some Inexact Hybrid Proximal Augmented Lagrangian Algorithms.
Numer. Algorithms, 2004

Being Extreme in the Classroom: Experiences Teaching XP.
J. Braz. Comput. Soc., 2004

2001
Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances.
SIAM J. Optim., 2001

2000
Strict convex regularizations, proximal points and augmented lagrangians.
RAIRO Oper. Res., 2000


  Loading...