Complementary pivot theory of mathematical programming
From MaRDI portal
Publication:2527120
DOI10.1016/0024-3795(68)90052-9zbMath0155.28403OpenAlexW2004936497WikidataQ114852142 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 (only showing first 100 items - show all)
On the complexity of the parity argument and other inefficient proofs of existence ⋮ An improved two-sweep iteration method for absolute value equations ⋮ A generalized Newton method for non-Hermitian positive definite linear complementarity problem ⋮ A generalization of the AOR iteration method for solving absolute value equations ⋮ Generalized strongly nonlinear quasi-complementarity problems ⋮ On a class of semimonotone \(Q_ 0\)-matrices in the linear complementarity problem ⋮ Fuzzy approximation to an infeasible generalized linear complementarity problem ⋮ A new method for a class of linear variational inequalities ⋮ On the convergence of two-step modulus-based matrix splitting iteration method ⋮ A class of new modulus-based matrix splitting methods for linear complementarity problem ⋮ LCP method for a planar passive dynamic Walker based on an event-driven scheme ⋮ Novel algorithms for solving a system of absolute value variational inequalities ⋮ Existence and uniqueness of solutions for the generalized linear complementarity problem ⋮ Merit functions for absolute value variational inequalities ⋮ Dynamic penalty function method for the side constrained traffic assignment problem ⋮ Simulating cardinal preferences in Boolean games: a proof technique ⋮ The convergence of parallel iteration algorithms for linear complementarity problems ⋮ Complementarity problems in semi-inner product spaces ⋮ Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ Keyword portfolio optimization in paid search advertising ⋮ Criteria for sufficient matrices ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem ⋮ On the complexity of approximating a KKT point of quadratic programming ⋮ Parameterized complexity of sparse linear complementarity problems ⋮ Sufficient conditions for the unsolvability and solvability of the absolute value equation ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ EP theorems and linear complementarity problems ⋮ A dual method for the numerical solution of some variational inequalities ⋮ A new SOR-like method for solving absolute value equations ⋮ Minimum norm solution to the absolute value equation in the convex case ⋮ Absolute value equations with uncertain data ⋮ Generalized SOR-like iteration method for linear complementarity problem ⋮ Vine copula approximation: a generic method for coping with conditional dependence ⋮ Absolute value equation solution via dual complementarity ⋮ Understanding PPA-completeness ⋮ On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method ⋮ Modified SOR-like method for absolute value equations ⋮ Linear complementarity as absolute value equation solution ⋮ Total dual integrality of the linear complementarity problem ⋮ Principal pivot transforms: Properties and applications ⋮ Absolute value equation solution via concave minimization ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ A generalization of the Gauss-Seidel iteration method for solving absolute value equations ⋮ An inexact Newton method for solving complementarity problems in hydrodynamic lubrication ⋮ Linear complementarity problems on extended second order cones ⋮ On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication ⋮ On an iterative method for solving absolute value equations ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem ⋮ The modulus-based matrix double splitting iteration method for linear complementarity problems ⋮ On copositive matrices with -1, 9, 1 entries ⋮ Extensions of Lemke's algorithm for the linear complementarity problem ⋮ On the simplex method and a class of linear complementarity problems ⋮ Some algorithms solving the unilateral Dirichlet problem with two constraints ⋮ A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems ⋮ Optimal correction of the absolute value equations ⋮ Solution of symmetric linear complementarity problems by iterative methods ⋮ On the SOR-like iteration method for solving absolute value equations ⋮ A class of continuous nonlinear complementarity problems ⋮ Parallel pivotal algorithm for solving the linear complementarity problem ⋮ Some recent contributions to plasticity theory ⋮ On plastic dynamics of discrete structural models ⋮ On the solution of large, structured linear complementarity problems: The tridiagonal case ⋮ Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix ⋮ Linear complementarity problems and characterizations of Minkowski matrices ⋮ A reduction theorem for the linear complementarity problem with a certain patterned matrix ⋮ Generalized vector complementarity problem in fuzzy environment ⋮ Algorithmic equivalence in quadratic programming. I. A least-distance programming problem ⋮ On the solution of large, structured linear complementarity problems: the block partitioned case ⋮ A note on the MSMAOR method for linear complementarity problems ⋮ The generalized linear complementarity problem and an algorithm to find all its solutions ⋮ Hidden Z-matrices with positive principal minors ⋮ The linear complementarity problem, sufficient matrices, and the criss- cross method ⋮ Tikhonov regularization for infeasible absolute value equations ⋮ 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 ⋮ A combinatorial approach to convex quadratic programming ⋮ Existence theory for generalized nonlinear complementarity problems ⋮ Existence theory for the complex linear complementarity problem ⋮ A finite improvement algorithm for the linear complementarity problem ⋮ On the number of solutions to the complementarity problem and spanning properties of complementary cones ⋮ Complementarity problems for multivalued monotone operator in Banach spaces ⋮ Semimonotone matrices ⋮ Dual variational inequalities ⋮ Solution of the complex linear complementarity problem ⋮ A generalization of the equivalence relations between modulus-based and projected splitting methods ⋮ Fast modulus-based matrix splitting iteration methods for implicit complementarity problems ⋮ Su alcuni sistemi di complementarita connessi a disequazioni variazionali di tipo ellittico ⋮ 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 ⋮ Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization ⋮ Method of alternating projections for the general absolute value equation ⋮ Complementarity problems in GAMS and the PATH solver ⋮ 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
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
This page was built for publication: Complementary pivot theory of mathematical programming
