default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul-Emile Maingé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]Paul-Emile Maingé, André Weng-Law:
Accelerated forward-backward algorithms for structured monotone inclusions. Comput. Optim. Appl. 88(1): 167-215 (2024)- 2023
- [j15]Gilles Joseph, Paul-Emile Maingé:
Characterization of optimal durations of unemployment benefits in a nonstationary job search model. Math. Soc. Sci. 125: 76-93 (2023) - 2022
- [j14]Paul-Emile Maingé
, Florian Labarre:
Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization. Numer. Algorithms 90(1): 99-136 (2022) - 2016
- [j13]Paul-Emile Maingé:
Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure. Comput. Math. Appl. 72(3): 720-728 (2016) - [j12]Paul-Emile Maingé, M. L. Gobinddass:
Convergence of One-Step Projected Gradient Methods for Variational Inequalities. J. Optim. Theory Appl. 171(1): 146-168 (2016) - 2014
- [j11]Paul-Emile Maingé:
A viscosity method with no spectral radius requirements for the split common fixed point problem. Eur. J. Oper. Res. 235(1): 17-27 (2014) - 2013
- [j10]Paul-Emile Maingé:
First-Order Continuous Newton-like Systems for Monotone Inclusions. SIAM J. Control. Optim. 51(2): 1615-1638 (2013) - 2011
- [j9]Paul-Emile Maingé, Stefan Maruster:
Convergence in norm of modified Krasnoselski-Mann iterations for fixed points of demicontractive mappings. Appl. Math. Comput. 217(24): 9864-9874 (2011) - 2010
- [j8]Paul-Emile Maingé, Nora Merabet:
A new inertial-type hybrid projection-proximal algorithm for monotone inclusions. Appl. Math. Comput. 215(9): 3149-3162 (2010) - [j7]Paul-Emile Maingé:
The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces. Comput. Math. Appl. 59(1): 74-79 (2010) - [j6]Paul-Emile Maingé:
Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints. Eur. J. Oper. Res. 205(3): 501-506 (2010) - 2009
- [j5]Paul-Emile Maingé:
Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization. J. Glob. Optim. 45(4): 631-644 (2009) - 2008
- [j4]Paul-Emile Maingé:
A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems. SIAM J. Control. Optim. 47(3): 1499-1515 (2008) - [j3]Paul-Emile Maingé, Abdellatif Moudafi:
Convergence of New Inertial Proximal Methods for DC Programming. SIAM J. Optim. 19(1): 397-413 (2008) - 2006
- [j2]Paul-Emile Maingé:
Viscosity methods for zeroes of accretive operators. J. Approx. Theory 140(2): 127-140 (2006) - 1999
- [j1]Marie Noëlle Le Roux, Paul-Emile Maingé:
Numerical solution of a fast diffusion equation. Math. Comput. 68(226): 461-485 (1999)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-03 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
