A unified approach to complementarity in optimization
From MaRDI portal
Publication:1210970
DOI10.1016/0012-365X(74)90037-5zbMath0289.90035MaRDI QIDQ1210970
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Permutations, words, matrices (05A05)
Related Items (10)
Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm ⋮ Parametric fixed point algorithms with applications to economic policy analysis ⋮ A simplicial algorithm for the nonlinear complementarity problem ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ An exposition of the (linear) complementarity problem ⋮ An existence theorem for solutions tof(x) = 0 ⋮ Scalar labelings for homotopy paths ⋮ Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron ⋮ Finding all solutions to polynomial systems and other systems of equations ⋮ Remarks on matroids and Sperner's lemma
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary pivot theory of mathematical programming
- A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes
- Some Combinatorial Lemmas in Topology
- Long Monotone Paths in Abstract Polytopes
- A simplicial algorithm for the nonlinear complementarity problem
- A general saddle point result for constrained optimization
- Equilibrium Points of Bimatrix Games
- Note on a Fundamental Theorem in Quadratic Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
- The Approximation of Fixed Points of a Continuous Mapping
- Nonlinear Programs with Positively Bounded Jacobians
- On the Sperner lemma
- A Probelm in Linear Inequalities
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- A generalization of the linear complementarity problem
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Computing Kakutani Fixed Points
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
- On the basic theorem of complementarity
- The complementarity problem
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: A unified approach to complementarity in optimization