scientific article; zbMATH DE number 3332061
From MaRDI portal
zbMath0208.45502MaRDI QIDQ5608986
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New variants of the criss-cross method for linearly constrained convex quadratic programming, A numerical scheme for integrating the rate plasticity equations with an a priori error control, The linear complementarity problem and a subclass of fully semimonotone matrices, A new subclass of \(Q_0\)-matrix in linear complementarity theory, Nonlinear analysis of structural elements under unilateral contact constraints by a Ritz-type approach, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, On Poljak's improved subgradient method, Homotopy techniques in linear programming, An LP-based successive overrelaxation method for linear complementarity problems, A decomposition algorithm for \(N\)-player games, The complementarity problem, Existence theorems for linear complementarity problems on solid closed convex cones, Development of Specific hypothesis tests for estimated markov chains, An experimental investigation of enumerative methods for the linear complementarity problem, Generalization of Murty's direct algorithm to linear and convex quadratic programming, A linear complementarity formulation of rate-independent finite-strain elastoplasticity. Part I: Algorithm for numerical integration, A linear complementarity formulation of rate-independent finite-strain elastoplasticity. Part II: Calculation of bifurcation and limit points, Criss-cross methods: A fresh view on pivot algorithms, An enumerative method for the solution of linear complementarity problems, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Structure properties of W matrices, Pseudomonotone and copositive star matrices, A note on solving quadratic programs using mixed-integer programming, Quadratic programming problems and related linear complementarity problems, Interior path following primal-dual algorithms. II: Convex quadratic programming, Computing upper and lower bounds in interval decision trees, Equations on monotone graphs, The Geometry of the Painlevé Paradox, EP theorems and linear complementarity problems, Semi-infinite quadratic programming, A linear complementarity approach to the time integration of dynamic elastic-plastic structural problems, A simplicial algorithm for the nonlinear complementarity problem, Matrices and the linear complementarity problem, On the parametric linear complementarity problem: A generalized solution procedure, A finite characterization ofK-matrices in dimensions less than four, A BEM solution for plates on elastic half-space with unilateral contact, Generalized linear complementarity problems, Convex optimization techniques in compliant assembly simulation, A least-distance programming procedure for minimization problems under linear constraints, A FPTAS for computing a symmetric leontief competitive economy equilibrium, Crashing a maximum-weight complementary basis, On the application of the ABS algorithm to linear programming and linear complementarity, Constrained and unconstrained optimization formulations for structural elements in unilateral contact with an elastic foundation, Exterior point algorithms for nearest points and convex quadratic programs, An RLT approach for solving the binary-constrained mixed linear complementarity problem, A simplicial approximation of a solution for the nonlinear complementarity problem, Extensions of Lemke's algorithm for the linear complementarity problem, Solution of symmetric linear complementarity problems by iterative methods, Piecewise affine bijections of \(\mathbb R^n\), and the equation \(Sx^ +- Tx^ -=y\), Zur numerischen Behandlung inkorrekt gestellter Aufgaben, Pricing American drawdown options under Markov models, On the solution of large, structured linear complementarity problems: The tridiagonal case, More with the Lemke complementarity algorithm, On the solution of large, structured linear complementarity problems: the block partitioned case, The basic theorem of complementarity revisited, Cycling in linear complementarity problems, Existence theory for generalized nonlinear complementarity problems, Generalized complementarity problem, An interior-point path-following algorithm for computing a Leontief economy equilibrium, Cutting-planes for programs with disjunctive constraints, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, A reference direction approach to multiple objective quadratic-linear programming, Parametric approaches to fractional programs, Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization, Some classes of matrices in linear complementarity theory, Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke, On the transpose of a pseudomonotone matrix and the LCP, A generalized complementary pivoting algorithm, Investigations of a certain class of linear complementarity problems, An application of Lemke's method to a class of Markov decision problems
