Paul-Emile Maingé
Paul-Emile Maingé has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- André Weng-Law
Laboratoire MEMIAD, Université des Antilles, Campus de Schoelcher, 97233 Schoelcher, Cedex, France
3 shared publications - Florian Labarre
MEMIAD, Université des Antilles, Martinique, F.W.I., France
2 shared publications - Gilles Joseph
Univ Antilles, Fac Droit & Econ Martinique, LC2S UMR CNRS 8053, F-97209 Schoelcher, Martinique, France
2 shared publications Abdellatif Moudafi
Aix Marseille Université CNRS-LSIS UMR 7296,13397, Marseille, France
1 shared publication- Abdellatif Moudafi
Aix-Marseille Université, Laboratoire d’Informatique et Systèmes (LIS UMR 7020 CNRS / AMU /UTLN), Marseille, France
1 shared publication - Eric Kamwa
LC2S UMR CNRS 8053 Univ. des Antilles Schoelcher Cedex F-97275 Martinique France
1 shared publication
Latest Publications
- 11 February 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 88 (1) , 167-215
Accelerated forward–backward algorithms for structured monotone inclusions
- 11 February 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 88 (1) , 167-215
Accelerated forward–backward algorithms for structured monotone inclusions
- 1 November 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 89 (1) , 1-45
Fast Continuous Dynamics Inside the Graph of Subdifferentials of Nonsmooth Convex Functions
- 1 November 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 89 (1) , 1-45
Fast Continuous Dynamics Inside the Graph of Subdifferentials of Nonsmooth Convex Functions
- 25 July 2023
- Published by Elsevier in Mathematical Social Sciences
- Vol. 125, 76-93
Characterization of optimal durations of unemployment benefits in a nonstationary job search model
- 25 July 2023
- Published by Elsevier in Mathematical Social Sciences
- Vol. 125, 76-93
Characterization of optimal durations of unemployment benefits in a nonstationary job search model
- 3 February 2023
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 31 (1) , 1-31
Fast Continuous Dynamics Inside the Graph of Maximally Monotone Operators
- 3 February 2023
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 31 (1) , 1-31
Fast Continuous Dynamics Inside the Graph of Maximally Monotone Operators
- Open Access
- 1 January 2022
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 29 (3) , 893-920
Fast Convergence of Generalized Forward-Backward Algorithms for Structured Monotone Inclusions
We develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is first considered, by incorporating an inertial term (close to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates (x_n) ( x n ) , with worst-case rates of o(n^{-1}) o ( n − 1 ) in terms of both the discrete velocity and the fixed point residual, instead of the classical rates of {\cal O}(n^{-1/2}) O ( n − 1 / 2 ) established so far for related algorithms. Our procedure is then adapted to more general monotone inclusions and a fast primal-dual algorithm is proposed for solving convex-concave saddle point problems.
- 1 January 2022
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 29 (3) , 893-920
Open AccessFast Convergence of Generalized Forward-Backward Algorithms for Structured Monotone Inclusions
We develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is first considered, by incorporating an inertial term (close to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates (x_n) ( x n ) , with worst-case rates of o(n^{-1}) o ( n − 1 ) in terms of both the discrete velocity and the fixed point residual, instead of the classical rates of {\cal O}(n^{-1/2}) O ( n − 1 / 2 ) established so far for related algorithms. Our procedure is then adapted to more general monotone inclusions and a fast primal-dual algorithm is proposed for solving convex-concave saddle point problems.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 9 (1) , 27-32
Copositivity meets D. C. optimization
Based on a work by M. Dur and J.-B. Hiriart-Urruty[3], we consider the problem of whether a symmetric matrix is copositive formulated as a difference of convex functions problem. The convex nondifferentiable function in this d.c. decomposition being proximable, we then apply a proximal-gradient method to approximate the related stationary points. Whereas, in [3], the DCA algorithm was used.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 9 (1) , 27-32
Copositivity meets D. C. optimization
Based on a work by M. Dur and J.-B. Hiriart-Urruty[3], we consider the problem of whether a symmetric matrix is copositive formulated as a difference of convex functions problem. The convex nondifferentiable function in this d.c. decomposition being proximable, we then apply a proximal-gradient method to approximate the related stationary points. Whereas, in [3], the DCA algorithm was used.
- 1 September 2021
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 84 (S2) , 2027-2061
Accelerated Proximal Algorithms with a Correction Term for Monotone Inclusions
- 1 September 2021
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 84 (S2) , 2027-2061
Accelerated Proximal Algorithms with a Correction Term for Monotone Inclusions
- 27 August 2021
- Published by Springer Nature in Numerical Algorithms
- Vol. 90 (1) , 99-136
Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
- 27 August 2021
- Published by Springer Nature in Numerical Algorithms
- Vol. 90 (1) , 99-136
Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
- 19 June 2021
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (2) , 425-451
First-Order Frameworks for Continuous Newton-like Dynamics Governed by Maximally Monotone Operators
- 19 June 2021
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (2) , 425-451
First-Order Frameworks for Continuous Newton-like Dynamics Governed by Maximally Monotone Operators
- Open Access
How to obtain an overall reduction of individual income deprivations by means of a finite sequence of T 2 -transformations? A solution and a well-suited algorithm
Finite sequences of T 2-transformations is one of the transfer mechanisms that can be used to achieve the reduction of income inequality such that no individual will experiment an increase of his total deprivation: some individuals may notice a reduction while others may record no change. We define the conditions for which a finite sequence of T 2-transformations will guarantee that every individual experiments a reduction in his total deprivation and we provide a suited algorithm for such a possibility.
Open AccessHow to obtain an overall reduction of individual income deprivations by means of a finite sequence of T 2 -transformations? A solution and a well-suited algorithm
Finite sequences of T 2-transformations is one of the transfer mechanisms that can be used to achieve the reduction of income inequality such that no individual will experiment an increase of his total deprivation: some individuals may notice a reduction while others may record no change. We define the conditions for which a finite sequence of T 2-transformations will guarantee that every individual experiments a reduction in his total deprivation and we provide a suited algorithm for such a possibility.