default search action
Olivier Fercoq
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Benoît Giniès, Xiaoyu Bie, Olivier Fercoq, Gaël Richard:
Using Random Codebooks for Audio Neural AutoEncoders. EUSIPCO 2024: 311-315 - 2023
- [j15]Olivier Fercoq:
Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient. Open J. Math. Optim. 4: 1-34 (2023) - [c23]Thomas Pethick, Olivier Fercoq, Puya Latafat, Panagiotis Patrinos, Volkan Cevher:
Solving stochastic weak Minty variational inequalities without increasing batch size. ICLR 2023 - [i21]Thomas Pethick, Olivier Fercoq, Puya Latafat, Panagiotis Patrinos
, Volkan Cevher:
Solving stochastic weak Minty variational inequalities without increasing batch size. CoRR abs/2302.09029 (2023) - [i20]Thomas Pethick, Puya Latafat, Panagiotis Patrinos
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. CoRR abs/2302.09831 (2023) - 2022
- [j14]Antoine Back
Power-aware feature selection for optimized Analog-to-Feature converter. Microelectron. J. 122: 105386 (2022) - [j13]Ion Necoara
Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems. Math. Oper. Res. 47(4): 2641-2666 (2022) - [j12]Ahmet Alacaoglu, Olivier Fercoq
On the Convergence of Stochastic Primal-Dual Hybrid Gradient. SIAM J. Optim. 32(2): 1288-1318 (2022) - [c22]Thomas Pethick, Puya Latafat, Panos Patrinos, Olivier Fercoq, Volkan Cevher:
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. ICLR 2022 - 2021
- [j11]Olivier Fercoq
A generic coordinate descent solver for non-smooth convex optimisation. Optim. Methods Softw. 36(6): 1202-1222 (2021) - [j10]Alp Yurtsever, Joel A. Tropp
Scalable Semidefinite Programming. SIAM J. Math. Data Sci. 3(1): 171-200 (2021) - 2020
- [j9]Olivier Fercoq
Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comput. Optim. Appl. 75(1): 63-91 (2020) - [j8]Quoc Tran-Dinh, Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
An adaptive primal-dual framework for nonsmooth convex minimization. Math. Program. Comput. 12(3): 451-491 (2020) - [c21]Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher
Random extrapolation for primal-dual coordinate descent. ICML 2020: 191-201 - [c20]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. ICML 2020: 3052-3060 - [c19]Antoine Back
Feature selection algorithms for flexible analog-to-feature converter. NEWCAS 2020: 186-189 - [i19]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. CoRR abs/2002.07530 (2020) - [i18]Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
Random extrapolation for primal-dual coordinate descent. CoRR abs/2007.06528 (2020) - [i17]Eugène Ndiaye, Olivier Fercoq, Joseph Salmon:
Screening Rules and its Complexity for Active Set Identification. CoRR abs/2009.02709 (2020)
2010 – 2019
- 2019
- [j7]Olivier Fercoq
A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions. SIAM J. Optim. 29(1): 100-134 (2019) - [c18]Louis Faury, Clément Calauzènes, Olivier Fercoq:
Benchmarking GNN-CMA-ES on the BBOB noiseless testbed. GECCO (Companion) 2019: 1928-1936 - [c17]Olivier Fercoq, Ahmet Alacaoglu, Ion Necoara, Volkan Cevher
Almost surely constrained convex optimization. ICML 2019: 1910-1919 - [c16]Eugène Ndiaye, Tam Le, Olivier Fercoq, Joseph Salmon, Ichiro Takeuchi:
Safe Grid Search with Optimal Complexity. ICML 2019: 4771-4780 - [c15]Alp Yurtsever, Olivier Fercoq, Volkan Cevher
A Conditional-Gradient-Based Augmented Lagrangian Framework. ICML 2019: 7272-7281 - [c14]Francesco Locatello, Alp Yurtsever, Olivier Fercoq, Volkan Cevher
Stochastic Frank-Wolfe for Composite Convex Minimization. NeurIPS 2019: 14246-14256 - [i16]Francesco Locatello, Alp Yurtsever, Olivier Fercoq, Volkan Cevher:
Stochastic Conditional Gradient Method for Composite Convex Minimization. CoRR abs/1901.10348 (2019) - [i15]Louis Faury, Clément Calauzènes, Olivier Fercoq, Syrine Krichene
Improving Evolutionary Strategies with Generative Neural Networks. CoRR abs/1901.11271 (2019) - 2018
- [j6]Quoc Tran-Dinh, Olivier Fercoq, Volkan Cevher
A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization. SIAM J. Optim. 28(1): 96-134 (2018) - [c13]Mathurin Massias, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Generalized Concomitant Multi-Task Lasso for Sparse Multimodal Regression. AISTATS 2018: 998-1007 - [c12]Alp Yurtsever, Olivier Fercoq, Francesco Locatello, Volkan Cevher
A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming. ICML 2018: 5713-5722 - [i14]Louis Faury, Flavian Vasile, Clément Calauzènes, Olivier Fercoq:
Neural Generative Models for Global Optimization with Gradients. CoRR abs/1805.08594 (2018) - [i13]Eugène Ndiaye, Tam Le, Olivier Fercoq, Joseph Salmon, Ichiro Takeuchi:
Safe Grid Search with Optimal Complexity. CoRR abs/1810.05471 (2018) - 2017
- [j5]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Gap Safe Screening Rules for Sparsity Enforcing Penalties. J. Mach. Learn. Res. 18: 128:1-128:33 (2017) - [c11]Maxime Sangnier, Olivier Fercoq, Florence d'Alché-Buc:
Data sparse nonparametric regression with ε-insensitive losses. ACML 2017: 192-207 - [c10]Ahmet Alacaoglu, Quoc Tran-Dinh, Olivier Fercoq, Volkan Cevher
Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization. NIPS 2017: 5852-5861 - 2016
- [j4]Olivier Fercoq, Peter Richtárik:
Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent. SIAM Rev. 58(4): 739-771 (2016) - [c9]Pascal Bianchi, Olivier Fercoq:
Using big steps in coordinate descent primal-dual algorithms. CDC 2016: 1895-1899 - [c8]Zheng Qu, Peter Richtárik, Martin Takác, Olivier Fercoq:
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization. ICML 2016: 1823-1832 - [c7]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe Screening Rules for Sparse-Group Lasso. NIPS 2016: 388-396 - [c6]Maxime Sangnier, Olivier Fercoq, Florence d'Alché-Buc:
Joint quantile regression in vector-valued RKHSs. NIPS 2016: 3693-3701 - [i12]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe Screening Rules for Sparse-Group-Lasso. CoRR abs/1602.06225 (2016) - [i11]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Vincent Leclère, Joseph Salmon:
Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression. CoRR abs/1606.02702 (2016) - [i10]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Gap Safe screening rules for sparsity enforcing penalties. CoRR abs/1611.05780 (2016) - 2015
- [j3]Olivier Fercoq, Peter Richtárik:
Accelerated, Parallel, and Proximal Coordinate Descent. SIAM J. Optim. 25(4): 1997-2023 (2015) - [c5]Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Mind the duality gap: safer rules for the Lasso. ICML 2015: 333-342 - [c4]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe screening rules for sparse multi-task and multi-class models. NIPS 2015: 811-819 - [i9]Zheng Qu, Peter Richtárik, Martin Takác, Olivier Fercoq:
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization. CoRR abs/1502.02268 (2015) - [i8]Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Mind the duality gap: safer rules for the Lasso. CoRR abs/1505.03410 (2015) - [i7]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe screening rules for sparse multi-task and multi-class models. CoRR abs/1506.03736 (2015) - 2014
- [j2]Frédérique Billy, Jean Clairambault, Olivier Fercoq, Stéphane Gaubert, Thomas Lepoutre, Thomas Ouillon, Shoko Saito:
Synchronisation and control of proliferation in cycling cell population models with age structure. Math. Comput. Simul. 96: 66-94 (2014) - [c3]Olivier Fercoq, Zheng Qu
Fast distributed coordinate descent for non-strongly convex losses. MLSP 2014: 1-6 - [i6]Olivier Fercoq, Zheng Qu, Peter Richtárik, Martin Takác:
Fast Distributed Coordinate Descent for Non-Strongly Convex Losses. CoRR abs/1405.5300 (2014) - 2013
- [j1]Olivier Fercoq, Marianne Akian, Mustapha Bouhtou, Stephane Gaubert:
Ergodic Control and Polyhedral Approaches to PageRank Optimization. IEEE Trans. Autom. Control. 58(1): 134-148 (2013) - [c2]Olivier Fercoq:
Parallel Coordinate Descent for the Adaboost Problem. ICMLA (1) 2013: 354-358 - [i5]Olivier Fercoq, Peter Richtárik:
Smooth minimization of nonsmooth functions with parallel coordinate descent methods. CoRR abs/1309.5885 (2013) - [i4]Olivier Fercoq:
Parallel coordinate descent for the Adaboost problem. CoRR abs/1310.1840 (2013) - [i3]Olivier Fercoq, Peter Richtárik:
Accelerated, Parallel and Proximal Coordinate Descent. CoRR abs/1312.5799 (2013) - 2012
- [c1]Olivier Fercoq:
PageRank optimization applied to spam detection. NetGCooP 2012: 127-134 - [i2]Olivier Fercoq:
PageRank optimization applied to spam detection. CoRR abs/1203.1457 (2012) - 2010
- [i1]Olivier Fercoq, Marianne Akian, Mustapha Bouhtou, Stéphane Gaubert:
Ergodic Control and Polyhedral approaches to PageRank Optimization. CoRR abs/1011.2348 (2010)
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 2024-11-07 20:34 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: