The University of Southampton
University of Southampton Institutional Repository

A fixed-time stable forward–backward dynamical system for solving generalized monotone inclusions

A fixed-time stable forward–backward dynamical system for solving generalized monotone inclusions
A fixed-time stable forward–backward dynamical system for solving generalized monotone inclusions

We propose a forward–backward splitting dynamical system for solving inclusion problems of the form 0∈A(x)+B(x) in Hilbert spaces, where A is a maximal operator and B is a single-valued operator. Involved operators are assumed to satisfy a generalized monotonicity condition, which is weaker than the standard monotone assumptions. Under mild conditions on parameters, we establish the fixed-time stability of the proposed dynamical system. In addition, we consider an explicit forward Euler discretization of the dynamical system leading to a new forward backward algorithm for which we present the convergence analysis. Applications to other optimization problems such as constrained optimization problems, mixed variational inequalities, and variational inequalities are presented and some numerical examples are given to illustrate the theoretical results.

47J20, 47J30, 49J40, 49J53, 49M37, Dynamical system, Fixed-time stability, Forward–backward method, Generalized monotone inclusion
1598-5865
Tran, Nam V.
17703457-a170-4913-b4cd-4daeabc897f3
Hai, Le T.T.
c3f40bd6-2358-4612-b9c1-44c8a986b18b
An, Truong V.
3628f1bf-79ab-41cc-92cb-6d0cd9c73d2c
Vuong, Phan T.
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Tran, Nam V.
17703457-a170-4913-b4cd-4daeabc897f3
Hai, Le T.T.
c3f40bd6-2358-4612-b9c1-44c8a986b18b
An, Truong V.
3628f1bf-79ab-41cc-92cb-6d0cd9c73d2c
Vuong, Phan T.
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf

Tran, Nam V., Hai, Le T.T., An, Truong V. and Vuong, Phan T. (2024) A fixed-time stable forward–backward dynamical system for solving generalized monotone inclusions. Journal of Applied Mathematics and Computing. (doi:10.1007/s12190-024-02186-1).

Record type: Article

Abstract

We propose a forward–backward splitting dynamical system for solving inclusion problems of the form 0∈A(x)+B(x) in Hilbert spaces, where A is a maximal operator and B is a single-valued operator. Involved operators are assumed to satisfy a generalized monotonicity condition, which is weaker than the standard monotone assumptions. Under mild conditions on parameters, we establish the fixed-time stability of the proposed dynamical system. In addition, we consider an explicit forward Euler discretization of the dynamical system leading to a new forward backward algorithm for which we present the convergence analysis. Applications to other optimization problems such as constrained optimization problems, mixed variational inequalities, and variational inequalities are presented and some numerical examples are given to illustrate the theoretical results.

Text
s12190-024-02186-1 - Version of Record
Available under License Creative Commons Attribution.
Download (912kB)

More information

Accepted/In Press date: 10 July 2024
Published date: 31 July 2024
Keywords: 47J20, 47J30, 49J40, 49J53, 49M37, Dynamical system, Fixed-time stability, Forward–backward method, Generalized monotone inclusion

Identifiers

Local EPrints ID: 493385
URI: http://eprints.soton.ac.uk/id/eprint/493385
ISSN: 1598-5865
PURE UUID: aa13b23e-5a36-4955-886e-acce6551a547
ORCID for Phan T. Vuong: ORCID iD orcid.org/0000-0002-1474-994X

Catalogue record

Date deposited: 02 Sep 2024 16:41
Last modified: 03 Sep 2024 02:01

Export record

Altmetrics

Contributors

Author: Nam V. Tran
Author: Le T.T. Hai
Author: Truong V. An
Author: Phan T. Vuong ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×