Interior Proximal Methods for equilibrium programming: part II

DOI10.1080/02331934.2011.627334MaRDI QIDQ5746733zbMATH OpenOpenAlexFDO

Authors Nils Langenberg

Publication date 7 February 2014

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2011.627334

zbMATH Keywords

equilibrium problemsBregman distancesproximal-like methodsinterior-point-effect

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Recommendations

• Interior proximal methods for equilibrium programming: part I
• The interior proximal extragradient method for solving equilibrium problems
• Interior proximal extragradient method for equilibrium problems
• An interior proximal cutting hyperplane method for equilibrium problems
• Equilibrium programming: Proximal methods
• The interior linearization method for equilibrium programming problems
• Interior point methods for equilibrium problems
• Interior-point algorithms, penalty methods and equilibrium problems
• scientific article; zbMATH DE number 1086726
• Equilibrium programming using proximal-like algorithms

Cites work

• A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
• A bundle method for solving equilibrium problems
• A logarithmic-quadratic proximal method for variational inequalities
• A new solution method for equilibrium problems
• An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Approximate iterations in Bregman-function-based proximal algorithms
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convergence analysis of an extended auxiliary problem principle with various stopping criteria
• FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Nash equilibria, variational inequalities, and dynamical systems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
• On certain conditions for the existence of solutions of equilibrium problems
• On inexact generalized proximal methods with a weakened error tolerance criterion
• Proximal minimization algorithm with \(D\)-functions
• Pseudomonotone operators and the Bregman proximal point algorithm
• The interior proximal extragradient method for solving equilibrium problems

Cited in

(6)

• Interior proximal extragradient method for equilibrium problems
• On fixed point approach to equilibrium problem
• Interior point methods for equilibrium problems
• Solving non-monotone equilibrium problems via a DIRECT-type approach
• Interior proximal methods for equilibrium programming: part I
• An interior proximal cutting hyperplane method for equilibrium problems

This page was built for publication: Interior Proximal Methods for equilibrium programming: part II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746733)