Global Optimization Approach to the Linear Complementarity Problem
From MaRDI portal
Recommendations
- On the numerical solution of the linear complementarity problem
- scientific article; zbMATH DE number 778140
- An implicit enumeration procedure for the general linear complementarity problem
- Linear complementarity as a general solution method to combinatorial problems
- scientific article; zbMATH DE number 2128205
Cited in
(42)- Bounds for the solution set of linear complementarity problems
- An experimental investigation of enumerative methods for the linear complementarity problem
- An enumerative method for the solution of linear complementarity problems
- Parallel search algorithms in global optimization
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- An analytical approach to global optimization
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Parallel computing in nonconvex programming
- Solution of linear complementarity problems using minimization with simple bounds
- A note on quadratic convergence of a smoothing Newton algorithm for the LCP
- Equilibrium strategies for multiple interdictors on a common network
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
- Tensor complementarity problems. II: Solution methods
- A mixed integer programming approach to the tensor complementarity problem
- A method for solving the general parametric linear complementarity problem
- Hybrid evolutionary algorithm for solving general variational inequality problems
- Enhanced intersection cutting-plane approach for linear complementarity problems
- A quadratic programming view of the linear complementary problem
- On equivalent reformulations for absolute value equations
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- A global optimization approach for solving non-monotone variational inequality problems
- On the numerical solution of the linear complementarity problem
- Linear complementarity problems solvable by integer programming
- The integer linear complementarity problem
- On solving linear complementarity problems by DC programming and DCA
- scientific article; zbMATH DE number 778140 (Why is no real title available?)
- scientific article; zbMATH DE number 910792 (Why is no real title available?)
- Generallized Linear Complementarity Problem and Multiobjective Programming Problem
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Minimum norm solution to the positive semidefinite linear complementarity problem
- Some techniques for solving absolute value equations
- Linear complementarity problems and multiple objective programming
- Generalized principal pivot transforms, complementarity theory and their applications in stochastic games
- Quasi-static loading of granular media as a linear complementarity problem
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- Note on solving linear complementarity problems as jointly constrained bilinear programs
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Solving linear optimization problems with max-star composition equation constraints
- Minimum norm solution of the absolute value equations via simulated annealing algorithm
- Enumeration-based approach to solving parametric linear complementarity problems
- Jointly constrained bilinear programs and related problems: An overview
This page was built for publication: Global Optimization Approach to the Linear Complementarity Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790555)
