Complementary pivot theory of mathematical programming
From MaRDI portal
Publication:2527120
DOI10.1016/0024-3795(68)90052-9zbMath0155.28403WikidataQ114852142 ScholiaQ114852142MaRDI QIDQ2527120
Richard W. Cottle, George B. Dantzig
Publication date: 1968
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(68)90052-9
Related Items
Some generalizations of the criss-cross method for quadratic programming, A new proof for the criss-cross method for quadratic programming, The general quadratic optimization problem, Generic properties of the complementarity problem, Some classes of matrices in linear complementarity theory, Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, The complementarity problem, Monotone solutions of the parametric linear complementarity problem, Hybrid programs: Linear and least-distance, An Odd Theorem, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Generalized complementarity problems for fuzzy mappings, Generalized complementarity problems for fuzzy mappings, On multivalued complementarity problems in Banach spaces, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, The equivalence of an LCP to a parametric linear program with a scalar parameter, Copositive-plus Lemke algorithm solves polymatrix games, An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Two characterizations of sufficient matrices, Global error bounds for monotone affine variational inequality problems, On a global error bound for a class of monotone affine variational inequality problems, A new polynomial time method for a linear complementarity problem, A unified approach to complementarity in optimization, The linear complementarity problem, sufficient matrices, and the criss- cross method, A note on composite concave quadratic programming, Degeneracy in linear complementarity problems: A survey, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, Some aspects of variational inequalities, Linear complementarity and discounted switching controller stochastic games, Global linear convergence of a path-following algorithm for some monotone variational inequality problems, Gauss-Newton methods for the complementarity problem, On the complexity of the parity argument and other inefficient proofs of existence, Generalized strongly nonlinear quasi-complementarity problems, A new method for a class of linear variational inequalities, The convergence of parallel iteration algorithms for linear complementarity problems, Criss-cross methods: A fresh view on pivot algorithms, On the complexity of approximating a KKT point of quadratic programming, EP theorems and linear complementarity problems, A dual method for the numerical solution of some variational inequalities, On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method, Complementarity problems in GAMS and the PATH solver, The generalized linear complementarity problem and an algorithm to find all its solutions, Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem, Containing and shrinking ellipsoids in the path-following algorithm, \(P_ c\)-matrices and the linear complementarity problem, Complementarity problems for multivalued monotone operator in Banach spaces, Su alcuni sistemi di complementarita connessi a disequazioni variazionali di tipo ellittico, Fuzzy approximation to an infeasible generalized linear complementarity problem, Existence and uniqueness of solutions for the generalized linear complementarity problem, Criteria for sufficient matrices, Principal pivot transforms: Properties and applications, On copositive matrices with -1, 9, 1 entries, On a class of semimonotone \(Q_ 0\)-matrices in the linear complementarity problem, A combinatorial approach to convex quadratic programming, Existence theory for generalized nonlinear complementarity problems, Existence theory for the complex linear complementarity problem, On the number of solutions to the complementarity problem and spanning properties of complementary cones, Dual variational inequalities, Solution of the complex linear complementarity problem, Unnamed Item, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, A simplicial algorithm for the nonlinear complementarity problem, A set intersection theorem and applications
Cites Work
- Some generalizations of positive definiteness and monotonicity
- The Jacobian matrix and global univalence of mappings
- Non-cooperative games
- Duality in quadratic programming
- The Simplex Method for Quadratic Programming
- Symmetric dual quadratic programs
- Equilibrium Points of Bimatrix Games
- A Comparison of Two Methods for Quadratic Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Nonlinear Programs with Positively Bounded Jacobians
- The Unloading Problem for Plane Curves
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
