Complementary pivot theory of mathematical programming

From MaRDI portal

Publication:2527120

Jump to:navigation, search

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

zbMATH Keywords

linear programming; iteration; quadratic programming; bimatrix game

Mathematics Subject Classification ID

90C20: Quadratic programming

90C05: Linear programming

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, 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, 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, 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, Criteria for sufficient matrices, Principal pivot transforms: Properties and applications, On copositive matrices with -1, 9, 1 entries, Parallel pivotal algorithm for solving the linear complementarity problem, 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, Complementarity problems in semi-inner product spaces, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Complementarity in Oriented Matroids, Newton's method for linear complementarity problems, A theorem Onp-matrices, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, A Variable-Complexity Norm Maximization Problem, Even more with the Lemke complementarity algorithm, Linear complementarity problems with an invariant number of solutions, Robustness and nondegenerateness for linear complementarity problems, Iterative algorithms for the linear complementarity problem, Computational complexity of LCPs associated with positive definite symmetric matrices, A decomposition algorithm for quadratic programming, Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems, A variable dimension algorithm for the linear complementarity problem, Completely- matrices, On the Schur complement and the LU-factorization of a matrix, Duality for implicit variational problems and numerical applications, Unnamed Item, 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, On the number of solutions to the linear comple-mentarity problem, Linear complementarity problems solvable by A single linear program, A simplicial approximation of a solution for the nonlinear complementarity problem, On a class of least-element complementarity problems, 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 multivalued complementarity problems in Banach spaces, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Least-norm linear programming solution as an unconstrained minimization problem, On the number of iterations of local improvement algorithms, Systems of linear interval equations, Variational inequalities and the pricing of American options, Error bounds for nondegenerate monotone linear complementarity problems, A strategy for solving unilateral contact problems in rubber units, Conjugate cone characterization of positive definite and semidefinite matrices, A fixed-point representation of the generalized 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, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Solvability of variational inequality problems, Absolute value equations, Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games, Absolute value programming, A high accuracy method for solving ODEs with discontinuous right-hand side, Iterative algorithms for semi-linear quasi-complementarity problems, Jointly constrained bilinear programs and related problems: An overview, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, Generalized linear complementarity problems treated without fixed-point theory, More results on the convergence of iterative methods for the symmetric linear complementarity problem, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, A variable-dimension homotopy on networks for computing linear spatial equilibria, A parametric approach to complementarity theory, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Layout of facilities with some fixed points, 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, The quasi-complementarity problem, 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, An extension of Karmarkar's projective algorithm for convex quadratic programming, Sufficient matrices and the linear complementarity problem, Q-matrices and spherical geometry, Complete solutions for a class of elastic-plastic structures, 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 stable theorem of the alternative: An extension of the Gordan theorem, 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, 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, Solution of symmetric linear complementarity problems by iterative methods, A class of continuous nonlinear complementarity problems, 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, Linear complementarity problems and characterizations of Minkowski matrices, A reduction theorem for the linear complementarity problem with a certain patterned matrix, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, On the solution of large, structured linear complementarity problems: the block partitioned case, Hidden Z-matrices with positive principal minors, 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, A finite improvement algorithm for 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

Cites Work

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