Artículos
An inexact proximal algorithm for variational inequalities
Editorial: CEPRECYT
Licencia: Creative Commons (by-nc-sa)
Autor(es): Sarmiento, O.; [et al.]
Licencia: Creative Commons (by-nc-sa)
Autor(es): Sarmiento, O.; [et al.]
This paper presents a new inexact proximal method for solving monotone variational inequality problems with a given separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle (2006) with a decomposition method given by Chen and Teboulle that was proposed to solve convex optimization problems. This method extends and generalizes proximal methods using Bregman, Phi-divergences and Quadratic logarithmic distances.
[2018]
Compartir:
Esta es una vista previa de los documentos vistos recientemente por el usuario.
Una vez que el usuario haya visto al menos un documento, este fragmento será visible.
Una vez que el usuario haya visto al menos un documento, este fragmento será visible.