Related papers: Strongly proper forcing and some problems of Forem…
Recently there has been an increasing interest in primal-dual methods for model predictive control (MPC), which require minimizing the (augmented) Lagrangian at each iteration. We propose a novel first order primal-dual method, termed…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
The antifield formalism is extended so as to incorporate the rigid symmetries of a given theory. To that end, it is necessary to introduce global ghosts not only for the given rigid symmetries, but also for all the higher order conservation…
Part I: We would like to generalize imaginary elements, weight of ${\rm ortp}(a,M,N),{\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [Sh:c, Ch.III,V,\S4] to the context of good frames. This requires allowing the vocabulary to…
The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping…
In this paper, we introduce the concepts of strongly 2-absorbing primary ideals (resp., submodules) and strongly 2-absorbing ideals (resp., submodules) as generalizations of strongly prime ideals. Furthermore, we investigate some basic…
We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of…
We show that the so-called hidden potential symmetries considered in a recent paper [Gandarias M., Physica A, 2008, V.387, 2234-2242] are ordinary potential symmetries that can be obtained using the method introduced by Bluman and…
We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…
A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…
Given an ideal $I$, the containment problem is concerned about finding the values $m$ and $n$ such that the $m$-th symbolic power of $I$ is contained in its $n$-th ordinary power. In this paper we consider this problem focusing on two…
We study a general contracting problem between the principal and a finite set of competitive agents, who perform equivalent changes of measure by controlling the drift of the output process and the compensator of its associated jump…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
Derived from the concentration-compactness principle, the concept of generalized minimizer can be used to define generalized solutions of variational problems which may have components ``infinitely'' distant from each other. In this article…
We argue against Foreman's proposal to settle the continuum hypothesis and other classical independent questions via the adoption of generic large cardinal axioms.
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…
We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…
Image inverse problems have numerous applications, including image processing, super-resolution, and computer vision, which are important areas in image science. These application models can be seen as a three-function composite…
In this paper, we prove a result similar to results of Itoh and Hong-Ulrich, proving that integral closure of an ideal is compatible with specialization by a general element of that ideal for ideals of height at least two in a large class…