scientific article; zbMATH DE number 653034

MaRDI QIDQ4308909zbMATH OpenFDO

Authors Panos M. Pardalos

Publication date 12 October 1994

zbMATH Keywords

interior point approachesnonconvex linear complementarity problemsNP-hardpartitioningpotential reduction algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 53115
• The Linear Complementarity Problem
• The linear complementarity problem. An introduction
• The Extended Linear Complementarity Problem
• The extended linear complementarity problem
• The Linear Order Complementarity Problem
• The Linear Order Complementarity Problem
• The semidefinite linear complementarity problem
• The existence of a solution for the linear complementarity problem
• The integer linear complementarity problem

Cited in

(31)

• The linear complementarity problem with a parametric input
• Solving more linear complementarity problems with Murty's Bard-type algorithm
• Two-side obstacle problem and its equivalent linear complementarity problem
• Some fundamental properties of successive convex relaxation methods on LCP and related problems
• A note on absolute value equations
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• Enhanced intersection cutting-plane approach for linear complementarity problems
• On equivalent reformulations for absolute value equations
• Integer solution for linear complementarity problem
• Polynomial interior point algorithms for general linear complementarity problems
• Linear complementarity as a general solution method to combinatorial problems
• The Linear Complementarity Problem
• Some LCPs solvable in strongly polynomial time with Lemke's algorithm
• scientific article; zbMATH DE number 4029291 (Why is no real title available?)
• A linear complementarity problem involving a subgradient
• 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 1059229 (Why is no real title available?)
• On linear programs with linear complementarity constraints
• Solving the Linear Complementarity Problem in Circuit Simulation
• scientific article; zbMATH DE number 778140 (Why is no real title available?)
• A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
• Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems
• A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
• Generalized vector implicit quasi complementarity problems
• Linear complementarity problems and multiple objective programming
• Inexact non-interior continuation method for monotone semidefinite complementarity problems
• Note on solving linear complementarity problems as jointly constrained bilinear programs
• An extension of interior point potential reduction algorithm to solve general lcps
• Enumeration-based approach to solving parametric linear complementarity problems

This page was built for publication:

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