Geodesic

Sommaire

On a continuous minimization method in spaces with a variable metric
p. 3-9
On the reducibility of a general convex programming problem to an unconditional extremum problem
p. 10-18
A finite iterative method for finding an interior point of an algebraic polyhedron, and estimation of the number of steps
p. 19-25
A variant of the parametrized method of centers
p. 26-32
Reduced direction methods based on a modified Lagrange function for a nonlinear programming problem
p. 33-42
On the control of the solvability of convex variational problems
p. 43-53
A combined relaxation method for the search for vector equilibrium
p. 54-62
A general convex programming method with given accuracy
p. 63-73
On the application of the projection method for finding approximate roots of monotone mappings
p. 74-80
On a regularization method for inconsistent convex programming problems
p. 81-88
Residual functions in the iterative process of the barrier-Newton method in the solution of the general linear programming problem
p. 89-98