Laurentiu Leustean

Orcid: 0000-0003-4154-8761

Affiliations:
  • University of Bucharest, Romania
  • Technische Universität Darmstadt, Germany


According to our database1, Laurentiu Leustean authored at least 15 papers between 2003 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rates of asymptotic regularity for the alternating Halpern-Mann iteration.
Optim. Lett., March, 2024

2023
On Modified Halpern and Tikhonov-Mann Iterations.
J. Optim. Theory Appl., April, 2023

2022
Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration.
Optim. Methods Softw., 2022

2021
Quantitative results on a Halpern-type proximal point algorithm.
Comput. Optim. Appl., 2021

2020
Preface.
Fundam. Informaticae, 2020

2018
An abstract proximal point algorithm.
J. Glob. Optim., 2018

2014
An application of proof mining to nonlinear iterations.
Ann. Pure Appl. Log., 2014

2007
Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings.
J. Univers. Comput. Sci., 2007

2006
Baer Extensions of BL-algebras.
J. Multiple Valued Log. Soft Comput., 2006

Proof Mining in R-trees and Hyperbolic Spaces.
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

2005
Sheaf representations of BL-algebras.
Soft Comput., 2005

Pseudo-hoops.
J. Multiple Valued Log. Soft Comput., 2005

Approximate fixed points of nonexpansive functions in product spaces.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005

2003
Compact representations of BL-algebras.
Arch. Math. Log., 2003

Certifying Optimality of State Estimation Programs.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003


  Loading...