An efficient DCA algorithm for solving non-monotone affine variational inequality problem

MaRDI QIDQ6657973zbMATH OpenFDO

Authors Amel Noui, Zahira Kebaili, Mohamed Achache

Publication date 7 January 2025

Published in Nonlinear Dynamics and Systems Theory (Search for Journal in Brave)

zbMATH Keywords

affine variational inequality problemDC programmingDCA (difference of convex functions algorithms)quadratic program

Mathematics Subject Classification ID

Variational inequalities (49J40) Quadratic programming (90C20) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• Solving nonmonotone affine variational inequalities problem by DC programming and DCA
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
• scientific article; zbMATH DE number 5558008
• Variational inequality problem with DC programming as constraint
• A polynomial-time algorithm for affine variational inequalities

Cites work

• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A DC algorithm for solving non-uniquely solvable absolute value equations
• A new primal-dual path-following method for convex quadratic programming
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• A polynomial-time algorithm for affine variational inequalities
• An accelerating algorithm for globally solving nonconvex 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
• 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

This page was built for publication: An efficient DCA algorithm for solving non-monotone affine variational inequality problem

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