Global Optimization Approach to the Linear Complementarity Problem
From MaRDI portal
Publication:3790555
DOI10.1137/0909022zbMath0646.65051OpenAlexW1975686449MaRDI QIDQ3790555
J. Ben Rosen, Panos M. Pardalos
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909022
linear complementarity problemtest problemssupercomputersmultiple-cost-row linear programconstrained quadratic global minimization
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Bounds for the solution set of linear complementarity problems, Solution of linear complementarity problems using minimization with simple bounds, A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, A quadratic programming view of the linear complementary problem, An experimental investigation of enumerative methods for the linear complementarity problem, Solving non-monotone equilibrium problems via a DIRECT-type approach, An enumerative method for the solution of linear complementarity problems, Parallel search algorithms in global optimization, On equivalent reformulations for absolute value equations, Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, The integer linear complementarity problem, On solving linear complementarity problems by DC programming and DCA, A mixed integer programming approach to the tensor complementarity problem, Minimum norm solution of the absolute value equations via simulated annealing algorithm, A note on quadratic convergence of a smoothing Newton algorithm for the LCP, Enumeration-based approach to solving parametric linear complementarity problems, A method for solving the general parametric linear complementarity problem, Jointly constrained bilinear programs and related problems: An overview, Linear complementarity problems solvable by integer programming, 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, Some techniques for solving absolute value equations, Hybrid evolutionary algorithm for solving general variational inequality problems, Minimum norm solution to the positive semidefinite linear complementarity problem, Linear complementarity problems and multiple objective programming, Generalized principal pivot transforms, complementarity theory and their applications in stochastic games, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints, Tensor complementarity problems. II: Solution methods, Generallized Linear Complementarity Problem and Multiobjective Programming Problem, Equilibrium strategies for multiple interdictors on a common network, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, A global optimization approach for solving non-monotone variational inequality problems, Enhanced intersection cutting-plane approach for linear complementarity problems, Parallel computing in nonconvex programming, Note on solving linear complementarity problems as jointly constrained bilinear programs, Global optimization algorithms for linearly constrained indefinite quadratic problems
