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)
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ Unnamed Item ⋮ A Polynomial Method of Weighted Centers for Convex Quadratic Programming ⋮ A Variable-Complexity Norm Maximization Problem ⋮ Even more with the Lemke complementarity algorithm ⋮ The complementarity problem ⋮ Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems ⋮ Variational Inequality and Complementarity Problem ⋮ The Linear Complementarity Problems with a Few Variables per Constraint ⋮ A Preconditioned AOR Iterative Method for the Absolute Value Equations ⋮ Linear complementarity problems with an invariant number of solutions ⋮ A fixed point method to solve the nonlinear complementarity problem for a class of monotone operators ⋮ Complementarity in Oriented Matroids ⋮ Robustness and nondegenerateness for linear complementarity problems ⋮ Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation ⋮ A framework for convex-constrained monotone nonlinear equations and its special cases ⋮ A new matrix splitting generalized iteration method for linear complementarity problems ⋮ Modulus-based matrix splitting methods for complex linear complementarity problem ⋮ A modified generalized SOR-like method for solving an absolute value equation ⋮ Total negativity: characterizations and single-vector tests ⋮ Combinatorial Fiedler theory and graph partition ⋮ A Simple P-Matrix Linear Complementarity Problem for Discounted Games ⋮ Characterizing total positivity: Single vector tests via linear complementarity, sign non‐reversal and variation diminution ⋮ Modulus-based matrix splitting iteration methods with new splitting scheme for horizontal implicit complementarity problems ⋮ Improved modulus-based matrix splitting iteration methods for quasi-complementarity problems ⋮ Some generalizations of the criss-cross method for quadratic programming ⋮ A new proof for the criss-cross method for quadratic programming ⋮ Monotone solutions of the parametric linear complementarity problem ⋮ A simplicial algorithm for the nonlinear complementarity problem ⋮ Hybrid programs: Linear and least-distance ⋮ Absorption paths and equilibria in quitting games ⋮ A set intersection theorem and applications ⋮ An Odd Theorem ⋮ Unnamed Item ⋮ Iterative algorithms for the linear complementarity problem ⋮ GENERALIZED MIXED QUASI-COMPLEMENTARITY PROBLEMS IN TOPOLOGICAL VECTOR SPACES ⋮ Picard splitting method and Picard CG method for solving the absolute value equation ⋮ Modeling and Analysis of Rigid Multibody Systems with Translational Clearance Joints Based on the Nonsmooth Dynamics Approach ⋮ Newton's method for linear complementarity problems ⋮ On the number of solutions to the linear comple-mentarity problem ⋮ Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization ⋮ Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces ⋮ Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces ⋮ Generalized complementarity problems for fuzzy mappings ⋮ Linear complementarity problems solvable by A single linear program ⋮ Generalized complementarity problems for fuzzy mappings ⋮ A simplicial approximation of a solution for the nonlinear complementarity problem ⋮ The general quadratic optimization problem ⋮ Computational complexity of LCPs associated with positive definite symmetric matrices ⋮ A theorem Onp-matrices ⋮ A decomposition algorithm for quadratic programming ⋮ On a class of least-element complementarity problems ⋮ Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems ⋮ A variable dimension algorithm for the linear complementarity problem ⋮ Completely- matrices ⋮ A note on the unique solution of linear complementarity problem ⋮ An algorithm for the linear complementarity problem ⋮ On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation ⋮ On the Schur complement and the LU-factorization of a matrix ⋮ Duality for implicit variational problems and numerical applications ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ Error bounds for monotone linear complementarity problems ⋮ An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example ⋮ Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems ⋮ Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's ⋮ Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods ⋮ Generic properties of the complementarity problem ⋮ Some classes of matrices in linear complementarity theory ⋮ Unnamed Item ⋮ Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints ⋮ Complementarity framework for non-linear dynamic analysis of skeletal structures with softening plastic hinges ⋮ 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
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
