On the equivalence of linear complementarity problems
From MaRDI portal
Publication:1866003
DOI10.1016/S0167-6377(02)00159-1zbMath1049.90099OpenAlexW2163654204MaRDI QIDQ1866003
W. P. M. H. Heemels, Bart De Schutter, Alberto Bemporad
Publication date: 3 April 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00159-1
optimizationinteger programminglinear complementarity problemnonlinear algorithmsComplementarity problems
Integer programming (90C10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (10)
MPC for discrete-event systems with soft and hard synchronization constraints ⋮ An algorithm for timing verification of systems constrained by min-max inequalities ⋮ Analysis and control of max-plus linear discrete-event systems: an introduction ⋮ A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ Globally optimal solutions of max-min systems ⋮ A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ Enumeration-based approach to solving parametric linear complementarity problems ⋮ Diagnosing Hybrid Dynamical Systems Using Max-Plus Algebraic Methods ⋮ Min-max inequalities and the timing verification problem with max and linear constraints ⋮ A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal realization in the max algebra is an extended linear complementarity problem
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- The linear dynamic complementarity problem is a special case of the extended linear complementarity problem
- Optimal traffic light control for a single intersection
- Control of systems integrating logic, dynamics, and constraints
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
- A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
- On the solution and complexity of a generalized linear complementarity problem
- An iterative two-step algorithm for linear complementarity problems
- An infeasible-interior-point algorithm for linear complementarity problems
- The generalized linear complementarity problem and an algorithm to find all its solutions
- The generalized linear complementarity problem revisited
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- Reducing horizontal linear complementarity problems
- The extended linear complementarity problem
- On the extended linear complementarity problem
- Smoothing methods for convex inequalities and linear complementarity problems
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- Enhanced intersection cutting-plane approach for linear complementarity problems
- Equivalence of LCP and PLS
- Linear complementarity problems solvable by integer programming
- Predictor-corrector Methods for a Class of Linear Complementarity Problems
- The Generalized Order Linear Complementarity Problem
- A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
- Engineering and Economic Applications of Complementarity Problems
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Linear Complementarity Systems
- Optimal Control of a Class of Linear Hybrid Systems with Saturation
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The Extended Linear Complementarity Problem
- Generalized Linear Complementarity Problems
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- A generalization of the linear complementarity problem
- The Linear Complementarity Problem
- Equivalence of hybrid dynamical models
This page was built for publication: On the equivalence of linear complementarity problems
