Equilibrium programming in Hilbert spaces
Patrick L. Combettes, Sever A. Hirstoaga
Abstract
Patrick L. Combettes, Sever A. Hirstoaga
Abstract
Several methods for solving systems of equilibrium problems in Hilbert spaces – and for find-ing best approximations thereof – are presented and their convergence properties are established. The proposed methods include proximal-like block-iterative algorithms for general systems, as well as regularization and splitting algorithms for single equilibrium problems. The problem of constructing approximate equilibria in the case of inconsistent systems is also considered. 1
OpenAlex reports 929 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Several methods for solving systems of equilibrium problems in Hilbert spaces – and for find-ing best approximations thereof – are presented and their convergence properties are established. The proposed methods include proximal-like block-iterative algorithms for general systems, as well as regularization and splitting algorithms for single equilibrium problems. The problem of constructing approximate equilibria in the case of inconsistent systems is also considered. 1
Key concepts: Hilbert space, Convergence (economics), Mathematics, Regularization (linguistics), Mathematical optimization, Block (permutation group theory), Applied mathematics, Algorithm