Self-adaptive-type CQ algorithms for split equality problems

by   Songxiao Li, et al.

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.


page 1

page 2

page 3

page 4


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

This paper is to analyze the approximation solution of a split variation...

Handling equality constraints by adaptive relaxing rule for swarm algorithms

The adaptive constraints relaxing rule for swarm algorithms to handle wi...

Infinite Types, Infinite Data, Infinite Interaction

We describe a way to represent computable functions between coinductive ...

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...

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...

A Self-Adaptive Penalty Method for Integrating Prior Knowledge Constraints into Neural ODEs

The continuous dynamics of natural systems has been effectively modelled...

Automating Pipelines of A/B Tests with Population Split Using Self-Adaptation and Machine Learning

A/B testing is a common approach used in industry to facilitate innovati...

Please sign up or login with your details

Forgot password? Click here to reset