One step from DC optimization to DC mixed variational inequalities

DOI10.1080/02331930903500282zbMath1184.90125OpenAlexW1966700757MaRDI QIDQ3553751

Quoc Tran Dinh, Le Dung Muu

Publication date: 21 April 2010

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

DC decompositionmixed variational inequalityCournot-Nash modellocal and global equilibriasplitting proximal point method

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Variational inequalities (49J40) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ On fixed point approach to equilibrium problem ⋮ Strong convergence of an inexact projected subgradient method for mixed variational inequalities ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ Global optimization from concave minimization to concave mixed variational inequality

Cites Work

• On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Descent methods for mixed variational inequalities in a Hilbert space.
• Iterative schemes for quasimonotone mixed variational inequalities
• Monotone Operators and the Proximal Point Algorithm
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Bundle Method for Solving Variational Inequalities
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming