New talk in the LOS Seminar

Laurențiu Leuștean will give on Tuesday, June 14, 2021 at 14:00 the talk Proof mining and applications in nonlinear analysis and convex optimization in the LOS seminar.


New talk in the Logic Seminar

Gabriel Ciobanu (Alexandru Ioan Cuza University of Iași and Romanian Academy (ICS)) will give on Thursday, June 3, 2021 at 10:00 the talk Choice principles and infinities for finitely supported structures in the Logic Seminar.

New talk in the LOS Seminar

Andrei Sipoş will give on Tuesday, June 1, 2021 at 14:00 the talk On abstract proximal point algorithms and related concepts in the LOS seminar.




New talk in the Logic Seminar


Cătălin Dima (University Paris-Est Créteil) will give on Thursday, May 27, 2021 at 10:00 the talk Rational Synthesis in the Commons with Careless and Careful Agents in the Logic Seminar.



New talk in the LOS Seminar


Andrei Pătraşcu will give on Tuesday, May 18, 2021 at 14:00 the talk On complexity of the first-order algorithms for convex optimization. Part II in the LOS seminar.




New paper in Numerical Functional Analysis and Optimization

Andrei Sipoş published the paper Construction of Fixed Points of Asymptotically Nonexpansive Mappings in Uniformly Convex Hyperbolic Spaces in Numerical Functional Analysis and Optimization.



Second prize in the Student Scientific Communications Session

Horațiu Cheval won the second prize in the Master Section of the Student Scientific Communications Session - FMI (UB), organized on May 8, 2021, with the presentation General metatheorems in proof mining.



New talk in the Logic Seminar


Bruno Dinis (University of Lisbon) will give on Thursday, May 13, 2021 at 10:00 the talk Functional interpretations for nonstandard arithmetic in the Logic Seminar.




New talk in the LOS Seminar


Andrei Pătraşcu will give on Tuesday, May 11, 2021 at 14:00 the talk On complexity of the first-order algorithms for convex optimization in the LOS seminar.




New talk in the Logic Seminar


Gabriel Istrate (West University of Timişoara) will give on Thursday, April 22, 2021 at 10:00 the talk Kernelization, Proof Complexity and Social Choice in the Logic Seminar.



New paper in Journal of Mathematical Analysis and Applications

Andrei Sipoş published the paper Rates of metastability for iterations on the unit interval in Journal of Mathematical Analysis and Applications.



New talk in the LOS Seminar



Cristi Rusu will give on Tuesday, April 20, 2021 at 14:00 the talk Learning orthonormal dictionaries as efficient as the Fast Fourier Transform in the LOS seminar.



New talk in the Logic Seminar

Dorel Lucanu (Alexandru Ioan Cuza University of Iaşi) will give on Thursday, April 15, 2021 at 10:00 the talk (Co)Initial (Co)Algebra Semantics in Matching Logic in the Logic Seminar.



New paper in Optimization

Andrei Sipoş published the paper Revisiting jointly firmly nonexpansive families of mappings in Optimization.





New talk in the Logic Seminar

Gheorghe Ştefănescu (University of Bucharest) will give on Thursday, April 8, 2021 at 10:00 the talk Adaptive Virtual Organisms: A Compositional Model for Complex Hardware-software Binding in the Logic Seminar.



First talk in the LOS Seminar

Florin Stoican will give on Tuesday, April 6, 2021 at 14:00 the talk About the use of B-spline functions in motion planning in the new LOS Seminar.



New paper in Computational Optimization and Applications

Laurenţiu Leuştean published (in collaboration with Pedro Pinto) the paper Quantitative results on a Halpern-type proximal point algorithm in Computational Optimization and Applications.



New paper in Optimization Letters

Andrei Pătraşcu and Paul Irofti published the paper Stochastic proximal splitting algorithm for composite minimization in Optimization Letters.



New arxiv preprint

Cristi Rusu and Paul Irofti published the preprint Efficient and Parallel Separable Dictionary Learning on arxiv.





DDNET: a new research grant

The DDNET (12PD/2020) research grant is implemented in the LOS Research Center.



Graphomally: a new research grant

The Graphomaly (287PED/2020) research grant is implemented in the LOS Research Center.



New preprint on arxiv


Andrei Pătraşcu and Paul Irofti published the preprint Stochastic proximal splitting for composite minimizationon on arXiv.