On solving linear complementarity problems by DC programming and DCA
From MaRDI portal
Recommendations
- On solving difference of convex functions programs with linear complementarity constraints
- A sub-additive DC approach to the complementarity problem
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Combined approach to solve the linear complementarity problem
- Solving the quadratic eigenvalue complementarity problem by DC programming
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 653034 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- A class of linear complementarity problems solvable in polynomial time
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Discrete tomography by convex--concave regularization and D.C. programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Global Optimization Approach to the Linear Complementarity Problem
- Handbook of test problems in local and global optimization
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
- On the resolution of monotone complementarity problems
- On the solution of NP-hard linear complementarity problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variational reconstruction with DC-programming
Cited in
(22)- On solving difference of convex functions programs with linear complementarity constraints
- Accelerating the DC algorithm for smooth functions
- DC programming and DCA: thirty years of developments
- Optimization based DC programming and DCA for hierarchical clustering
- A branch-and-bound algorithm embedded with DCA for DC programming
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- Computing B-stationary points of nonsmooth DC programs
- A new concave minimization algorithm for the absolute value equation solution
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
- A sub-additive DC approach to the complementarity problem
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Algorithms for linear programming with linear complementarity constraints
- Alternating DC algorithm for partial DC programming problems
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- A class of semi-supervised support vector machines by DC programming
- The boosted DC algorithm for linearly constrained DC programming
- An experimental study of a DC optimization algorithm for bimatrix games
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- DC programming and DCA for general DC programs
- Solving DC programs using the cutting angle method
This page was built for publication: On solving linear complementarity problems by DC programming and DCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409266)
