CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade de São Paulo (USP). Instituto de Matemática e Estatística (IME) (Institutional affiliation from the last research proposal) Birthplace: Argentina
graduation at Analista Universitario de Computación from Universidad de Buenos Aires (1994), graduation at Licenciatura En Ciencias de La Computación from Universidad de Buenos Aires (1995) and doctorate at Mathematics from Universidade Estadual de Campinas (1998). He is currently full professor at Universidade de São Paulo. Has experience in Computer Science, acting on the following subjects: thin films, spectral gradient method, optical constants, optimization and bound constrained problems. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
This project deals with theoretical, computational and application aspects of Optimization. The project aims at the development, theoretical analysis, implementation and application of algorithms for different aspects of Optimization, with emphasis on Continuous Optimization. The project relies on applications with which the team is familiar. Emphasis is placed on algorithms with a solid …
The focus of this proposal is the transfer of mathematical knowledge to other areas of science, technology and industry, through a structured research center specially tailored for this purpose. All mathematical knowledge is ultimately applicable, if not directly, through other areas of knowledge. In some areas the application of mathematics is almost immediate. However, the practical imp…
Conic optimization problems are mathematical models in which the objective functions are minimized (or maximized) and the variables are finite vectors subject to restrictions described by inequalities of functions and simultaneously belonging to cones. When the function is linear, the problem is called linear and otherwise, non-linear. These problems are also called convex if the objectiv…
Our group has been active in the Brazilian scientific environment for 40 years, being is sensitive to new trends and modern applications of Optimization. Over the years, this group, funded by successive FAPESP thematic projects, has made significant contributions in areas involving decomposition methods, quasi-Newton methods, sequential quadratic programming, augmented Lagrangian methods,…
This project is a continuation of previous Thematic Projects of the same research group, coordinated by Professor José Mario Martínez, the last of which the last of which up to 2011 (grant 06-53768-0). The current coordinator is Dr. Sandra Augusta Santos, nevertheless Prof. Martínez proceed integrating the team. The aim of the project is the development and the analysis of algorithms for …
(Only some records are available in English at this moment)
In recent years there has been increasing interest in very large optimization problems, such as applications related to the Internet, machine learning, telecommunications and the financial market. In many problems we don't have access to the Hessian matrix and, in large problems, the use of Hessians requires substantial computational effort. To get around this problem, we need to use firs…
The classic job shop (JS) problem consists of scheduling n jobs in an environment with m machines. Each job is made up of several operations with a linear precedence structure and has a predetermined route through the machines. The flexible job shop scheduling problem (FJS) is a generalization of the JS problem in which there may be several machines, not necessarily identical, capable of …
The present project addresses two important questions currently open in the literature regarding large-scale convex optimization using first-order moment-accelerated algorithms. The first objective is to obtain a (perhaps exact) way of smoothing completely non-smooth composite problems that has a theory compatible with practical results, as currently in imaging applications experience sho…
The classical job shop (JS) problem consists of scheduling $n$ jobs on an environment with $m$ machines. Each job is composed by several operations with a linear precedence structure and has a predetermined route through the machines. The flexible job shop scheduling (FJS) problem is a generalization of the JS problem in which there may be several machines, not necessarily identical, capa…
The inverse problem of electrical impedance tomography (EIT), also known as the inverse conductivity or Calderón's problem, is an active field of research with an extensive literature. The goal of electrical impedance tomography is to reconstruct the electrical conductivity inside a medium, using measurements of the electrical potential on the boundary obtained by applying boundary curr…
The thematic project associated with this postdoctoral project aims to develop and analyze algorithms for different aspects of optimization, with emphasis on continuous optimization. The project is based on applications with which the group is familiar. Emphasis is placed on algorithms with a solid theoretical background, which involves precise characterization of the problems addressed, …
(Only some records are available in English at this moment)
Magnetic Resonance Imaging is a linear inverse problem that can be modeled by Bayesian inference. Assuming the noise and solution's distribution leads to variational regularization problems, for which appropriate optimization methods are known. With machine learning techniques, such as diffusion and score-based models, one can estimate the solution's distribution from data. However, the v…
| 2 / 2 | Ongoing grants |
| 12 / 9 | Completed research grants |
| 3 / 3 | Ongoing scholarships in Brazil |
| 17 / 9 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 1 / 0 | Completed scholarships abroad |
| 36 / 24 | All research grants and scholarships |
| Associated processes | |