One step from DC optimization to DC mixed variational inequalities

DOI10.1080/02331930903500282MaRDI QIDQ3553751zbMATH OpenOpenAlexFDO

Authors 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

mixed variational inequalityDC decompositionCournot-Nash modellocal and global equilibriasplitting proximal point method

Mathematics Subject Classification ID

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

Recommendations

• Global optimization from concave minimization to concave mixed variational inequality
• The proximal point method for nonmonotone variational inequalities
• Solving nonmonotone affine variational inequalities problem by DC programming and DCA
• Some proximal methods for solving mixed variational inequalities
• On Nash-Cournot oligopolistic market equilibrium models with concave cost functions

Cites work

• A Bundle Method for Solving Variational Inequalities
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• 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
• Descent methods for mixed variational inequalities in a Hilbert space.
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Iterative schemes for quasimonotone mixed variational inequalities
• Monotone Operators and the Proximal Point Algorithm
• On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(8)

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

This page was built for publication: One step from DC optimization to DC mixed variational inequalities

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