Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Luis M. Briceño-Arias"'
Autor:
Luis M. Briceño-Arias, Fernando Roldán
Publikováno v:
Journal of Optimization Theory and Applications. 195:205-225
Autor:
Luis M. Briceño-Arias, Fernando Roldán
Publikováno v:
Optimization Letters. 17:399-412
Publikováno v:
Journal of Optimization Theory and Applications volume 192, issue 1, pages 56–81 (2022)
In this paper, we propose a numerical approach for solving composite primal-dual monotone inclusions with a priori information. The underlying a priori information set is represented by the intersection of fixed point sets of a finite number of opera
Autor:
Luis M. Briceño-Arias, Nelly Pustelnik
Publikováno v:
Signal Processing. 206:108900
Autor:
Luis M. Briceño-Arias, Fernando Roldán
In this paper we provide a generalization of the Douglas-Rachford splitting (DRS) and the primal-dual algorithm (Vu 2013, Condat 2013) for solving monotone inclusions in a real Hilbert space involving a general linear operator. The proposed method al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81a0f861ce4bf61d947e5ad8fb01cf26
Publikováno v:
Networks and Spatial Economics. 18:973-997
Urban planning is a complex problem which includes choosing a social objective for a city, finding the associated optimal allocation of agents and identifying instruments like subsidies to decentralize this allocation as a market equilibrium. We spli
Publikováno v:
Journal of Optimization Theory and Applications. 180:907-924
In this paper, we provide an algorithm for solving constrained composite primal–dual monotone inclusions, i.e., monotone inclusions in which a priori information on primal–dual solutions is represented via closed and convex sets. The proposed alg
Publikováno v:
Computational Optimization and Applications
Computational Optimization and Applications, Springer Verlag, 2019, 72 (3), pp.707-726. ⟨10.1007/s10589-019-00060-6⟩
Computational Optimization and Applications, 2019, 72 (3), pp.707-726. ⟨10.1007/s10589-019-00060-6⟩
Computational Optimization and Applications, Springer Verlag, 2019, 72 (3), pp.707-726. ⟨10.1007/s10589-019-00060-6⟩
Computational Optimization and Applications, 2019, 72 (3), pp.707-726. ⟨10.1007/s10589-019-00060-6⟩
International audience; In this paper, we propose a new optimization algorithm for sparse logistic regression based on a stochastic version of the Douglas-Rachford splitting method. Our algorithm sweeps the training set by randomly selecting a mini-b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3355687492b3397e921188e3d728de1e
https://hal.archives-ouvertes.fr/hal-01672507/document
https://hal.archives-ouvertes.fr/hal-01672507/document
Autor:
Francisco J. Silva, Mathieu Laurière, Z Kobeissi, Dante Kalise, A Mateos Gonzalez, Luis M. Briceño-Arias
Publikováno v:
ESAIM: Proceedings and Surveys
ESAIM: Proceedings and Surveys, EDP Sciences, 2019, 65, pp.330-348. ⟨10.1051/proc/201965330⟩
ESAIM: Proceedings and Surveys, Vol 65, Pp 330-348 (2019)
ESAIM: Proceedings and Surveys, 2019, 65, pp.330-348. ⟨10.1051/proc/201965330⟩
ESAIM: Proceedings and Surveys, EDP Sciences, 2019, 65, pp.330-348. ⟨10.1051/proc/201965330⟩
ESAIM: Proceedings and Surveys, Vol 65, Pp 330-348 (2019)
ESAIM: Proceedings and Surveys, 2019, 65, pp.330-348. ⟨10.1051/proc/201965330⟩
We study a numerical approximation of a time-dependent Mean Field Game (MFG) system with local couplings. The discretization we consider stems from a variational approach described in [Briceno-Arias, Kalise, and Silva, SIAM J. Control Optim., 2017] f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e8c82187097ab996ddd87876b39dbe8
https://hal.archives-ouvertes.fr/hal-01865488
https://hal.archives-ouvertes.fr/hal-01865488
Publikováno v:
SIAM Journal on Control and Optimization
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both the stationary system introduced in [51, 53] and also a similar system involving density constraints in order to model hard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7faad04f17fef6054bd70c6a5ae9f04d
https://hal.archives-ouvertes.fr/hal-01865478/document
https://hal.archives-ouvertes.fr/hal-01865478/document