Anis Hamadouche

Anis Hamadouche

Auto-generated profile, based on publicly available information

Anis Hamadouche

School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS, UK

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2017 in Journal of Process Control
Verified
Journal Article
Closed access
AHAnis Hamadouche
Anis Hamadouche
AKAbdelmalek Kouadri
Abdelmalek Kouadri
ABAzzeddine Bakdi
Azzeddine Bakdi

19 January 2024 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
AHAnis Hamadouche
Anis Hamadouche
YWYun Wu
Yun Wu
AWAndrew M. Wallace
Andrew M. Wallace
JMJoao F. C. Mota
Joao F. C. Mota
We analyze the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We generalize the deterministic analysis to the quasi-Fejér case and quantify the uncertainty incurred from approximate computing and early termination errors. We propose new probabilistic tighter bounds that we use to verify a simulated Model Predictive Control (MPC) with sparse controls problem solved with early termination, reduced precision, and proximal errors. We also show how the probabilistic bounds are more suitable than the deterministic ones for algorithm verification and more accurate for application performance guarantees. Under mild statistical assumptions, we also prove that some cumulative error terms follow a martingale property. And conforming to observations, e.g., in [M. Schmidt, N. L. Roux, and F. R. Bach, Convergence rates of inexact proximal-gradient methods for convex optimization, in Advances in Neural Information Processing Systems, 2011, pp. 1458–1466], we also show how the acceleration of the algorithm amplifies the gradient and proximal computational errors.

1 December 2015
Verified
Conference Paper
Closed access
Belkacem BEKHITIBelkacem BEKHITI
Belkacem BEKHITI
ADAbdelhakim Dahimene
Abdelhakim Dahimene
BNBachir Nail
Bachir Nail
KHKamel Hariche
Kamel Hariche
AHAnis Hamadouche
Anis Hamadouche
In this paper we are going to introduce a new control design algorithms based on the theory of matrix polynomials. The first procedure is called Block decoupling control which is based on the spectral factors of the denominator of the right matrix fraction description (RMFD), the advantages of this control are the non-interacted behavior, simplicity in control design and low order controller is obtained due to the cancellation property of the proposed algorithm. The second control is called MIMO PID controller design via the placement of Block roots with the help of Diophantine equation resolution, the later systematic procedure retains both regulation and tracking objectives with small gains and minimum error.

10 April 2018 in International Journal of Adaptive Control and Signal Processing
Verified
Journal Article
Closed access
PDF file
AHAnis Hamadouche
Anis Hamadouche
AKAbdelmalek Kouadri
Abdelmalek Kouadri
ABAbderazak Bensmail
Abderazak Bensmail

1 March 2020 in Journal of Process Control
Verified
Journal Article
Closed access
AHAnis Hamadouche
Anis Hamadouche

1 September 2022
Verified
Conference Paper
Closed access
YWYun Wu
Yun Wu
Yun ZhangYun Zhang
Yun Zhang
AHAnis Hamadouche
Anis Hamadouche
JMJoao F. C. Mota
Joao F. C. Mota
AWAndrew Wallace
Andrew Wallace
The analysis and optimization of computational precision is crucial when using approximation in hardware implementations of algorithms. Mainstream methods are based on either dynamic or static analysis of arithmetic errors, but only static analysis can guarantee the desired worst-case accuracy. In this paper we describe an automated approach to estimate the arithmetic binary representations and compare the computational sensitivities for 1-dimensional feedback-loop algorithms, enabling both customized floating-point and fixed-point approximation by affine arithmetic.Using typical benchmarks for iterative Proportional Integral Derivative (PID) control, an automated approach has been developed to obtain the appropriate approximation for both the exponent and mantissa of floating-point, and the integer and fraction parts of fixed-point signals. This reduces the circuit area and power consumption of an FPGA implementation. For the approximate PID controller implemented on a Xilinx FPGA platform, we were able to reduce area and power, as compared to standard uniform bit-widths, by 62% and 27% on average respectively.