The following pages link to (Q5608986):
Displayed 50 items.
- A linear complementarity formulation of rate-independent finite-strain elastoplasticity. Part I: Algorithm for numerical integration (Q340219) (← links)
- A linear complementarity formulation of rate-independent finite-strain elastoplasticity. Part II: Calculation of bifurcation and limit points (Q340220) (← links)
- Equations on monotone graphs (Q378122) (← links)
- Piecewise affine bijections of \(\mathbb R^n\), and the equation \(Sx^ +- Tx^ -=y\) (Q580193) (← links)
- A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
- On the transpose of a pseudomonotone matrix and the LCP (Q811415) (← links)
- Nonlinear analysis of structural elements under unilateral contact constraints by a Ritz-type approach (Q837252) (← links)
- A decomposition algorithm for \(N\)-player games (Q847797) (← links)
- Existence theorems for linear complementarity problems on solid closed convex cones (Q852107) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- Generalized linear complementarity problems (Q920851) (← links)
- Constrained and unconstrained optimization formulations for structural elements in unilateral contact with an elastic foundation (Q955915) (← links)
- A numerical scheme for integrating the rate plasticity equations with an ''a priori'' error control (Q1087362) (← links)
- The linear complementarity problem and a subclass of fully semimonotone matrices (Q1087473) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- On Poljak's improved subgradient method (Q1090617) (← links)
- Homotopy techniques in linear programming (Q1091937) (← links)
- An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
- An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872) (← links)
- Generalization of Murty's direct algorithm to linear and convex quadratic programming (Q1106739) (← links)
- An enumerative method for the solution of linear complementarity problems (Q1110460) (← links)
- Structure properties of W matrices (Q1112145) (← links)
- Pseudomonotone and copositive star matrices (Q1112921) (← links)
- A note on solving quadratic programs using mixed-integer programming (Q1115803) (← links)
- Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
- Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122) (← links)
- Semi-infinite quadratic programming (Q1144494) (← links)
- Matrices and the linear complementarity problem (Q1154944) (← links)
- On the parametric linear complementarity problem: A generalized solution procedure (Q1154946) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Extensions of Lemke's algorithm for the linear complementarity problem (Q1226441) (← links)
- Solution of symmetric linear complementarity problems by iterative methods (Q1231762) (← links)
- Zur numerischen Behandlung inkorrekt gestellter Aufgaben (Q1238211) (← links)
- On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772) (← links)
- On the solution of large, structured linear complementarity problems: the block partitioned case (Q1251591) (← links)
- A reference direction approach to multiple objective quadratic-linear programming (Q1290716) (← links)
- Investigations of a certain class of linear complementarity problems (Q1321137) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- An application of Lemke's method to a class of Markov decision problems (Q1610179) (← links)
- The basic theorem of complementarity revisited (Q1803604) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- A BEM solution for plates on elastic half-space with unilateral contact (Q1961168) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Pricing American drawdown options under Markov models (Q2030371) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)