An extended Gauss-Seidel method for multi-valued mixed complementarity problems class of generalized mixed
complementarity problems (MCPs) with box
constraints, whose cost mapping is a
A method for solving a general multi-valued complementarity problemWe propose an extended version of Chandrasekaran's method for general
complementarity problems
An extended Gauss-Seidel method for multi-valued mixed complementarity problems class of generalized mixed
complementarity problems (MCPs) with box
constraints, whose cost mapping is a
A method for solving a general multi-valued complementarity problemWe propose an extended version of Chandrasekaran's method for general
complementarity problems
К условиям регулярности в математическом программировании general condition of regularity (
constraint qualification)
in problems of
mathematical programming The Problem of Projecting the Origin of Euclidean Space onto the Convex Polyhedron of quadratic
programming, maximin, linear
complementarity, and nonnegative least squares. Such reduction
On a Problem of Programming the Movement of a Mobile Robot of kinematic properties and control of dynamics of systems with
program constraints. We propose a construction
On Construction of the Systems with Quasi- Invariant Program ConstraintsThe procedure of construction of the systems with the quasi-invariant
program constraints