The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...

New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1 , 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these algorithms have uniform reduction per iteration, independent of the finest mesh size and number of...

For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson’s constraint qualification, the following conditions are proved to be equivalent: the strong second order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke’s Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others.

We present a unified approach to subdivision algorithms for meshes with arbitrary topology which admits a rigorous analysis of the generated surface and give a sufficient condition for the regularity of the surface, i.e. for the existence of a regular smooth parametrization near the extraordinary point. The criterion is easily applicable to all known algorithms such as those of Doo-Sabin and Ca...

In this paper, we consider the characterization of strong stationary solutions to equilibrium problems with equilibrium constraints (EPECs). Assuming that the underlying generalized equation satisfies strong regularity in the sense of Robinson, an explicit multiplier-based stationarity condition can be derived. This is applied then to an equilibrium model arising from ISO-regulated electricity ...

We further investigate the uniform regularity property of collections of sets via primal and dual characterizing constants. These constants play an important role in determining convergence rates of projection algorithms for solving feasibility problems.

We give new regularity conditions based on epigraphs that assure strong duality between a given primal convex optimization problem and its Lagrange and Fenchel-Lagrange dual problems, respectively, in infinite dimensional spaces. Moreover we completely characterize through equivalent statements the so-called stable strong duality between the initial problem and the mentioned duals.

We establish novel moment bounds for strong solutions of the stochastic 3D Primitive Equations. Using these bounds we establish the continuity of the associated Markovian semigroup and prove the existence of an invariant measure associated to these equations. This measure is supported on strong solutions, but is furthermore shown to have higher regularity properties.