Arun D. Mahindrakar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Arun D. Mahindrakar has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Vijay Muralidharan
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
10 shared publications V. Sankaranarayanan
Department of Electrical and Electronics Engineering, National Institute of Technology, Tiruchirappalli, India
6 shared publications- Anik Kumar Paul
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
4 shared publications - José Ángel Acosta
Departamento de Ingeniera de Sistemas y Automtica, Universidad de Sevilla, Seville, Spain
4 shared publications - Ravi N. Banavar
Centre for Systems and Control, Indian Institute of Technology Bombay, Mumbai, India
4 shared publications - Romeo Ortega
Electrical and Electronic Engineering Department, Instituto Tecnolgico Autnomo de Mxico (ITAM), Mexico City, Mexico
4 shared publications
Latest Publications
- 21 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 313-318
Stochastic Recursive Inclusions With Biased Perturbations: An ISS Perspective
This letter investigates the asymptotic behavior of stochastic recursive inclusions (SRI) in the presence of non-zero, non-diminishing bias, a setting that frequently arises in zeroth-order optimization, stochastic approximation with iterate-dependent noise, and distributed learning with adversarial agents. Using input-to-state stability (ISS) of the differential inclusion that arises as the continuous-time limit of the SRI, we show that if the limiting differential inclusion is ISS and the iterates are almost surely bounded, then the iterates converge a.s. to a neighborhood of the equilibrium. We provide a simple, verifiable sufficient condition for almost sure boundedness when the operator is single-valued and globally Lipschitz, and show that several zeroth-order stochastic-gradient variants fit into this SRI/ISS framework under standard assumptions. The results offer a unified theoretical foundation for proving almost sure convergence of biased stochastic approximation schemes via ISS of differential inclusions.
- 21 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 313-318
Stochastic Recursive Inclusions With Biased Perturbations: An ISS Perspective
This letter investigates the asymptotic behavior of stochastic recursive inclusions (SRI) in the presence of non-zero, non-diminishing bias, a setting that frequently arises in zeroth-order optimization, stochastic approximation with iterate-dependent noise, and distributed learning with adversarial agents. Using input-to-state stability (ISS) of the differential inclusion that arises as the continuous-time limit of the SRI, we show that if the limiting differential inclusion is ISS and the iterates are almost surely bounded, then the iterates converge a.s. to a neighborhood of the equilibrium. We provide a simple, verifiable sufficient condition for almost sure boundedness when the operator is single-valued and globally Lipschitz, and show that several zeroth-order stochastic-gradient variants fit into this SRI/ISS framework under standard assumptions. The results offer a unified theoretical foundation for proving almost sure convergence of biased stochastic approximation schemes via ISS of differential inclusions.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2417-2422
Safe Time-Varying Nonlinear Programming With Equality Constraints
This letter focuses on a safety-critical solution to equality-constrained nonlinear programming, where the cost and the constraints vary continuously over time. To address this problem, we propose a continuous-time dynamical system with a quadratic-program (QP)-based feedback. The control barrier equality is treated as the hard constraint in the QP to enforce safety, and the control Lyapunov inequality is treated as the soft constraint for tracking the non-stationary minimizer. We show that the tracking error dynamics is locally uniformly ultimately bounded, and we establish uniform exponential stability in the presence of feedforward prediction. As an application, we solve the time-varying Procrustes problem, which is a time-varying optimization problem on an embedded submanifold of the Euclidean space.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2417-2422
Safe Time-Varying Nonlinear Programming With Equality Constraints
This letter focuses on a safety-critical solution to equality-constrained nonlinear programming, where the cost and the constraints vary continuously over time. To address this problem, we propose a continuous-time dynamical system with a quadratic-program (QP)-based feedback. The control barrier equality is treated as the hard constraint in the QP to enforce safety, and the control Lyapunov inequality is treated as the soft constraint for tracking the non-stationary minimizer. We show that the tracking error dynamics is locally uniformly ultimately bounded, and we establish uniform exponential stability in the presence of feedforward prediction. As an application, we solve the time-varying Procrustes problem, which is a time-varying optimization problem on an embedded submanifold of the Euclidean space.
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (1) , 139-154
Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm: A Projected Dynamical Viewpoint
Saddle point problems, ubiquitous in optimization, extend beyond game theory to diverse domains like power networks and reinforcement learning. We present novel approaches to tackle saddle point problem, with a focus on continuous-time contexts. A continuous time dynamics is proposed to tackle saddle point problem utilizing a projected dynamical system in a non-Euclidean domain. This involves computing the (sub/super) gradient of the min-max function within a Riemannian metric. Additionally, we establish viable Carathéodory solutions and prove the Lyapunov stability and asymptotic set stability of the proposed continuous time dynamical system. Next, we present the Stochastic Saddle Point Mirror Descent (SSPMD) algorithm and establish its equivalence with the proposed continuous-time dynamics. Leveraging stability analysis of the continuous-time dynamics, we demonstrate the almost sure convergence of the algorithm's iterates. Furthermore, we introduce the Stochastic Zeroth-Order Saddle Point Mirror Descent (SZSPMD) algorithm, which approximates gradients using Gaussian Approximation, showcasing convergence to a neighbourhood about saddle points. The analysis in this paper provides geometric insights into the mirror descent algorithm. It demonstrates how these insights offer theoretical foundations for analysis of different variants of stochastic mirror descent algorithm.
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (1) , 139-154
Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm: A Projected Dynamical Viewpoint
Saddle point problems, ubiquitous in optimization, extend beyond game theory to diverse domains like power networks and reinforcement learning. We present novel approaches to tackle saddle point problem, with a focus on continuous-time contexts. A continuous time dynamics is proposed to tackle saddle point problem utilizing a projected dynamical system in a non-Euclidean domain. This involves computing the (sub/super) gradient of the min-max function within a Riemannian metric. Additionally, we establish viable Carathéodory solutions and prove the Lyapunov stability and asymptotic set stability of the proposed continuous time dynamical system. Next, we present the Stochastic Saddle Point Mirror Descent (SSPMD) algorithm and establish its equivalence with the proposed continuous-time dynamics. Leveraging stability analysis of the continuous-time dynamics, we demonstrate the almost sure convergence of the algorithm's iterates. Furthermore, we introduce the Stochastic Zeroth-Order Saddle Point Mirror Descent (SZSPMD) algorithm, which approximates gradients using Gaussian Approximation, showcasing convergence to a neighbourhood about saddle points. The analysis in this paper provides geometric insights into the mirror descent algorithm. It demonstrates how these insights offer theoretical foundations for analysis of different variants of stochastic mirror descent algorithm.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7718-7724
A Unified Framework for Consensus and Synchronization on Lie Groups Admitting a Bi-Invariant Metric
For a finite number of agents evolving in a Euclidean space and linked to each other by a connected graph, the Laplacian flow that is based on the interagent errors ensures consensus or synchronization for both first- and second-order dynamics. When such agents evolve on a circle (such as the Kuramoto oscillator), the flow that depends on the sinusoid of the interagent error angles generalizes the same result. In this work, it is shown that the Laplacian flow and the Kuramoto oscillator are special cases of a more general theory of consensus applicable on Lie groups that admit bi-invariant metrics. Such a theory enables generalization of these consensus and synchronization algorithms to Lie groups.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7718-7724
A Unified Framework for Consensus and Synchronization on Lie Groups Admitting a Bi-Invariant Metric
For a finite number of agents evolving in a Euclidean space and linked to each other by a connected graph, the Laplacian flow that is based on the interagent errors ensures consensus or synchronization for both first- and second-order dynamics. When such agents evolve on a circle (such as the Kuramoto oscillator), the flow that depends on the sinusoid of the interagent error angles generalizes the same result. In this work, it is shown that the Laplacian flow and the Kuramoto oscillator are special cases of a more general theory of consensus applicable on Lie groups that admit bi-invariant metrics. Such a theory enables generalization of these consensus and synchronization algorithms to Lie groups.
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 120-125
Continuous-Time Heavy-Ball Gradient Method: Safety, Stability and Robustness
This letter proposes a continuous-time heavy-ball dynamical system to solve a constrained nonlinear optimization problem, ensuring forward invariance of the constraint set. Recent research in this area has focused on anytime solution for the nonlinear optimization problem, based on first-order gradient dynamics. Unlike the first-order gradient flows, the heavy-ball dynamics — being second-order — calls for the use of notions from exponential control barrier functions to ensure the safety of the closed-loop system with respect to the constraint set. The proposed heavy-ball dynamics is motivated by its added low-pass filtering capability to noisy gradients, which arise in stochastic gradient methods. Furthermore, we pose the problem of adversarial inputs or uncertainties in the constraint functions as a robust optimization problem and ensure the safety of the nominal constraint set. The results are validated on the extended Fermat-Torricelli problem, with non-convex constraint sets.
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 120-125
Continuous-Time Heavy-Ball Gradient Method: Safety, Stability and Robustness
This letter proposes a continuous-time heavy-ball dynamical system to solve a constrained nonlinear optimization problem, ensuring forward invariance of the constraint set. Recent research in this area has focused on anytime solution for the nonlinear optimization problem, based on first-order gradient dynamics. Unlike the first-order gradient flows, the heavy-ball dynamics — being second-order — calls for the use of notions from exponential control barrier functions to ensure the safety of the closed-loop system with respect to the constraint set. The proposed heavy-ball dynamics is motivated by its added low-pass filtering capability to noisy gradients, which arise in stochastic gradient methods. Furthermore, we pose the problem of adversarial inputs or uncertainties in the constraint functions as a robust optimization problem and ensure the safety of the nominal constraint set. The results are validated on the extended Fermat-Torricelli problem, with non-convex constraint sets.
- 16 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2397-2402
Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm’s iterates under the assumption of diminishing bias. Furthermore, we derive concentration bounds for the discrepancy between the iterates’ function values and the optimal value, based on standard assumptions. Subsequently, leveraging the assumption of Sub-Gaussian noise in stochastic subgradients, we present refined concentration bounds for this discrepancy.
- 16 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 2397-2402
Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm’s iterates under the assumption of diminishing bias. Furthermore, we derive concentration bounds for the discrepancy between the iterates’ function values and the optimal value, based on standard assumptions. Subsequently, leveraging the assumption of Sub-Gaussian noise in stochastic subgradients, we present refined concentration bounds for this discrepancy.
- 18 April 2024
- Published by Elsevier in Automatica
- Vol. 165
Geometric PID controller for stabilization of nonholonomic mechanical systems on Lie groups
- 18 April 2024
- Published by Elsevier in Automatica
- Vol. 165
Geometric PID controller for stabilization of nonholonomic mechanical systems on Lie groups
- 15 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7051-7058
Event-Triggered Control for Nonlinear Systems With Center Manifolds
In this work, we consider the problem of event-triggered implementation of control laws designed for the local stabilization of nonlinear systems with center manifolds. We propose event-triggering conditions which are derived from a local input-to-state stability characterization of such systems. The triggering conditions ensure local ultimate boundedness of the trajectories and the existence of a uniform positive lower bound for the inter-event times. The ultimate bound can be made arbitrarily small, by allowing for smaller inter-event times. Under certain assumptions on the controller structure, local asymptotic stability of the origin is also guaranteed. Two sets of triggering conditions are proposed, one for the case where the exact center manifold is known and the other for the case where only an approximation of the center manifold is computable. Two illustrative examples representative of the two scenarios are presented and the applicability of the proposed methods is demonstrated. The second example concerns the event-triggered implementation of a position stabilizing controller for the open-loop unstable Mobile Inverted Pendulum (MIP) robot.
- 15 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 7051-7058
Event-Triggered Control for Nonlinear Systems With Center Manifolds
In this work, we consider the problem of event-triggered implementation of control laws designed for the local stabilization of nonlinear systems with center manifolds. We propose event-triggering conditions which are derived from a local input-to-state stability characterization of such systems. The triggering conditions ensure local ultimate boundedness of the trajectories and the existence of a uniform positive lower bound for the inter-event times. The ultimate bound can be made arbitrarily small, by allowing for smaller inter-event times. Under certain assumptions on the controller structure, local asymptotic stability of the origin is also guaranteed. Two sets of triggering conditions are proposed, one for the case where the exact center manifold is known and the other for the case where only an approximation of the center manifold is computable. Two illustrative examples representative of the two scenarios are presented and the applicability of the proposed methods is demonstrated. The second example concerns the event-triggered implementation of a position stabilizing controller for the open-loop unstable Mobile Inverted Pendulum (MIP) robot.
- 20 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (6) , 3822-3834
Dynamical System Approach for Time-Varying Constrained Convex Optimization Problems
Optimization problems emerging in most of the real-world applications are dynamic, where either the objective function or the constraints change continuously over time. This paper proposes projected primal-dual dynamical system approaches to track the primal and dual optimizer trajectories of an inequality constrained time-varying (TV) convex optimization problem with a strongly convex objective function. First, we present a dynamical system that asymptotically tracks the optimizer trajectory of an inequality constrained TV optimization problem. Later we modify the proposed dynamics to achieve the convergence to the optimizer trajectory within a fixed time. The asymptotic and fixed-time convergence of the proposed dynamical systems to the optimizer trajectory is shown via Lyapunov based analysis. Finally, we consider the TV extended Fermat -Torricelli problem (eFTP) of minimizing the sum-of-squared distances to a finite number of nonempty, closed and convex TV sets, to illustrate the applicability of the projected dynamical systems proposed in this paper.
- 20 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (6) , 3822-3834
Dynamical System Approach for Time-Varying Constrained Convex Optimization Problems
Optimization problems emerging in most of the real-world applications are dynamic, where either the objective function or the constraints change continuously over time. This paper proposes projected primal-dual dynamical system approaches to track the primal and dual optimizer trajectories of an inequality constrained time-varying (TV) convex optimization problem with a strongly convex objective function. First, we present a dynamical system that asymptotically tracks the optimizer trajectory of an inequality constrained TV optimization problem. Later we modify the proposed dynamics to achieve the convergence to the optimizer trajectory within a fixed time. The asymptotic and fixed-time convergence of the proposed dynamical systems to the optimizer trajectory is shown via Lyapunov based analysis. Finally, we consider the TV extended Fermat -Torricelli problem (eFTP) of minimizing the sum-of-squared distances to a finite number of nonempty, closed and convex TV sets, to illustrate the applicability of the projected dynamical systems proposed in this paper.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 1933-1938
Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
This letter presents an almost sure convergence of the zeroth-order mirror descent (ZOMD) algorithm. The algorithm admits non-smooth convex functions and a biased oracle which only provides noisy function value at any desired point. We approximate the subgradient of the objective function using Nesterov’s Gaussian Approximation (NGA) with certain alternations suggested by some practical applications. We prove an almost sure convergence of the iterates’ function value to the neighbourhood of optimal function value, which can not be made arbitrarily small, a manifestation of a biased oracle. This letter ends with a concentration inequality, which is a finite time analysis that predicts the likelihood that the function value of the iterates is in the neighbourhood of the optimal value at any finite iteration.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 7, 1933-1938
Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
This letter presents an almost sure convergence of the zeroth-order mirror descent (ZOMD) algorithm. The algorithm admits non-smooth convex functions and a biased oracle which only provides noisy function value at any desired point. We approximate the subgradient of the objective function using Nesterov’s Gaussian Approximation (NGA) with certain alternations suggested by some practical applications. We prove an almost sure convergence of the iterates’ function value to the neighbourhood of optimal function value, which can not be made arbitrarily small, a manifestation of a biased oracle. This letter ends with a concentration inequality, which is a finite time analysis that predicts the likelihood that the function value of the iterates is in the neighbourhood of the optimal value at any finite iteration.