Solving nonmonotone affine variational inequalities problem by DC programming and DCA
DOI10.1142/S1793557120500679zbMATH Open1445.90087OpenAlexW2900306481MaRDI QIDQ5113061FDOQ5113061
Authors: Zahira Kebaili, Mohamed Achache 
Publication date: 10 June 2020
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120500679
Recommendations
- Variational inequality problem with DC programming as constraint
- DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- A global optimization approach for solving non-monotone variational inequality problems
- On solving linear complementarity problems by DC programming and DCA
- DC programming techniques for solving a class of nonlinear bilevel programs
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- scientific article; zbMATH DE number 2208618
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Discrete tomography by convex--concave regularization and D.C. programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A new primal-dual path-following method for convex quadratic programming
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- On solving linear complementarity problems by DC programming and DCA
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
- Continuity of the solution map in parametric affine variational inequalities
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
- A polynomial-time algorithm for affine variational inequalities
- Some improved convergence results for variational inequality problems
Cited In (4)
This page was built for publication: Solving nonmonotone affine variational inequalities problem by DC programming and DCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113061)
