arXiv subjects

Ebrahim Sarabi

Publications and source records attributed to Ebrahim Sarabi.

10 recordsLinked to original sources

arXiv2026

Twice Epi-Differentiability of Spectral Functions and its applications

Second-order variational properties have been shown to play important theoretical and numerical roles for different classes of optimization problems. Among such properties, twice epi-differentiability has a special place because of its ubiquitous presence in various classes of extended-real-valued functions that are important for optimization problems. We provide a useful characterization of this property for spectral functions by demonstrating that it can be characterized via the same property of the symmetric part of the spectral representation of an eigenvalue function. Our approach allows us to bypass the rather restrictive convexity assumption, used in many recent works that targeted second-order variational properties of spectral functions. By this theoretical tool, several applications on the proto-differentiability of subgradient mappings, the directional differentiability of the proximal mapping of spectral functions are achieved. We finally use our established theory to study twice epi-differentiability of leading eigenvalue functions and practical regularization terms that have important applications in statistics and the robust PCA.

math.OC↗

arXiv2025

Characterizations of Tilt-Stable Local Minimizers of a Class of Matrix Optimization Problems

Tilt stability plays a pivotal role in understanding how local solutions of an optimization problem respond to small, targeted perturbations of the objective. Although quadratic bundles are a powerful tool for capturing second-order variational behavior, their characterization remains incomplete beyond well-known polyhedral and certain specialized nonpolyhedral settings. To help bridge this gap, we propose a new point-based criterion for tilt stability in prox-regular, subdifferentially continuous functions by exploiting the notion of minimal quadratic bundles. Furthermore, we derive an explicit formula for the minimal quadratic bundle associated with a broad class of general spectral functions, thus providing a practical and unifying framework that significantly extends existing results and offers broader applicability in matrix optimization problems.

math.OC↗

arXiv2024

A fresh look into variational analysis of $\mathcal C^2$-partly smooth functions

$\mathcal C^2$-partial smoothness of functions has been an important subject of research in optimization, on both theoretical and algorithmic aspects, since it was first introduced by Lewis in 2002. Our work aims at providing a fresh variational analysis viewpoint on the class of $\mathcal C^2$-partly smooth functions. Namely, we explore the relationship between $\mathcal C^2$-partial smoothness and strict twice epi-differentiability and demonstrate that functions from the latter class are always strictly twice epi-differentiable. On the other hand, we provide two examples to show that the opposite conclusion does not hold in general. As a consequence of our analysis, we calculate the second subderivative of $\mathcal C^2$-partly smooth functions. Applications to stability analysis of related generalized equations involving a general perturbation and to asymptotic analysis of the well-known sample average approximation method for stochastic programs with $\mathcal C^2$-partly smooth regularizers are also given.

math.OC↗

arXiv2024

Smoothness of Subgradient Mappings and Its Applications in Parametric Optimization

We demonstrate that the concept of strict proto-differentiability of subgradient mappings can play a similar role as smoothness of the gradient mapping of a function in the study of subgradient mappings of prox-regular functions. We then show that metric regularity and strong metric regularity are equivalent for a class of generalized equations when this condition is satisfied. For a class of composite functions, called C2-decomposable, we argue that strict proto-differentiability can be characterized via a simple relative interior condition. Leveraging this observation, we present a characterization of the continuous differentiability of the proximal mapping for this class of function via a certain relative interior condition. Applications to the study of strong metric regularity of the KKT system of a class of composite optimization problems are also provided.

math.OC↗

arXiv2024

Parabolic Regularity of Spectral Functions

This paper is devoted to the study of the second-order variational analysis of spectral functions. It is well-known that spectral functions can be expressed as a composite function of symmetric functions and eigenvalue functions. We establish several second-order properties of spectral functions when their associated symmetric functions enjoy these properties. Our main attention is given to characterize parabolic regularity for this class of functions. It was observed recently that parabolic regularity can play a central rule in ensuring the validity of important second-order variational properties such as twice epi-differentiability. We demonstrates that for convex spectral functions, their parabolic regularity amounts to that of their symmetric functions. As an important consequence, we calculate the second subderivative of convex spectral functions, which allows us to establish second-order optimality conditions for a class of matrix optimization problems.

math.OC↗

arXiv2023

Convergence of Augmented Lagrangian Methods for Composite Optimization Problems

Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new second-order variational property, called the semi-stability of second subderivatives, and demonstrate that it is widely satisfied for numerous classes of functions, important for applications in constrained and composite optimization problems. Using the latter condition and a certain second-order sufficient condition, we are able to establish Q-linear convergence of the primal-dual sequence for an inexact version of the ALM for composite programs.

math.OC↗

arXiv2020

Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization

This paper aims at developing two versions of the generalized Newton method to compute not merely arbitrary local minimizers of nonsmooth optimization problems but just those, which possess an important stability property known as tilt stability. We start with unconstrained minimization of continuously differentiable cost functions having Lipschitzian gradients and suggest two second-order algorithms of the Newton type: one involving coderivatives of Lipschitzian gradient mappings, and the other based on graphical derivatives of the latter. Then we proceed with the propagation of these algorithms to minimization of extended-real-valued prox-regular functions, while covering in this way problems of constrained optimization, by using Moreau envelops. Employing advanced techniques of second-order variational analysis and characterizations of tilt stability allows us to establish the solvability of subproblems in both algorithms and to prove the Q-superlinear convergence of their iterations.

math.OC↗

arXiv2020

Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization

This paper mainly concerns with the primal superlinear convergence of the quasi-Newton sequential quadratic programming (SQP) method for piecewise linear-quadratic composite optimization problems. We show that the latter primal superlinear convergence can be justified under the noncriticality of Lagrange multipliers and a version of the Dennis-More condition. Furthermore, we show that if we replace the noncriticality condition with the second-order sufficient condition, this primal superlinear convergence is equivalent with an appropriate version of the Dennis-More condition. We also recover Bonnans' result in [1] for the primal-dual superlinear of the basic SQP method for this class of composite problems under the second-order sufficient condition and the uniqueness of Lagrange multipliers. To achieve these goals, we first obtain an extension of the reduction lemma for convex Piecewise linear-quadratic functions and then provide a comprehensive analysis of the noncriticality of Lagrange multipliers for composite problems. We also establish certain primal estimates for KKT systems of composite problems, which play a significant role in our local convergence analysis of the quasi-Newton SQP method.

math.OC↗

arXiv2020

Stability of KKT systems and superlinear convergence of the SQP method under parabolic regularity

This paper pursues a two-fold goal. Firstly, we aim to derive novel second-order characterizations of important robust stability properties of perturbed Karush-Kuhn-Tucker systems for a broadclass of constrained optimization problems generated by parabolically regular sets. Secondly, the obtained characterizations are applied to establish well-posedness and superlinear convergence of the basic sequential quadratic programming method to solve parabolically regular constrained optimization problems.

math.OC↗

arXiv2018

Criticality of Lagrange Multipliers in Variational Systems

The paper concerns the study of criticality of Lagrange multipliers in variational systems that has been recognized in both theoretical and numerical aspects of optimization and variational analysis. In contrast to the previous developments dealing with polyhedral KKT systems and the like, we now focus on general nonpolyhedral systems that are associated, in particular, with problems of conic programming. Developing a novel approach, which is mainly based on advanced techniques and tools of second-order variational analysis and generalized differentiation, allows us to overcome principal challenges of nonpolyhedrality and to establish complete characterizations on noncritical multipliers in such settings. The obtained results are illustrated by examples from semidefinite programming.

math.OC↗