One step from DC optimization to DC mixed variational inequalities
DOI10.1080/02331930903500282zbMATH Open1184.90125OpenAlexW1966700757MaRDI QIDQ3553751FDOQ3553751
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930903500282
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
mixed variational inequalityDC decompositionCournot-Nash modellocal and global equilibriasplitting proximal point method
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Auctions, bargaining, bidding and selling, and other market models (91B26) Variational inequalities (49J40)
Cites Work
- Monotone Operators and the Proximal Point Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- 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
- A Bundle Method for Solving Variational Inequalities
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Descent methods for mixed variational inequalities in a Hilbert space.
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
- Iterative schemes for quasimonotone mixed variational inequalities
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
Cited In (8)
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Variance reduced forward-reflected-backward algorithm for solving nonconvex finite-sum mixed variational inequalities
- On fixed point approach to equilibrium problem
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Global optimization from concave minimization to concave mixed variational inequality
- Strong convergence of an inexact projected subgradient method for mixed variational inequalities
- A modified proximal point method for DC functions on Hadamard manifolds
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)
