On solving linear complementarity problems by DC programming and DCA

DOI10.1007/s10589-011-9398-yzbMath1237.90234OpenAlexW1965834410MaRDI QIDQ409266

Hoai An Le Thi, Tao Pham Dinh

Publication date: 12 April 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-011-9398-y

zbMATH Keywords

DCADC programmingLCP

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach, Optimization based DC programming and DCA for hierarchical clustering, DC programming and DCA for solving Brugnano-Casulli piecewise linear systems, DC Programming and DCA for General DC Programs, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, A sub-additive DC approach to the complementarity problem, Algorithms for linear programming with linear complementarity constraints, On solving difference of convex functions programs with linear complementarity constraints, Solving nonmonotone affine variational inequalities problem by DC programming and DCA, Computing B-Stationary Points of Nonsmooth DC Programs, DC programming and DCA: thirty years of developments, Accelerating the DC algorithm for smooth functions, A study of the difference-of-convex approach for solving linear programs with complementarity constraints, An experimental study of a DC optimization algorithm for bimatrix games, A class of semi-supervised support vector machines by DC programming, A new concave minimization algorithm for the absolute value equation solution, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the solution of NP-hard linear complementarity problems
• A class of linear complementarity problems solvable in polynomial time
• Quadratic programming with one negative eigenvalue is NP-hard
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• Handbook of test problems in local and global optimization
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• On the resolution of monotone complementarity problems
• Discrete tomography by convex--concave regularization and D.C. programming
• On Smoothing Methods for the P₀ Matrix Linear Complementarity Problem
• Global Optimization Approach to the Linear Complementarity Problem
• Computational complexity of LCPs associated with positive definite symmetric matrices
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP