We stand with Ukraine  

Pedro Pinto

Orcid: 0000-0002-8761-523X

Affiliations:
  • Technische Universität Darmstadt, Darmstadt, Germany


According to our database1, Pedro Pinto authored at least 6 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The alternating Halpern-Mann iteration for families of maps.
[BibTeX]
[DOI]
Paulo Firmino
,
Pedro Pinto
J. Comput. Appl. Math., 2026

2025
Proof Mining and the Convex Feasibility Problem: the Curious Case of Dykstra's Algorithm.
[BibTeX]
[DOI]
Pedro Pinto
Rev. Symb. Log., 2025

2024
Rates of asymptotic regularity for the alternating Halpern-Mann iteration.
[BibTeX]
[DOI]
Laurentiu Leustean
,
Pedro Pinto
Optim. Lett., March, 2024

2023
Strong Convergence for the Alternating Halpern-Mann Iteration in CAT(0) Spaces.
[BibTeX]
[DOI]
Bruno Dinis
,
Pedro Pinto
SIAM J. Optim., 2023

2021
On the convergence of algorithms with Tikhonov regularization terms.
[BibTeX]
[DOI]
Bruno Dinis
,
Pedro Pinto
Optim. Lett., 2021

Quantitative results on a Halpern-type proximal point algorithm.
[BibTeX]
[DOI]
Laurentiu Leustean
,
Pedro Pinto
Comput. Optim. Appl., 2021


  Loading...