English
Related papers

Related papers: Computing a Fixed Point of Contraction Maps in Pol…

200 papers

For a family of graphs $\cal F$, the $\mathcal{F}$-Contraction problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $S \subseteq E(G)$ of size at most $k$ such that $G/S$ belongs to $\cal F$.…

Data Structures and Algorithms · Computer Science 2017-08-03 Akanksha Agrawal , Saket Saurabh , Prafullkumar Tale

We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.

General Topology · Mathematics 2010-05-19 Bessem Samet , Habib Yazidi

In this paper, we consider the problem of finding an almost surely common fixed point of a family of paracontraction maps indexed on a probability space, which we refer to as the stochastic feasibility problem. We show that a random…

Dynamical Systems · Mathematics 2020-08-12 Edgar Matias , Majela Pentón Machado

We introduce the problem EndOfPotentialLine and the corresponding complexity class EOPL of all problems that can be reduced to it in polynomial time. This class captures problems that admit a single combinatorial proof of their joint…

Computational Complexity · Computer Science 2018-04-19 John Fearnley , Spencer Gordon , Ruta Mehta , Rahul Savani

We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.

General Topology · Mathematics 2016-11-25 Hassen Aydi

In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…

General Topology · Mathematics 2013-03-26 Maher Berzig , Mircea-Dan Rus

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

Data Structures and Algorithms · Computer Science 2011-01-04 Amit Deshpande , Kasturi Varadarajan , Madhur Tulsiani , Nisheeth K. Vishnoi

This paper addresses the general continuous single facility location problems in finite dimension spaces under possibly different $\ell_p$ norms in the demand points. We analyze the difficulty of this family of problems and revisit…

Optimization and Control · Mathematics 2013-12-31 Víctor Blanco , Justo Puerto , Safae El Haj Ben Ali

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Classical Analysis and ODEs · Mathematics 2026-04-21 Vjekoslav Kovač , Adian Anibal Santos Sepčić

A connected graph has a $(k,\ell)$-cover if each of its edges is contained in at least $\ell$ cliques of order $k$. Motivated by recent advances in extremal combinatorics and the literature on edge modification problems, we study the…

Data Structures and Algorithms · Computer Science 2025-11-12 Amirali Madani , Anil Maheshwari , Babak Miraftab , Bodhayan Roy

We establish the existence of a common fixed point for mappings that satisfy and extend the F-contraction condition. To support our findings, we present pertinent definitions and properties associated with F-contraction mappings.…

General Mathematics · Mathematics 2025-05-08 Djamel Deghoul , Zoheir Chebel , Abdellatif Boureghda , Salah Benyoucef

Estimating the p-th frequency moment of data stream is a very heavily studied problem. The problem is actually trivial when p = 1, assuming the strict Turnstile model. The sample complexity of our proposed algorithm is essentially O(1) near…

Data Structures and Algorithms · Computer Science 2015-03-14 Ping Li

In this paper we present some fixed-figure theorems as a geometric approach to the fixed-point theory when the number of fixed points of a self-mapping is more than one. To do this, we modify the Jleli-Samet type contraction and define new…

Metric Geometry · Mathematics 2021-08-19 Hülya Atyimur , Nihal Taş

Recent work of Acharya et al. (NeurIPS 2019) showed how to estimate the entropy of a distribution $\mathcal D$ over an alphabet of size $k$ up to $\pm\epsilon$ additive error by streaming over $(k/\epsilon^3) \cdot…

Data Structures and Algorithms · Computer Science 2022-05-23 Maryam Aliakbarpour , Andrew McGregor , Jelani Nelson , Erik Waingarten

Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…

Numerical Analysis · Mathematics 2026-03-11 Théophile Chaumont-Frelet , Zhaonan Dong , Gregor Gantner , Martin Vohralík

A generalized version of both rectangular metric spaces and rectangular quasi-metric spaces is known as rectangular quasi b-metric spaces (RQB-MS). In the current work, we define generalized $( \theta,\phi) $-contraction mappings and study…

Metric Geometry · Mathematics 2024-07-12 Mohamed Rossafi , Abdelkarim Kari

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

Optimization and Control · Mathematics 2021-12-13 Florian Lauster , D. Russell Luke

In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…

Optimization and Control · Mathematics 2025-02-05 Samir Adly , Ba Khiet Le

In this paper, we study the existence of common fixed points of family of multivalued mappings satisfying generalized F-contractive conditions in ordered metric spaces. These results establish some of the general common fixed point theorems…

General Mathematics · Mathematics 2016-06-17 Talat Nazir , Sergei Silvestrov

Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions $f$ over unrestricted $d$-dimensional domains is one of the most fundamental problems in classical…

Optimization and Control · Mathematics 2024-09-13 Alexandros Hollender , Manolis Zampetakis