Linear complementarity problems solvable by A single linear program
From MaRDI portal
Publication:4127631
Recommendations
- Linear complementarity problems solvable as linear programs
- \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
- A quadratic programming view of the linear complementary problem
- Linear complementarity problems solvable by integer programming
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3711296 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3232960 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3361689 (Why is no real title available?)
- Complementary pivot theory of mathematical programming
- Minimality and complementarity properties associated with Z-functions and M-functions
- On the Alass of Complementary Cones and Lemke’s Algorithm
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- On the solution of large, structured linear complementarity problems: The tridiagonal case
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Polyhedral sets having a least element
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
- The Relaxation Method for Linear Inequalities
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(65)- Foreword: special issue for the 70th birthday of professor Olvi Mangasarian
- An exposition of the (linear) complementarity problem
- A bilateral convergent bounding technique for plastic deformations
- On solving mean payoff games using pivoting algorithms
- Continuous Selections of Solutions to Parametric Variational Inequalities
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
- On some properties of \(K\)-type block matrices in the context of complementarity problem
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Total dual integrality and integral solutions of the linear complementarity problem
- On a class of least-element complementarity problems
- Newton's method for linear complementarity problems
- On characterizing linear complementarity problems as linear programs
- Enumeration of PLCP-orientations of the 4-cube
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- Iterative methods for variational and complementarity problems
- More on hidden Z-matrices and linear complementarity problem
- The Linear Complementarity Problems with a Few Variables per Constraint
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games
- A new concave minimization algorithm for the absolute value equation solution
- New contraction methods for linear inequalities
- Generalized \(P_ 0\)- and \(Z\)-matrices
- Conjugate gradient method for the linear complementarity problem withs-matrix
- Absolute value equation solution via dual complementarity
- Vector equilibrium problems, minimal element problems and least element problems
- Generalizations of the hidden Minkowski property
- On cone orderings and the linear complementarity problem
- Iterative algorithms for the linear complementarity problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Multi-product price and assortment competition
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- Hidden Z-matrices with positive principal minors
- Degeneracy in linear complementarity problems: A survey
- Good hidden \(P\)-matrix sandwiches
- A generalized Newton method for a class of discrete-time linear complementarity systems
- Extended \(P\)-pairs
- A nonnegative extension of the affine demand function and equilibrium analysis for multiproduct price competition
- An algorithm for the linear complementarity problem
- Interior-point algorithms for global optimization
- A new characterization of real H-matrices with positive diagonals
- Q-matrices and spherical geometry
- Equivalence of equilibrium problems and least element problems
- Solution of symmetric linear complementarity problems by iterative methods
- A class of linear complementarity problems solvable in polynomial time
- A note on an open problem in linear complementarity
- Linear complementarity problems and multiple objective programming
- Linear complementarity and discounted switching controller stochastic games
- Matrices and the linear complementarity problem
- Sufficient conditions for the unsolvability and solvability of the absolute value equation
- Linear complementarity problems on extended second order cones
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
- \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program
- Picard splitting method and Picard CG method for solving the absolute value equation
- A finite improvement algorithm for the linear complementarity problem
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- On some classes of matrices related to solving linear complementarity problems as linear programs
- On classes of inverse \(Z\)-matrices
- A simultaneous projections method for linear inequalities
- On hidden \(Z\)-matrix and interior point algorithm
- Counting unique-sink orientations
- Reformulations in Mathematical Programming: Definitions and Systematics
- New methods for linear inequalities
- Absolute value equation solution via linear programming
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- Linear complementarity problems solvable as linear programs
This page was built for publication: Linear complementarity problems solvable by A single linear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127631)
