SearcharxivSearch

arXiv subjects

Samir Adly

Publications and source records attributed to Samir Adly.

At least 19 recordsLinked to original sources

A Refined Parameter Condition in the Lyapunov Analysis of IGAHD

In a recent paper, Attouch, Chbani, Fadili and Riahi introduced the inertial gradient algorithm with Hessian-driven daming, called (IGAHD). Under the condition $0\leq\beta<2\sqrt{s}$, where $\beta$ is the Hessian driven damping parameter and $s>0$ is the gradient step size, their Lyapunov analysis shows an accelerated estimate of the objective function as well as a weighted summability of the gradient for the case $\beta>0$. For any fixed value of $\beta>0$, this condition excluded sufficiently small step sizes $s>0$. The present note refines one of the estimates in this Lyapunov analysis by retaining two coefficients that were previously replaced by lower bounds. This leads to the following less restrictive and sufficient condition: $$0<\beta L\sqrt{s}<1+\sqrt{1+sL(1-sL)},$$ where $L>0$ is the constant Lipschitz of the gradient objective function and $0 0$ and $L>0$, this new condition is satisfied for sufficiently small $s>0$. Consequently, under this new refined sufficient condition, the conclusions in the original paper stay valid. For convex quadratic functions in finite dimensions, a separate spectral analysis leads to a larger region parameters. It gives a necessary and sufficient condition for Schur stability of the limit modal matrices, as well as the geometrical decay of the objective residuals and the gradients. This modal analysis raises the question of whether a different Lyapunov function would allow us to recover part (or all) of this extended spectral domain for non-quadratic objective functions.

math.OC

Dry-Friction Inertial Dynamics with Implicit Hessian-Driven Damping: Finite-Time Stabilization, Shadowing, and Proximal Discretization

In a real Hilbert space $\mathcal H$, we study the following inertial differential inclusion $$ \ddot x(t)+\gamma\dot x(t)+\partial\phi(\dot x(t)) +\nabla f(x(t)+\beta\dot x(t))\ni0, $$ where $\gamma>0$ is the viscous damping coefficient, and $\phi$ is a convex potential with a sharp minimum at the origin that models the dry friction damping (typically $\phi=r\Vert\cdot\Vert$ where $r>0$ is the dry-friction parameter). The function $f$ represents the smooth potential to be minimized, and the shifted-gradient evaluation $\nabla f(x(t)+\beta\dot x(t))$ is known as the implicit Hessian-driven model. Here $\beta\geq 0$ represents the corresponding Hessian-driven parameter. Both the explicit and the implicit Hessian-driven dynamics are know to attenuate the oscillations that occurs in inertial systems. Our contribution concerns the quantitative analysis of this continuous dynamic and its temporal discretization counter-part under the action of these three combined dampings: viscous damping, dry friction, and implicit Hessian-driven damping. We establish a global well-posedness, an exact Lyapunov analysis adapted to the implicit Hessian-driven damping, finite length of the trajectory and its strong convergence to an approximate critical point $x_\infty$ of $f$ satisfying: $-\nabla f(x_\infty)\in\partial \phi(0)$. We show finite-time stabilization under a strict interior condition on the terminal force. We also compare the explicit and the implicit Hessian-driven dynamics and show that their trajectories differ by $O(\beta^2)$ on finite horizons. A temporal semi-implicit discretization of the dynamic above leads to a proximal implicit Hessian-driven algorithm based on one shifted-gradient evaluation. We derive its discrete Lyapunov analysis, asymptotic convergence and, under a strict terminal margin, finite convergence of the discrete iterates.

math.OC

Stationarity Floors and Vanishing Perturbations in Sharpness-Aware Minimization

We study a deterministic family of sharpness-aware minimization methods for smooth nonconvex functions. The perturbation is $$ y_k=x_k+\rho\, \frac{\nabla f(x_k)}{\norm{\nabla f(x_k)}^\alpha}, \qquad 0\leq\alpha\leq 1, $$ so that its effective radius is $\rho\norm{\nabla f(x_k)}^{1-\alpha}$. For $0<\alpha\leq1$, we give an explicit complexity bound above the stationarity level $(L\rho)^{1/\alpha}$. A one-dimensional quadratic example reaches this level exactly, showing that the bound describes a real limitation of the constant-parameter rule. The unnormalized case $\alpha=0$ is treated separately and requires $L\rho<1$. We then introduce a clipped rule which agrees with the constant-$\rho$ rule away from stationary points and becomes proportional to the gradient near them. The clipped method has $\norm{\nabla f(x_k)}\to0$ and the usual $O(T^{-1/2})$ stationarity bound. Numerical tests on a quadratic function, the Rosenbrock function, and a five-dimensional nonconvex function illustrate the stationarity floor of the unclipped rule and the effect of clipping.

math.OC

The maximum number of Pareto eigenvalues of a real matrix of order four is 23

For a given real matrix $A\in\R^{n\times n}$, a Pareto eigenvalue of $A$ is a real number $\lambda\in\R$ for which there exists a nonzero vector $x\in\R^n\setminus\{0\}$ such that $$ 0\leq x\perp Ax-\lambda x\geq0. $$ We prove that every matrix $A\in\R^{4\times4}$ has at most $23$ distinct Pareto eigenvalues. We first prove the result for matrices of order $4$ satisfying two conditions: every real eigenvalue of a principal submatrix is simple, and two different principal submatrices have no real eigenvalue in common. For these matrices, a fixed point argument shows that the number of Pareto eigenvalues is odd. Previous known results show that the Pareto capacity of order $4$ is between $23$ and $26$. Thus only $25$ remains to exclude. We exclude this case by using the support profiles in order $3$ and identities involving eigenvectors of principal submatrices. A perturbation and fixed point index argument then extends the bound to all real matrices of order $4$. An exact symbolic computation certifies that an explicit matrix of order $4$ has exactly $23$ distinct regular Pareto eigenvalues.

math.OC

Support profiles of full-capacity Pareto spectra of order three

For a given real matrix $A\in\R^{n\times n}$ of order $n\geq 1$, a Pareto eigenvalue is a scalar $\lambda\in\R$ for which there exists a nonzero vector $x\in\R^n_+$ such that $Ax-\lambda x\in\R^n_+$ and $\langle x,Ax-\lambda x\rangle=0$. It is knwon that a real matrix of order $n=3$ can have at most $9$ distinct Pareto eigenvalues. We study the matrices for which this maximal number is attained and classify the way in which the $9$ Pareto eigenvalues are produced by their supports. A Pareto eigenvalue may be produced by more than one support. We therefore choose one producing support for each distinct values. The main contribution of this paper is to prove that, for every such choice, the numbers of values assigned to supports of sizes $1$, $2$, and $3$ are necessarily $$ (1,5,3),\qquad (2,4,3),\qquad\text{or}\qquad (2,5,2). $$ The proof uses bounds from the order $n=2$ problem and several restrictions on singleton, pair, and full supports. In particular, the graph formed by the pair supports producing $2$ values contains no triangle. These arguments also gives anohter proof that the maximum Pareto capacity in order $3$ is equal to $9$. For each of the $3$ profiles, we give an explicit full-capacity matrix with $9$ regular Pareto eigenvalues. We also prove that each profile occurs on a nonempty Euclidean-open set where every Pareto eigenvalue has a unique producing support.

math.OC

Accelerated Inertial Gradient Algorithms with Vanishing Tikhonov Regularization

In this paper, we study an explicit Tikhonov-regularized inertial gradient algorithm for smooth convex minimization with Lipschitz continuous gradient. The method is derived via an explicit time discretization of a damped inertial system with vanishing Tikhonov regularization. Under appropriate control of the decay rate of the Tikhonov term, we establish accelerated convergence of the objective values to the minimum together with strong convergence of the iterates to the minimum-norm minimizer. In particular, for polynomial schedules $\varepsilon_k = k^{-p}$ with $0<p<2$, we prove strong convergence to the minimum-norm solution while preserving fast objective decay. In the critical case $p=2$, we still obtain fast rates for the objective values, while our analysis does not guarantee strong convergence to the minimum-norm minimizer. Furthermore, we provide a thorough theoretical analysis for several choices of Tikhonov schedules. Numerical experiments on synthetic, benchmark, and real datasets illustrate the practical performance of the proposed algorithm.

math.OC

Penalty-Based Smoothing of Convex Nonsmooth Supremum Functions with Accelerated Inertial Dynamics

We propose a penalty-based smoothing framework for convex nonsmooth functions with a supremum structure. The regularization yields a differentiable surrogate with controlled approximation error, a single-valued dual maximizer, and explicit gradient formulas. We then study an accelerated inertial dynamic with vanishing damping driven by a time-dependent regularized function whose parameter decreases to zero. Under mild integrability and boundedness conditions on the regularization schedule, we establish an accelerated $\mathcal{O}(t^{-2})$ decay estimate for the regularized residual and, in the regime $\alpha>3$, a sharper $o(t^{-2})$ decay together with weak convergence of trajectories to a minimizer of the original nonsmooth problem via an Opial-type argument. Applications to multiobjective optimization (through Chebyshev/max scalarization) and to distributionally robust optimization (via entropic regularization over ambiguity sets) illustrate the scope of the framework.

math.OC

New General Fixed-Point Approach to Compute the Resolvent of Composite Operators

In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the proposed algorithms are obtained. Advantages of our method over the existing approaches are also thoroughly analyzed.

math.OC

KKT Optimality Conditions for Multiobjective Optimal Control Problems with Endpoint and Mixed Constraints: Application to Sustainable Energy Management

In this paper, we derive first and second-order optimality conditions of KKT type for locally optimal solutions to a class of multiobjective optimal control problems with endpoint constraint and mixed pointwise constraints. We give some sufficient conditions for normality of multipliers. Namely, we show that if the linearized system is controllable or some constraint qualifications are satisfied, then the multiplier corresponding to the objective function is different from zero. To demonstrate the practical relevance of our theoretical results, we apply these conditions to a multiobjective optimal control problem for sustainable energy management in smart grids, providing insights into the trade-offs between cost, renewable energy utilization, environmental impact, and grid stability.

math.OC

Shape optimization for variational inequalities: the scalar Tresca friction problem

This paper investigates, without any regularization or penalization procedure, a shape optimization problem involving a simplified friction phenomena modeled by a scalar Tresca friction law. Precisely, using tools from convex and variational analysis such as proximal operators and the notion of twice epi-differentiability, we prove that the solution to a scalar Tresca friction problem admits a directional derivative with respect to the shape which moreover coincides with the solution to a boundary value problem involving Signorini-type unilateral conditions. Then we explicitly characterize the shape gradient of the corresponding energy functional and we exhibit a descent direction. Finally numerical simulations are performed to solve the corresponding energy minimization problem under a volume constraint which shows the applicability.

math.OC

Sliding Mode Observers for Set-valued Lur'e Systems with Uncertainties Beyond Observational Range

In this paper, we introduce a new sliding mode observer for Lur'e set-valued dynamical systems, particularly addressing challenges posed by uncertainties not within the standard range of observation. Traditionally, most of Luenberger-like observers and sliding mode observer have been designed only for uncertainties in the range of observation. Central to our approach is the treatment of the uncertainty term which we decompose into two components: the first part in the observation subspace and the second part in its complemented subspace. We establish that when the second part converges to zero, an exact sliding mode observer for the system can be obtained. In scenarios where this convergence does not occur, our methodology allows for the estimation of errors between the actual state and the observer state. This leads to a practical interval estimation technique, valuable in situations where part of the uncertainty lies outside the observable range. Finally, we show that our observer is also a T- observer as well as a strong H-infinity observer.

math.OC

State-Dependent Sweeping Processes: Asymptotic Behavior and Algorithmic Approaches

In this paper, we investigate the asymptotic properties of a particular class of state-dependent sweeping processes. While extensive research has been conducted on the existence and uniqueness of solutions for sweeping processes, there is a scarcity of studies addressing their behavior in the limit of large time. Additionally, we introduce novel algorithms designed for the resolution of quasi-variational inequalities. As a result, we introduce a new derivative-free algorithm to find zeros of nonsmooth Lipschitz continuous mappings with a linear convergence rate. This algorithm can be effectively used in nonsmooth and nonconvex optimization problems that do not possess necessarily second-order differentiability conditions of the data.

math.OC

Sliding Mode Observer for Set-valued Lur'e Systems and Chattering Removing

In this paper, we study a sliding mode observer for a class of set-valued Lur'e systems subject to uncertainties. We show that our approach has obvious advantages than the existing Luenberger-like observers. Furthermore, we provide an effective continuous approximation to eliminate the chattering effect in the sliding mode technique.

math.OC

Time-dependent Inclusions and Sweeping Processes in Contact Mechanics

We consider a class of time-dependent inclusions in Hilbert spaces for which we state and prove an existence and uniqueness result. The proof is based on arguments of variational inequalities, convex analysis and fixed point theory. Then we use this result to prove the unique weak solvability of a new class of Moreau's sweeping processes with constraints in velocity. Our results are useful in the study of mathematical models which describe the quasistatic evolution of deformable bodies in contact with an obstacle. To provide some examples we consider three viscoelastic contact problems which lead to time-dependent inclusions and sweeping processes in which the unknowns are the displacement and the velocity fields, respectively. Then we apply our abstract results in order to prove the unique weak solvability of the corresponding contact problems.

math-ph

An implicit sweeping process approach to quasistatic evolution variational inequalities

In this paper, we study a new variant of Moreau's sweeping process with velocity constraint. Based on an adapted version of Moreau's catching-up algorithm, we show the well-posedness (in the sense existence and uniqueness) of this problem in a general framework. We show the equivalence between this implicit sweeping process and a quasistatic evolution variational inequality. It is well known that the variational formulations of many mechanical problems with unilateral contact and friction lead to an evolution variational inequality. As an application, we reformulate the quasistatic antiplane frictional contact problem for linear elastic materials with short memory as an implicit sweeping process with velocity constraint. The link between the implicit sweeping process and the quasistatic evolution variational inequality is possible thanks to some standard tools from convex analysis and is new in the literature.

math.OC

On a decomposition formula for the proximal operator of the sum of two convex functions

The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator, called $f$-proximal operator of $g$ and denoted by $\mathrm{prox}^f_g$, that generalizes the classical notion. Then we prove the decomposition formula $\mathrm{prox}_{f+g} = \mathrm{prox}_f \circ \mathrm{prox}^f_g$. After collecting several properties and characterizations of $\mathrm{prox}^f_g$, we prove that it coincides with the fixed points of a generalized version of the classical Douglas-Rachford operator. This relationship is used for the construction of a weakly convergent algorithm that computes numerically this new operator $\mathrm{prox}^f_g$, and thus, from the decomposition formula, allows to compute numerically $\mathrm{prox}_{f+g}$. It turns out that this algorithm was already considered and implemented in previous works, showing that $\mathrm{prox}^f_g$ is already present (in a hidden form) and useful for numerical purposes in the existing literature. However, to the best of our knowledge, it has never been explicitly expressed in a closed formula and neither been deeply studied from a theoretical point of view. The present paper contributes to fill this gap in the literature. Finally we give an illustration of the usefulness of the decomposition formula in the context of sensitivity analysis of linear variational inequalities of second kind in a Hilbert space.

math.OC

Sensitivity analysis of variational inequalities via twice epi-differentiability and proto-differentiability of the proximity operator

In this paper we investigate the sensitivity analysis of parameterized nonlinear variational inequalities of second kind in a Hilbert space. The challenge of the present work is to take into account a perturbation on all the data of the problem. This requires special adjustments in the definitions of the generalized first- and second-order differentiations of the involved operators and functions. Precisely, we extend the notions, introduced and thoroughly studied by R.T. Rockafellar, of twice epi-differentiability and proto-differentiability to the case of a parameterized lower semi-continuous convex function and its subdifferential respectively. The link between these two notions is tied to Attouch's theorem and to the new concept, introduced in this paper, of convergent supporting hyperplanes. The previous tools allow us to derive an exact formula of the proto-derivative of the generalized proximity operator associated to a parameterized variational inequality, and deduce the differentiability of the associated solution with respect to the parameter. Furthermore, the derivative is shown to be the solution of a new variational inequality involving semi- and twice epi-derivatives of the data. An application is given to parameterized convex optimization problems involving the sum of two convex functions (one of them being smooth). The case of smooth convex optimization problems with inequality constraints is discussed in details. This approach seems to be new in the literature and open several perspectives towards theoretical and computational issues in nonlinear optimization.

math.OC