New inertial algorithm for a class of equilibrium problems
DOI10.1007/s11075-018-0532-0OpenAlexW3098193064WikidataQ129817559 ScholiaQ129817559MaRDI QIDQ1736416
Publication date: 26 March 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.06544
equilibrium problemregularized methodproximal-like methodLipschitz-type bifunctionstrongly pseudomonotone bifunction
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) General equilibrium theory (91B50) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings
- An inexact subgradient algorithm for equilibrium problems
- Application of the proximal point method to nonmonotone equilibrium problems
- Descent methods for monotone equilibrium problems in Banach spaces
- Equilibrium models and variational inequalities.
- A class of shrinking projection extragradient methods for solving non-monotone equilibrium problems in Hilbert spaces
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Equilibrium programming using proximal-like algorithms
- \(D\)-gap functions and descent methods for a class of monotone equilibrium problems
- Gap functions for equilibrium problems
- Convergence analysis of a new algorithm for strongly pseudomontone equilibrium problems
- The convergence of proximal methods to fixed points of extremal mappings and estimates of their rate of convergence
- Gap functions and penalization for solving equilibrium problems with nonlinear constraints
- Existence and solution methods for equilibria
- Descent and penalization techniques for equilibrium problems with nonlinear constraints
- New subgradient extragradient methods for common solutions to equilibrium problems
- A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems
- An extension of hybrid method without extrapolation step to equilibrium problems
- Halpern subgradient extragradient method extended to equilibrium problems
- Note on noncooperative convex games
- A new solution method for equilibrium problems
- A convergent inexact solution method for equilibrium problems
- A New Two-Step Proximal Algorithm of Solving the Problem of Equilibrium Programming
- Convergence of New Inertial Proximal Methods for DC Programming
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Monotone Operators and the Proximal Point Algorithm
- New extragradient method for a class of equilibrium problems in Hilbert spaces
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A note on D-gap functions for equilibrium problems
- A hybrid extragradient method extended to fixed point problems and equilibrium problems
- PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS
- Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions
- Extragradient algorithms extended to equilibrium problems¶
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: New inertial algorithm for a class of equilibrium problems