Block proximal point method for mixed variational inequality problem
From MaRDI portal
Cites work
- A generalized scheme for split inclusion problem with conjugate like direction
- A mathematical programming approach for determining oligopolistic market equilibrium
- A variational inequality approach for the determination of oligopolistic market equilibrium
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An Introduction to Variational Inequalities and Their Applications
- Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Attouch--Théra Duality, Generalized Cycles, and Gap Vectors
- Block coordinate descent methods of centres for solving block-constrained optimization problems
- Convergence d'un schéma de minimisation alternée
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimal consensus of multi-agent systems: a randomized parallel approach
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Formulation and computation of general financial equilibrium
- Golden ratio algorithms for variational inequalities
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Iterative Algorithms for Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- On the convergence of block coordinate descent type methods
- On the relationship between Nash—Cournot and Wardrop equilibria
- Parallel block coordinate descent methods with identification strategies
- Parallel coordinate descent methods for big data optimization
- Proximal splitting methods in signal processing
- Proximity for sums of composite functions
- Randomized block-coordinate optimistic gradient algorithms for root-finding problems
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
This page was built for publication: Block proximal point method for mixed variational inequality problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391721)