Related papers: A new elementary proof for M-stationarity under MP…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
We address in this work the problem of minimizing quantum entropies under local constraints. We suppose macroscopic quantities such as the particle density, current, and kinetic energy are fixed at each point of $\Rm^d$, and look for a…
Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…
We classify the constraints on a stationary point of the potential invariant under a finite group into intrinsic and extrinsic based on whether they are independent of the coefficients in the potential or not. We find that the symmetry…
We study cardinality-constrained optimization problems (CCOP) in general position, i. e. those optimization-related properties that are fulfilled for a dense and open subset of their defining functions. We show that the well-known…
Constraint qualifications (CQs) are central to the local analysis of constrained optimization. In this paper, we completely determine the validity of the four classical CQs -- LICQ, MFCQ, ACQ, and GCQ -- for constraint map-germs that arise…
We consider the conformal decomposition of Einstein's constraint equations introduced by Lichnerowicz and York, on a closed manifold. We establish existence of non-CMC weak solutions using a combination of a priori estimates for the…
In this paper we propose an Approximate Weak stationarity ($AW$-stationarity) concept designed to deal with {\em Mathematical Programs with Cardinality Constraints} (MPCaC), and we proved that it is a legitimate optimality condition…
For bilevel programs with a convex lower level program, the classical approach replaces the lower level program with its Karush-Kuhn-Tucker condition and solve the resulting mathematical program with complementarity constraint (MPCC). It is…
This paper examines solution methods for mathematical programs with complementarity constraints (MPCC) obtained from the time-discretization of optimal control problems (OCPs) subject to nonsmooth dynamical systems. The MPCC theory and…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
In this paper, we study the weakest possible conditions for fixed point theorems involving two classes of mappings defined by Kannan and Chatterjea. Our approach relies on the so-called CJM condition, which was originally introduced by…
We study the weakest convergence-type conditions for fixed point results for Banach and Kannan mappings. Building on Suzuki's weakest condition for Banach mappings and our previous result for Kannan mappings, we compare convergence…
We develop a stability theory for minimal projective resolutions of $\mathbf{P}$-modules, where $\mathbf{P}$ is a finite metric poset. We use the G\"ulen-McCleary distance on $\mathbf{P}$-modules together with a new complex matching…
We provide an amendment to the first theorem of "Control Contraction Metrics: Convex and Intrinsic Criteria for Nonlinear Feedback Design" by Manchester & Slotine in the form of an additional technical condition required to show…
Switching-constrained optimization problems form a difficult class of mathematical programs since their feasible set is almost disconnected while standard constraint qualifications are likely to fail at several feasible points. That is why…
Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…