This paper is devoted to the theoretical and numerical investigation of an augmented
Lagrangian method for the solution of optimization problems with geometric constraints …

We survey optimization problems that involve the cardinality of variable vectors in
constraints or the objective function. We provide a unified viewpoint on the general problem …

To solve convex constrained minimization problems, that also include a cardinality
constraint, we propose an augmented Lagrangian scheme combined with alternating …

We propose a new sparse Granger-causal learning framework for temporal event data. We
focus on a specific class of point processes called the Hawkes process. We begin by …

As a starting point of our research, we show that, for a fixed order γ≥ 1, each local minimizer
of a rather general nonsmooth optimization problem in Euclidean spaces is either M …

Approximate necessary optimality conditions in terms of Frechet subgradients and normals
for a rather general optimization problem with a potentially non-Lipschitzian objective …

The optimization literature is vast in papers dealing with improvements on the global
convergence of augmented Lagrangian schemes. Usually, the results are based on weak …

We propose a comparative study of sequential optimality conditions for mathematical
programs with cardinality constraints. Besides analyzing some of the classical approximate …

Asymptotic stationarity and regularity conditions turned out to be quite useful to study the
qualitative properties of numerical solution methods for standard nonlinear and …

In this paper, we consider the continuous relaxation reformulation of cardinality-constrained
optimization problems that has become more popular in recent years and propose a new …