Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Latest Articles
91
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Noncoercive convex sweeping processes with velocity constraints

, &
Received 30 Dec 2023, Accepted 25 May 2024, Published online: 06 Jul 2024
 

Abstract

In this paper, we investigate noncoercive monotone convex sweeping processes with velocity constraints, a topic not previously investigated. Using some fundamental results on Bochner integration, the Tikhonov regularization method, a solution existence result for coercive convex sweeping processes with velocity constraints and a useful fact on measurable single-valued mappings, we prove the solution existence and properties of the solution set of noncoercive convex sweeping processes with velocity constraints under suitable conditions. These results represent a significant contribution, addressing a specific aspect of an open question posed in our recent work [Adly et al., Convex and nonconvex sweeping processes with velocity constraints: well-posedness and insights. Appl Math Optim. 2023;88(Paper No. 45)]. Additionally, we resolve two other open questions from the same paper concerning the behaviour of the regularized trajectories, relying on the Dominated Convergence Theorem for Bochner integration.

2020 Mathematics Subject Classifications:

Acknowledgments

The research of Samir Adly was funded by Institut de recherche XLIM, Université de Limoges. Research of Nguyen Nang Thieu was supported by the project DLTE00.01/22-23 of Vietnam Academy of Science and Technology. Nguyen Dong Yen was supported by Institute of Mathematics, Vietnam Academy of Science and Technology, the XLIM laboratory at the University of Limoges, and the Margot research federation. The authors highly appreciate the careful review of the paper and the valuable suggestions of the two anonymous referees.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Notes

1 In the whole paper [Citation9], it suffices to assume that the set-valued mapping C:[0,T]H is Lipschitz-like around every point (t,x) in its graph with t(0,T). Indeed, in the proof of [Citation9, Theorem 3.7], by taking λ¯=t¯(0,T) one can show that the formula z(t)=x(μ(t),t) defines a continuous function z:(0,T)H. Then, with a slight modification, the remaining of the proof of [Citation9, Theorem 3.7] goes well as it is.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 630.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.