A minimization algorithm for equilibrium problems with polyhedral constraints

DOI10.1080/02331934.2015.1080702MaRDI QIDQ2810110zbMATH OpenOpenAlexFDO

Authors J. X. da Cruz Neto, Pedro A. jun. Soares, J. 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

equilibrium problemgeneralized convexityinfeasible interior proximal point methodsecond-order homogeneous distances

Mathematics Subject Classification ID

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

Recommendations

• The interior proximal extragradient method for solving equilibrium problems
• An interior proximal cutting hyperplane method for equilibrium problems
• Interior proximal methods for equilibrium programming: part I
• An inexact subgradient algorithm for equilibrium problems
• From equilibrium problems and fixed points problems to minimization problems

Cites work

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

Cited in

(6)

• A subgradient method for equilibrium problems involving quasiconvex bifunctions
• Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems
• The interior proximal extragradient method for solving equilibrium problems
• scientific article; zbMATH DE number 7742927 (Why is no real title available?)
• A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
• An inexact proximal method with proximal distances for quasimonotone equilibrium problems

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

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