Advanced search
Start date
Betweenand

John Lenon Cardoso Gardenghi

CV Lattes GoogleMyCitations ResearcherID ORCID


Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica (IMECC)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

graduation at Ciência da Computação from Universidade São Francisco (2011), master's at Computer Science from Universidade de São Paulo (2014) and doctorate at Computer Science from Universidade de São Paulo (2017). Has experience in Computer Science, acting on the following subjects: levenberg-marquardt, região de confiança, gradientes conjugados, regiões de confiança and quadrados mínimos. (Source: Lattes Curriculum)

Scholarships in Brazil
FAPESP support in numbers * Updated May 08, 2021
Total / Available in English
3 / 3   Completed scholarships in Brazil

Associated processes
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (4)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications3
Citations30
Cit./Article10.0
Data from Web of Science

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.; TOINT, PH. L.. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. MATHEMATICAL PROGRAMMING, v. 163, n. 1-2, p. 359-368, . Web of Science Citations: 23. (13/05475-7, 10/10133-0, 13/23494-9, 13/03447-6, 13/07375-0)

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.; TOINT, PH. L.. EVALUATION COMPLEXITY FOR NONLINEAR CONSTRAINED OPTIMIZATION USING UNSCALED KKT CONDITIONS AND HIGH-ORDER MODELS. SIAM JOURNAL ON OPTIMIZATION, v. 26, n. 2, p. 951-967, . Web of Science Citations: 7. (13/05475-7, 10/10133-0, 13/23494-9, 13/03447-6, 13/07375-0)

J.L.C. GARDENGHI; S.A. SANTOS. Métodos de regiões de confiança para resolução do problema de quadrados mínimos: implementação e testes numéricos. TEMA (São Carlos), v. 14, n. 1, p. 69-80, . (12/05725-0)

BIRGIN, E. G.; GARDENGHI, J. L.; MARTINEZ, J. M.; SANTOS, S. A.. On the solution of linearly constrained optimization problems by means of barrier algorithms. Top, . Web of Science Citations: 0. (12/05725-0, 18/24293-0, 13/07375-0)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

GARDENGHI, John Lenon Cardoso. Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte. Dissertação (Mestrado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (12/05725-0

GARDENGHI, John Lenon Cardoso. Complexidade em programação não linear. Tese (Doutorado) -  Instituto de Matemática e Estatística.  Universidade de São Paulo (USP).  São Paulo.  (13/23494-9

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: