DeepAI
Log In Sign Up

Self-adaptive-type CQ algorithms for split equality problems

11/16/2020
by   Songxiao Li, et al.
0

The purpose of this paper is concerned with the approximate solution of split equality problems. We introduce two types of algorithms and a new self-adaptive stepsize without prior knowledge of operator norms. The corresponding strong convergence theorems are obtained under mild conditions. Finally, some numerical experiments demonstrate the efficiency of our results and compare them with the existing results.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/16/2020

Several self-adaptive inertial projection algorithms for solving split variational inclusion problems

This paper is to analyze the approximation solution of a split variation...
05/25/2005

Handling equality constraints by adaptive relaxing rule for swarm algorithms

The adaptive constraints relaxing rule for swarm algorithms to handle wi...
02/28/2019

Infinite Types, Infinite Data, Infinite Interaction

We describe a way to represent computable functions between coinductive ...
09/19/2021

On the convergence and applications of the inertial-like method for null-point problems

In this paper, we propose two novel inertial-like algorithms for solving...
01/11/2021

Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory

In this paper, we make a substantial step towards an encoding of Cubical...
09/04/2022

Smoothers Based on Nonoverlapping Domain Decomposition Methods for H(𝐜𝐮𝐫𝐥) Problems: A Numerical Study

This paper presents a numerical study on multigrid algorithms of V-cycle...
12/01/2012

Computing Strong and Weak Permissions in Defeasible Logic

In this paper we propose an extension of Defeasible Logic to represent a...