SearcharxivSearch

arXiv subjects

Poom Kumam

Publications and source records attributed to Poom Kumam.

At least 19 recordsLinked to original sources

Compressed sensing matrices from orthogonal spaces over finite fields of odd characteristic

In this paper, we construct deterministic matrices from subspaces of orthogonal spaces over finite fields of odd characteristic and investigate their applicability to compressed sensing. The construction is based on incidence relations among three types of subspaces, yielding families of matrices with explicitly computable dimensions and coherence. Using coherence-based estimates, we establish sufficient conditions under which these matrices satisfy the Restricted Isometry Property for prescribed sparsity levels. We also provide numerical comparisons with DeVore's deterministic construction to illustrate the trade-off between the number of measurements, coherence, and sparse recovery guarantees.

cs.IT

A self-adaptive subgradient extragradient method with conjugate gradient-type direction for pseudomonotone variational inequalities

This paper introduces a subgradient extragradient algorithm with a conjugate gradient-type direction to solve pseudomonotone variational inequality problems in Hilbert spaces. The algorithm features a self-adaptive strategy that eliminates the need for prior knowledge of the Lipschitz constant and incorporate a conjugate gradient-type direction to enhance convergence speed. We establish a result describing the behavior generated therefrom toward the solution set. Using this result, we prove the strong convergence of the proposed method and provide numerical experiments to demonstrate its computational efficacy and robustness.

math.OC

A product of strongly quasi-nonexpansive mappings in Hadamard spaces

In this paper, we prove that the product of strongly quasi-nonexpansive $\Delta$-demiclosed mappings is also a strongly quasi-nonexpansive orbital $\Delta$-demiclosed mapping in Hadamard spaces. Additionally, we establish the $\Delta$-convergence theorem for approximating a common fixed point of infinite products of these mappings in Hadamard spaces. Our results have practical applications in convex function minimization, the minimization of the sum of finitely many convex functions, and solving the convex feasibility problem for finitely many sets in Hadamard spaces.

math.FA

Variational principles using a non-symmetric non-triangular distance

We consider Borwein-Preiss and Ekeland variational principles using distance functions that neither is symmetric nor enjoy the triangular inequality. All the given results rely exclusively on the convergence and continuity behaviors induced synthetically by the distance function itself without any topological implications. At the end of the paper, we also present two applications; the Caristi fixed point theorem and an existence theorem for equilibrium problems.

math.FA

An existence theorem for single leader multi-follower games with direct preference maps

This paper concerns with an existence of a solution for a single leader multi-follower game (SLMFG), where the followers jointly solve an abstract economy problem. Recall that an abstract economy problem is an extension of a generalized Nash equilibrium problem (GNEP) in the sense that the preference of each player can be described without numerical criteria. The results of this paper therefore extend the known literature concerning an existence of a solution of a SLMFG. Due to the lack of criterion functions in the lower-level, the technique we used is quite different from those that deal with GNEPs. In particular, we argue that the follower's abstract economy profiles, {\itshape i.e.,} constraint-preference couples, belong to a particular metric space where the response map is proved to be upper semicontinuous.

math.OC

Quantum fractional revival on unitary Cayley graphs over finite commutative rings

In this paper, we investigate the existence of quantum fractional revival in unitary Cayley graphs over finite commutative rings with identity. We characterize all finite local rings that permit quantum fractional revival in their unitary Cayley graphs. Additionally, we present results for the case of finite commutative rings, as they can be expressed as products of finite local rings.

math.RA

Fixed point properties and Q-nonexpansive retractions in locally convex spaces

Suppose that Q is a family of seminorms on a locally convex space E which determines the topology of E. We study the existence of Q-nonexpansive retractions for families of Q-nonexpansive mappings and prove that a separated and sequentially complete locally convex space $E$ that has the weak fixed point property, has the weak fixed point property for commuting separable semitopological semigroups of Q-nonexpansive mappings. This proves the Bruck's problem [5] for locally convex spaces. Moreover, we prove the existence of Q-nonexpansive retractions for the right amenable Q-nonexpansive semigroups.

math.FA

A Practical Approach to Quasi-convex Optimization

A new and simple method for quasi-convex optimization is introduced from which its various applications can be derived. Especially, a global optimum under constrains can be approximated for all continuous functions.

math.OC

A practical approach to optimization

We present a new approach for finding a minimal value of an arbitrary function assuming only its continuity. The process avoids verifying Lagrange- or KKT-conditions. The method enables us to obtain a Brouwer fixed point (of a continuous function mapping from a cube into itself).

math.OC

Lefschetz numbers and fixed point theory in digital topology

In this paper, we present two types of Lefschetz numbers in the topology of digital images. Namely, the simplicial Lefschetz number $L(f)$ and the cubical Lefschetz number $\bar L(f)$. We show that $L(f)$ is a strong homotopy invariant and has an approximate fixed point theorem. On the other hand, we establish that $\bar L(f)$ is a homotopy invariant and has an $n$-approximate fixed point result. In essence, this means that the fixed point result for $L(f)$ is better than that for $\bar L(f)$ while the homotopy invariance of $\bar L(f)$ is better than that of $L(f)$. Unlike in classical topology, these Lefschetz numbers give lower bounds for the number of approximate fixed points. Finally, we construct some illustrative examples to demonstrate our results.

math.GN

Iterative algorithm with structured diagonal Hessian approximation for solving nonlinear least squares problems

Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a diagonal Hessian approximation for solving nonlinear least-squares problems. We devise appropriate safeguarding strategies to ensure the Hessian matrix is positive definite throughout the iteration process. The proposed algorithm generates descent direction and is globally convergent. Preliminary numerical experiments show that the proposed method is competitive with a recently developed similar method.

math.OC

Coincidence and Self-coincidence of Many Maps between Digital Images

The aim of this paper is to generalize some of the properties and results regarding both the coincidence point set and the common fixed point set of any two digitally continuous maps to the case of several (more than two) digitally continuous mappings. Moreover, we study how rigidity may affect these coincidence and homotopy coincidence point sets. Also, we investigate whether an established result by Staecker in Nielsen classical topology regarding the coincidence set for many maps still remains valid in the digital topological setting.

math.GN

Coincidence Point Sets in Digital Topology

In this article, we investigate some properties of the coincidence point set of digitally continuous maps. Following the Rosenfeld graphical model which seems more combinatorial than topological, we expect to achieve results that might not be analogous to the classical topological fixed point theory. We also introduce and study some topological invariants related to the coincidence and common fixed point sets for continuous maps on a digital image. Moreover, we study how these coincidence point sets are affected by rigidity and deformation retraction. Lastly, we present briefly a concept of divergence degree of a point in a digital image.

math.GN

Splitting Algorithms of Common Solutions Between Equilibrium and Inclusion Problems on Hadamard Manifolds

The aim of this article is to introduce an iterative algorithm for finding a common solution from the set of an equilibrium point for a bifunction and the set of a singularity of an inclusion problem on an Hadamard manifold. We also discuss some particular cases of the problem by the proposed algorithm. The convergence of a sequence generated by the proposed algorithm is proved under mild assumptions. Moreover, we apply our results to solving minimization problems and minimax problems.

math.FA

Monotone vector fields and generation of nonexpansive semigroups in complete CAT(0) spaces

In this paper, we discuss about monotone vector fields, which is a typical extension to the theory of convex functions, by exploiting the tangent space structure. This new approach to monotonicity in CAT(0) spaces stands in opposed to the monotonicity defined earlier in CAT(0) spaces by Khatibzadeh and Ranjbar [14] and Chaipunya and Kumam [8]. In particular, this new concept extends the theory from both Hilbert spaces and Hadamard manifolds, while the known concept barely has any obvious relationship to the theory in Hadamard manifolds. We also study the corresponding resolvents and Yosida approximations of a given monotone vector field and derive many of their important properties. Finally, we prove a generation theorem by showing convergence of an exponential formula applied to resolvents of a monotone vector field. Our findings improve several known results in the literature including generation theorems of Jost [13, Theorem 1.3.13], Mayer [19, Theorem 1.13], Stojkovic [22, Theorem 2.18], and Bacák [4, Theorem 1.5] for proper, convex, lower semicontinuous functions in the context of complete CAT(0) spaces, and also by Iwamiya and Okochi [11, Theorem 4.1] for monotone vector fields in the context of Hadamard manifolds.

math.FA

Equilibrium Problems and Proximal Algorithms in Hadamard Spaces

In this paper, we consider the equilibrium problems and also their regularized problems under the setting of Hadamard spaces. The solution to the regularized problem is represented in terms of resolvent operators. As an essential machinery in the existence of an equilibrium, we first prove that the KKM principle is attained in general Hadamard spaces without assuming the compactness of the closed convex hull of a finite set. We construct the proximal algorithm based on this regularization and give convergence analysis adequately.

math.OC

JH$\im$-suboperator pairs with application to invariant approximation by using C-class functions

In this paper, by using C-class functions some results and common fixed point theorems are established for generalized JH-operator pairs of Sintu- navarat and Kumam (Journal of Inequalities and Applications, 67 (2011), 10 pages, doi:10.1186/1029-242X-2011-67) . Also, a new class of non-commuting self-mappings as JH$\im$-suboperator pairs are introduced. Final, as applications, several invariant approximation results are discussed

math.FA

Random fixed point theorems for Hardy-Rogers self-random operators with applications to random integral equations

In this paper, we prove some random fixed point theorems for Hardy-Rogers self-random operators in separable Banach spaces and, as some applications, we show the existence of a solution for random nonlinear integral equations in Banach spaces. Some stochastic versions of deterministic fixed point theorems for Hardy-Rogers self mappings and stochastic integral equations are obtained.

math.FA