Related papers: A new elementary proof for M-stationarity under MP…
We introduce a sequence of isolated curve singularities, the elliptic m-fold points, and an associated sequence of stability conditions, generalizing the usual definition of Deligne-Mumford stability. For every pair of integers 0<m<n, we…
The proximal, regular and limiting normal cones to the second-order cone complementarity set play important roles in studying mathematical programs with second-order cone complementarity constraints, second-order cone programs, and the…
This work is part of an ongoing effort of comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general abs-normal NLP with equality and inequality constraints in relation to an equivalent MPCC reformulation.…
The aim of this article is to simplify Pfanzagl's proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M-estimators. The method relies on the existence of a sort of contraction of…
We prove a conjecture about the minimal nonnegative solutions of algebraic Riccati equations associated with reducible singular M-matrices. The result enhances our understanding of the behaviour of doubling algorithms for finding the…
A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…
Given a triangulated category $\mathcal{C}$, we construct a partial compactification, denoted $\mathcal{A}\mathrm{Stab}(\mathcal{C})$, of the quotient of its stability manifold by $\mathbb{C}$. The purpose of…
Approximate necessary optimality conditions in terms of Fr\'echet subgradients and normals for a rather general optimization problem with a potentially non-Lipschitzian objective function are established with the aid of Ekeland's…
In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…
We establish the existence of common fixed points for $C_q$-commuting self-mappings satisfying a generalized Gregus-type inequality with quadratic terms in $q$-starshaped subsets of normed linear spaces. Our framework extends classical…
The well known constant rank constraint qualification [Math. Program. Study 21:110--126, 1984] introduced by Janin for nonlinear programming has been recently extended to a conic context by exploiting the eigenvector structure of the…
Chance-constrained programs (CCP) represent a trade-off between conservatism and robustness in optimization. In many CCPs, one optimizes an objective under a probabilistic constraint continuously parameterized by a random vector $\xi$. In…
We investigate stationary solutions of a non-local aggregation equation with degenerate power-law diffusion and bounded attractive potential in arbitrary dimensions. Compact stationary solutions are characterized and compactness…
We prove the first convergence guarantees for a subgradient method minimizing a generic Lipschitz function over generic Lipschitz inequality constraints. No smoothness or convexity (or weak convexity) assumptions are made. Instead, we…
As a starting point of our research, we show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to…
The first-order optimality conditions of sparse bilinear least squares problems are studied. The so-called T-type and N-type stationary points for this problem are characterized in terms of tangent cone and normal cone in Bouligand and…
In this paper, we study properties of penalized and structured M-estimators of multivariate scatter, based on geodesically convex but not necessarily smooth penalty functions. Existence and uniqueness conditions for these penalized and…
Memory consistency models (MCMs) are at the heart of concurrent programming. They represent the behaviour of concurrent programs at the chip level. To test these models small program snippets called litmus test are generated, which show…
In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials.…
This paper is devoted to the study of tilt stability of local minimizers, which plays an important role in both theoretical and numerical aspects of optimization. This notion has been comprehensively investigated in the unconstrained…