A minimization algorithm for equilibrium problems with polyhedral constraints

DOI10.1080/02331934.2015.1080702zbMath1337.90068OpenAlexW2222788741MaRDI QIDQ2810110

João Xavier da Cruz Neto, P. A. jun. Soares, Jurandir O. Lopes

Publication date: 31 May 2016

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

generalized convexityequilibrium probleminfeasible interior proximal point methodsecond-order homogeneous distances

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets ⋮ A subgradient method for equilibrium problems involving quasiconvex bifunctions ⋮ An inexact proximal method with proximal distances for quasimonotone equilibrium problems ⋮ Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems ⋮ Unnamed Item

Cites Work

• Nonmonotone equilibrium problems: Coercivity conditions and weak regularization
• Application of the proximal point method to nonmonotone equilibrium problems
• The interior proximal extragradient method for solving equilibrium problems
• Proximal methods for a class of bilevel monotone equilibrium problems
• An inexact interior point proximal method for the variational inequality problem
• Generalized convexity of functions and generalized monotonicity of set-valued maps
• Gap functions for equilibrium problems
• An Appropriate Subdifferential for Quasiconvex Functions
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• Mean Value Property and Subdifferential Criteria for Lower Semicontinuous Functions
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Extragradient algorithms extended to equilibrium problems¶
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

This page was built for publication: A minimization algorithm for equilibrium problems with polyhedral constraints