A5002999834- Optimization and Variational Analysis
- Advanced Optimization Algorithms Research
- Fixed Point Theorems Analysis
- Advanced Topology and Set Theory
- Advanced Banach Space Theory
- Numerical methods in inverse problems
- Logic, Reasoning, and Knowledge
- Computability, Logic, AI Algorithms
- Contact Mechanics and Variational Inequalities
- Approximation Theory and Sequence Spaces
- Matrix Theory and Algorithms
- Mathematical Analysis and Transform Methods
- Embedded Systems and FPGA Design
- Advanced Algebra and Logic
- Rough Sets and Fuzzy Logic
- Point processes and geometric inequalities
- Advancements in PLL and VCO Technologies
- Model-Driven Software Engineering Techniques
- Sparse and Compressive Sensing Techniques
- Embedded Systems and FPGA Applications
- Complexity and Algorithms in Graphs
- Digital Image Processing Techniques
- Advanced Differential Equations and Dynamical Systems
- Historical Art and Architecture Studies
- Mathematical Inequalities and Applications
Technical University of Darmstadt
2019-2024
Universidade Nova de Lisboa
2014-2024
Centro Regional de Derechos Humanos y Justicia de Género, Corporación Humanas
2024
University of Lisbon
2014-2022
Darmstadt University of Applied Sciences
2019
Instituto Politécnico de Lisboa
2015
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
2011
.In this paper we consider, in the general context of CAT(0) spaces, an iterative schema which alternates between Halpern and Krasnoselskii–Mann style iterations. We prove, under suitable conditions, strong convergence algorithm, benefiting from ideas proof mining program. give quantitative information form effective rates asymptotic regularity metastability (in sense Tao). Motivated by these results, are also able to obtain strongly convergent versions forward-backward Douglas–Rachford...
A generalized method of alternating resolvents was introduced by Boikanyo and Moro{\c s}anu as a way to approximate common zeros two maximal monotone operators. In this paper we analyse the strong convergence algorithm under different sets conditions. As consequence obtain effective rates metastability (in sense Terence Tao) quasi-rates asymptotic regularity. Furthermore, bypass need for sequential weak compactness in original proofs. Our quantitative results are obtained using...
Using proof-theoretical techniques, we analyze a proof by Hong-Kun Xu regarding result of strong convergence for the Halpern type proximal point algorithm. We obtain rate metastability (in sense Terence Tao) and also asymptotic regularity iteration. Furthermore, our final quantitative bypasses sequential weak compactness argument present in original proof. This elimination is reflected extraction primitive recursive information. work follows from recent results Proof Mining removal arguments.
In this paper, we provide quantitative versions of results on the asymptotic behavior nonlinear semigroups generated by an accretive operator due to O. Nevanlinna and S. Reich as well H.-K. Xu. These themselves rely a particular assumption underlying introduced A. Pazy under name “convergence condition”. Based logical techniques from “proof mining”, subdiscipline mathematical logic, derive various notions condition with modulus” which information in different ways. then also facilitate...
In this article we use techniques of proof mining to analyse a result, due Yonghong Yao and Muhammad Aslam Noor, concerning the strong convergence generalized proximal point algorithm which involves multiple parameters. Noor’s result ensures nearest projection onto set zeros operator. Our quantitative analysis, guided by Fernando Ferreira Paulo Oliva’s bounded functional interpretation, provides primitive recursive bound on metastability for algorithm, in sense Terence Tao. Furthermore,...
<p class="Abstract">This paper presents the development, implementation and characterization of a data acquisition (DAQ) system capable on-board processing acquired data. The features four differential channels, with 1 MHz bandwidth, simultaneous acquisition, 9 independent bipolar ranges, maximum sampling rate 600 kS/s. analog DAQ inputs are protected against incorrect connections even direct connection to power grid voltage. This protection ensures that can recover full operation...
We introduce the notion of a nonlinear smooth space generalizing both <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper C upper A T left-parenthesis 0 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>CAT</mml:mi> <mml:mo></mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mn>0</mml:mn> stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\operatorname {CAT}(0)</mml:annotation>...
We study the asymptotic behaviour of well-known Dykstra’s algorithm. provide an elementary proof for convergence algorithm in which standard argument is stripped to its central features and where original compactness principles are circumvented, additionally providing highly uniform computable rates metastability a fully general setting. Moreover, under additional assumption, we even able obtain effective convergence. argue that such condition actually necessary existence
We give a quantitative analysis of theorem due to Fenghui Wang and Huanhuan Cui concerning the convergence multi-parametric version proximal point algorithm. Cui's result ensures algorithm zero operator. Our provides explicit bounds on metastability (in sense Terence Tao) for asymptotic regularity iteration. Moreover, our bypasses need sequential weak compactness only requires form metric projection argument.
We apply proof mining methods to analyse a result of Boikanyo and Moro\c{s}anu on the strong convergence Halpern-type proximal point algorithm. As consequence, we obtain quantitative versions this result, providing uniform effective rates asymptotic regularity metastability.
A generalized method of alternating resolvents was introduced by Boikanyo and Moro{\c s}anu as a way to approximate common zeros two maximal monotone operators. In this paper we analyse the strong convergence algorithm under different sets conditions. As consequence obtain effective rates metastability (in sense Terence Tao) quasi-rates asymptotic regularity. Furthermore, bypass need for sequential weak compactness in original proofs. Our quantitative results are obtained using...
In this paper, we provide quantitative versions of results on the asymptotic behavior nonlinear semigroups generated by an accretive operator due to O. Nevanlinna and S. Reich as well H.-K. Xu. These themselves rely a particular assumption underlying introduced A. Pazy under name `convergence condition'. Based logical techniques from `proof mining', subdiscipline mathematical logic, derive various notions condition with modulus' which information in different ways. then also facilitate...