default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Peypouquet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Juan José Maulén
, Juan Peypouquet:
A Speed Restart Scheme for a Dynamics with Hessian-Driven Damping. J. Optim. Theory Appl. 199(2): 831-855 (2023)- 2020
- [j14]Cesare Molinari, Juan Peypouquet, Fernando Roldán:
Alternating forward-backward splitting for linearly constrained optimization problems. Optim. Lett. 14(5): 1071-1088 (2020) - 2019
- [j13]Andrés Contreras, Juan Peypouquet:
Asymptotic Equivalence of Evolution Equations Governed by Cocoercive Operators and Their Forward Discretizations. J. Optim. Theory Appl. 182(1): 30-48 (2019) - [j12]Hédy Attouch, Juan Peypouquet:
Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators. Math. Program. 174(1-2): 391-432 (2019) - 2018
- [j11]Cesare Molinari, Juan Peypouquet:
Lagrangian Penalization Scheme with Parallel Forward-Backward Splitting. J. Optim. Theory Appl. 177(2): 413-447 (2018) - [j10]Hédy Attouch, Zaki Chbani, Juan Peypouquet, Patrick Redont:
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1-2): 123-175 (2018) - 2017
- [j9]Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet, Bruce W. Suter:
From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2): 471-507 (2017) - 2016
- [j8]Enrique Jélvez, Nelson Morales, Pierre Nancel-Penard, Juan Peypouquet, Patricio Reyes:
Aggregation heuristic for the open-pit block scheduling problem. Eur. J. Oper. Res. 249(3): 1169-1177 (2016) - [j7]Hédy Attouch, Juan Peypouquet:
The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than 1/k2. SIAM J. Optim. 26(3): 1824-1834 (2016) - 2015
- [j6]Pierre Frankel, Guillaume Garrigos, Juan Peypouquet:
Splitting Methods with Variable Metric for Kurdyka-Łojasiewicz Functions and General Convergence Rates. J. Optim. Theory Appl. 165(3): 874-900 (2015) - 2014
- [j5]Hédy Attouch, Juan Peypouquet, Patrick Redont:
A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization. SIAM J. Optim. 24(1): 232-256 (2014) - 2013
- [j4]Nahla Noun, Juan Peypouquet:
Forward-Backward Penalty Scheme for Constrained Convex Minimization Without Inf-Compactness. J. Optim. Theory Appl. 158(3): 787-795 (2013) - 2012
- [j3]Juan Peypouquet:
Coupling the Gradient Method with a General Exterior Penalization Scheme for Convex Minimization. J. Optim. Theory Appl. 153(1): 123-138 (2012) - 2011
- [j2]Hédy Attouch, Marc-Olivier Czarnecki, Juan Peypouquet:
Prox-Penalization and Splitting Methods for Constrained Variational Problems. SIAM J. Optim. 21(1): 149-173 (2011) - [j1]Hédy Attouch, Marc-Olivier Czarnecki, Juan Peypouquet:
Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities. SIAM J. Optim. 21(4): 1251-1274 (2011)
Coauthor Index
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 2025-01-20 23:59 CET 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:
