Solving nonmonotone affine variational inequalities problem by DC programming and DCA

DOI10.1142/S1793557120500679MaRDI QIDQ5113061zbMATHOpenAlexFDO

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

zbMATH Keywords

DC programmingaffine variational inequalities problemDCA (algorithms)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

Cites work

• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• A new primal-dual path-following method for convex quadratic programming
• A polynomial-time algorithm for affine variational inequalities
• 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
• Continuity of the solution map in parametric affine variational inequalities
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Discrete tomography by convex--concave regularization and D.C. programming
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• On solving linear complementarity problems by DC programming and DCA
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
• Some improved convergence results for variational inequality problems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(5)

• An efficient DCA algorithm for solving non-monotone affine variational inequality problem
• One step from DC optimization to DC mixed variational inequalities
• Variational inequality problem with DC programming as constraint
• A DC algorithm for solving non-uniquely solvable absolute value equations
• A structure-preserving pivotal method for affine variational inequalities

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)