Complementary pivot theory of mathematical programming

From MaRDI portal

Publication:2527120

Jump to:navigation, search

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

zbMATH Keywords

linear programming iteration quadratic programming bimatrix game

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05)

Related Items

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, LQP method with a new optimal step size rule for nonlinear complementarity problems, Solvability of variational inequality problems, A variable-dimension homotopy on networks for computing linear spatial equilibria, Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems, A parametric approach to complementarity theory, Improved convergence theorems of multisplitting methods for the linear complementarity problem, On Lemke processibility of LCP formulations for solving discounted switching control stochastic games, Existence of solutions for extended generalized complementarity problems, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Layout of facilities with some fixed points, Convergence of SSOR methods for linear complementarity problems, The linear complementarity problem and a subclass of fully semimonotone matrices, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Tensor complementarity problem and semi-positive tensors, Properties of solution set of tensor complementarity problem, A modified generalized Newton method for absolute value equations, The quasi-complementarity problem, On the modified Hermitian and skew-Hermitian splitting iteration methods for a class of weakly absolute value equations, Formulating an objective for an economy, Degeneracy in the presence of roundoff errors, Iterative methods for a class of complementarity problems, Fixed point approach for complementarity problems, A simple characterization of solutions sets of convex programs, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, Absolute value equations, Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games, Least-norm linear programming solution as an unconstrained minimization problem, On the number of iterations of local improvement algorithms, An extension of Karmarkar's projective algorithm for convex quadratic programming, Sufficient matrices and the linear complementarity problem, Absolute value programming, Q-matrices and spherical geometry, Complete solutions for a class of elastic-plastic structures, Absolute value equation solution via linear programming, Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results, Minimum norm solution of the absolute value equations via simulated annealing algorithm, A globally and quadratically convergent method for absolute value equations, On the resolution of some unilaterally constrained problems in structural engineering, The existence of globally stable equilibria of ecosystems of the generalized Volterra type, Matrices and the linear complementarity problem, On the parametric linear complementarity problem: A generalized solution procedure, A high accuracy method for solving ODEs with discontinuous right-hand side, Iterative algorithms for semi-linear quasi-complementarity problems, A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics, Jointly constrained bilinear programs and related problems: An overview, A stable theorem of the alternative: An extension of the Gordan theorem, Recent development in computational complexity characterization of Nash equilibrium, Sign-solvable linear complementarity problems, On the choice of parameters in MAOR type splitting methods for the linear complementarity problem, 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, Some techniques for solving absolute value equations, Enumeration of PLCP-orientations of the 4-cube, 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, A hybrid algorithm for solving the absolute value equation, Two characterizations of sufficient matrices, A dynamic model to solve the absolute value equations, George Dantzig in the development of economic analysis, The principle of extrapolation and the Cayley transform, Global error bounds for monotone affine variational inequality problems, On a global error bound for a class of monotone affine variational inequality problems, Constrained and unconstrained optimization formulations for structural elements in unilateral contact with an elastic foundation, Primal-dual bilinear programming solution of the absolute value equation, A new polynomial time method for a linear complementarity problem, Generalized vector implicit quasi complementarity problems, A field guide to the matrix classes found in the literature of the linear complementarity problem, A unified approach to complementarity in optimization, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, On multivalued complementarity problems in Banach spaces, An iterative approach for cone complementarity problems for nonsmooth dynamics, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix, On the development of an efficient numerical ice tank for the simulation of fluid-ship-rigid-ice interactions on graphics processing units, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, An algorithm for the fast solution of symmetric linear complementarity problems, An iterative method for a system of linear complementarity problems with perturbations and interval data, Vector \(F\)-implicit complementarity problems with corresponding variational inequality problems, A generalized Newton method for absolute value equations, Systems of linear interval equations, Variational inequalities and the pricing of American options, Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem, New characterizations of row sufficient matrices, Error bounds for nondegenerate monotone linear complementarity problems, A strategy for solving unilateral contact problems in rubber units, Mixed quasi complementarity problems in topological vector spaces, Conjugate cone characterization of positive definite and semidefinite matrices, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, Generalized linear complementarity problems treated without fixed-point theory, A fixed-point representation of the generalized complementarity problem, More results on the convergence of iterative methods for the symmetric linear complementarity problem, The relation between the path of centers and Smale's regularization of the linear programming problem, Interior-point algorithms for global optimization, Analysis of elastic and elastic-plastic adhesive joints using a mathematical programming approach, On total functions, existence theorems and computational complexity, Large scale nonholonomic elastoplastic analysis using a linear complementarity formulation, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2527120&oldid=15253859"