Michel Théra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Michel Théra has a total of 122 co-authors. Here are the top co-authors by number of shared publications:
- Emil Ernst
Aix-Marseille Univ
16 shared publications - Alexander Y. Kruger
Analytical and Algebraic Methods in Optimization Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
14 shared publications - Huynh Van Ngai
Department of Mathematics, University of Quynhon, Qui Nhon, Vietnam
12 shared publications - Jen-Chih Yao
Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung, Taiwan
11 shared publications - Nguyen Huu Tron
Department of Mathematics and Statistics, University of Quy Nhon University of Quy Nhon, Quy Nhon, Vietnam
11 shared publications - Zhou Wei
Hebei Key Laboratory of Machine Learning and Computational Intelligence, College of Mathematics and Information Science, Hebei University, Baoding, China
11 shared publications
Latest Publications
- 7 October 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 211 (1) , 10
Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
- 7 October 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 211 (1) , 10
Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
- 10 June 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (2)
Geometric Stability Analysis for Differential Inclusions Governed by Maximally Monotone Operators
- 10 June 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (2)
Geometric Stability Analysis for Differential Inclusions Governed by Maximally Monotone Operators
- 20 April 2026
- Published by Springer Nature in Decisions in Economics and Finance
- p. 1-19
n-tupled regularity and cyclic fixed points of multivalued mappings in metric spaces
- 20 April 2026
- Published by Springer Nature in Decisions in Economics and Finance
- p. 1-19
n-tupled regularity and cyclic fixed points of multivalued mappings in metric spaces
- 8 April 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (2) , 13
Compact R-Continuity with Applications to Solving Inclusions and Convergence of Algorithms
- 8 April 2026
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 34 (2) , 13
Compact R-Continuity with Applications to Solving Inclusions and Convergence of Algorithms
- Open Access
Monotonicity of Pairs of Operators and Generalized Inertial Proximal Method
Monotonicity of pairs of operators is an extension of monotonicity of operators, which plays an important role in solving non-monotone inclusions. One of challenging problems in this new tool is how to design the associated mappings to obtain the monotone pairs. In this paper, we solve this problem and propose a Generalized Inertial Proximal Point Algorithm (GIPPA) using warped resolvents under the monotonicity of pairs. The weak, strong and linear convergence of the algorithm under some mild assumptions are established. We also provide numerical examples illustrating the implementability and effectiveness of the proposed method.
Open AccessMonotonicity of Pairs of Operators and Generalized Inertial Proximal Method
Monotonicity of pairs of operators is an extension of monotonicity of operators, which plays an important role in solving non-monotone inclusions. One of challenging problems in this new tool is how to design the associated mappings to obtain the monotone pairs. In this paper, we solve this problem and propose a Generalized Inertial Proximal Point Algorithm (GIPPA) using warped resolvents under the monotonicity of pairs. The weak, strong and linear convergence of the algorithm under some mild assumptions are established. We also provide numerical examples illustrating the implementability and effectiveness of the proposed method.
- Open Access
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 1077-1094
On Error Bounds of Inequalities in Asplund Spaces
Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field by itself. This paper is devoted to the study of error bounds of a general inequality defined by a proper lower semicontinuous function on an Asplund space. If one drops the convexity assumption, the dual characterization of error bounds for a general inequality may not be valid, but even in this case, several dual necessary conditions are still obtained in terms of Fréchet/Mordukhovich subdifferentials of the concerned function at points in the solution set. Moreover, for an inequality defined by a convex-composite function that is to say by a function which is the composition of a convex function with a smooth mapping, such dual conditions also turn out to be sufficient to have the error bound property. Our work is an extension of the results on dual characterizations of convex inequalities to the possibly non-convex case.
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 1077-1094
Open AccessOn Error Bounds of Inequalities in Asplund Spaces
Error bounds are central objects in optimization theory and its applications. They were for a long time restricted only to the theory before becoming over the course of time a field by itself. This paper is devoted to the study of error bounds of a general inequality defined by a proper lower semicontinuous function on an Asplund space. If one drops the convexity assumption, the dual characterization of error bounds for a general inequality may not be valid, but even in this case, several dual necessary conditions are still obtained in terms of Fréchet/Mordukhovich subdifferentials of the concerned function at points in the solution set. Moreover, for an inequality defined by a convex-composite function that is to say by a function which is the composition of a convex function with a smooth mapping, such dual conditions also turn out to be sufficient to have the error bound property. Our work is an extension of the results on dual characterizations of convex inequalities to the possibly non-convex case.
- Open Access
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 561-563
In Memory of Hedy Attouch: Advances and Legacies in Mathematical Analysis
The authors give an overview of the mathematical life of Hedy Attouch (1949–2023).
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 561-563
Open AccessIn Memory of Hedy Attouch: Advances and Legacies in Mathematical Analysis
The authors give an overview of the mathematical life of Hedy Attouch (1949–2023).
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 14, 36-63
Coincidence, fixed points in symmetric $ (q_1,q_2) $-quasi-metric spaces and sensitivity analysis of generalized equations
The current paper addresses non-local results on approximate and fixed points theorems for set-valued mappings in the context of symmetric $ (q_1, q_2) $-quasi-metric spaces, considering the regularity of the mappings involved. From these results, we derive non-local coincidence and double fixed point theorems for a pair of set-valued mappings, as well as non-local (Hölder) approximate, Milyutin, and Lyusternik-Graves theorems, along with (Hölder) approximate and implicit multifunction theorems in the same context. Our results extend those recently presented in the literature [ 1 , 25 , 23 , 2 , 26 ], which encompass classical results such as Nadler's multi-valued fixed point theorem [ 22 ] and Dontchev-Rockafellar's fixed point theorem [ 11 ].
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 14, 36-63
Coincidence, fixed points in symmetric $ (q_1,q_2) $-quasi-metric spaces and sensitivity analysis of generalized equations
The current paper addresses non-local results on approximate and fixed points theorems for set-valued mappings in the context of symmetric $ (q_1, q_2) $-quasi-metric spaces, considering the regularity of the mappings involved. From these results, we derive non-local coincidence and double fixed point theorems for a pair of set-valued mappings, as well as non-local (Hölder) approximate, Milyutin, and Lyusternik-Graves theorems, along with (Hölder) approximate and implicit multifunction theorems in the same context. Our results extend those recently presented in the literature [ 1 , 25 , 23 , 2 , 26 ], which encompass classical results such as Nadler's multi-valued fixed point theorem [ 22 ] and Dontchev-Rockafellar's fixed point theorem [ 11 ].
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 17
Hédy Attouch (1949-2023)
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 17
Hédy Attouch (1949-2023)
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 17, 93-105
Explicit convergence rate of the proximal point algorithm under R-continuity
This paper provides a thorough comparison between R-continuity and other fundamental tools in optimization such as metric regularity, metric subregularity, and calmness. We show that R-continuity has some advantages in the convergence rate analysis of algorithms for solving optimization problems. We also present some properties of R-continuity and study the explicit convergence rate of the proximal point algorithm $ (\mathbf{P}\mathbf{P}\mathbf{A}) $ under the R-continuity.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 17, 93-105
Explicit convergence rate of the proximal point algorithm under R-continuity
This paper provides a thorough comparison between R-continuity and other fundamental tools in optimization such as metric regularity, metric subregularity, and calmness. We show that R-continuity has some advantages in the convergence rate analysis of algorithms for solving optimization problems. We also present some properties of R-continuity and study the explicit convergence rate of the proximal point algorithm $ (\mathbf{P}\mathbf{P}\mathbf{A}) $ under the R-continuity.