Solving non-monotone equilibrium problems via a DIRECT-type approach
From MaRDI portal
Publication:2154447
DOI10.1007/s10898-021-01121-zzbMath1495.90140arXiv2002.12198OpenAlexW3007505736MaRDI QIDQ2154447
Mauro Passacantando, Stefano Lucidi, Francesco Rinaldi
Publication date: 19 July 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.12198
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of the proximal point method to nonmonotone equilibrium problems
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- A bundle method for solving equilibrium problems
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Sandwich method for finding fixed points
- The computation of fixed points and applications
- Lipschitzian optimization without the Lipschitz constant
- Triangulations and simplicial methods
- Equilibrium programming using proximal-like algorithms
- Gap functions for equilibrium problems
- Descent methods for equilibrium problems in a Banach space
- Nonlinear programming techniques for equilibria
- Existence and solution methods for equilibria
- A DIRECT-type approach for derivative-free constrained global optimization
- Hybrid evolutionary algorithm for solving general variational inequality problems
- Note on noncooperative convex games
- Interior proximal methods for equilibrium programming: part I
- A convergent inexact solution method for equilibrium problems
- Twelve monotonicity conditions arising from algorithms for equilibrium problems
- A global optimization approach for solving non-monotone variational inequality problems
- An implicit enumeration procedure for the general linear complementarity problem
- Global Optimization Approach to the Linear Complementarity Problem
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- D-gap Functions for a Class of Equilibrium Problems in Banach Spaces
- Benchmarking Derivative-Free Optimization Algorithms
- Extragradient algorithms extended to equilibrium problems¶
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions
- Interior Proximal Methods for equilibrium programming: part II
- Merit functions: a bridge between optimization and equilibria
- Introduction to global optimization.
- A derivative-free algorithm for bound constrained optimization
