Global optimization from concave minimization to concave mixed variational inequality

DOI10.1007/s40306-020-00363-5zbMath1446.90155OpenAlexW3027422626MaRDI QIDQ778156

Le Dung Muu, Nguyen Van Quy

Publication date: 1 July 2020

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40306-020-00363-5

zbMATH Keywords

global solutionconvex envelopegap functionDC optimizationconcave costNash-Cournot oligopolistic modelnonconvex mixed variational inequality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

Order-preservation properties of resolvent operators and their applications to variational inequalities ⋮ Extension of forward-reflected-backward method to non-convex mixed variational inequalities ⋮ Proximal subgradient algorithm for a class of nonconvex bilevel equilibrium problems ⋮ Solving mixed variational inequalities beyond convexity ⋮ An extension of the proximal point algorithm beyond convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gap functions for quasivariational inequalities and generalized Nash equilibrium problems
• An algorithm for solving convex programs with an additional convex- concave constraint
• On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
• Gap function approach to the generalized Nash equilibrium problem
• Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
• Constrained global optimization: algorithms and applications
• Linear programs with an additional reverse convex constraint
• Method for minimizing a convex-concave function over a convex set
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Convex-concave programming as a decomposition approach to global optimization
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Combined relaxation method for generalized variational inequalities
• Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities
• Nonlinear programming techniques for equilibria
• Network economics: a variational inequality approach
• Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
• A class of gap functions for quasi-variational inequality problems
• Monotonic Optimization: Problems and Solution Approaches
• A splitting proximal point method for Nash-Cournot equilibrium models involving nonconvex cost functions
• One step from DC optimization to DC mixed variational inequalities
• A mathematical programming approach for determining oligopolistic market equilibrium
• A cutting plane algorithm for solving bilinear programs
• Convex Analysis
• Convex analysis and global optimization
• Generalized Nash equilibrium problems

This page was built for publication: Global optimization from concave minimization to concave mixed variational inequality