The Continuous Linearization Method of the Fourth Order
Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 39
This paper considers the continuous linearization method of the fourth
order for solving the convex programming problem Euclidean space. The sufficient
conditions for convergence are established.
@article{YJOR_1997_7_1_a2,
author = {An{\dj}elija Nedi\'c and Milojica Ja\'cimovi\'c and Anatoly S. Antipin},
title = {The {Continuous} {Linearization} {Method} of the {Fourth} {Order}},
journal = {Yugoslav journal of operations research},
pages = {39 },
year = {1997},
volume = {7},
number = {1},
zbl = {0949.90072},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a2/}
}
TY - JOUR AU - Anđelija Nedić AU - Milojica Jaćimović AU - Anatoly S. Antipin TI - The Continuous Linearization Method of the Fourth Order JO - Yugoslav journal of operations research PY - 1997 SP - 39 VL - 7 IS - 1 UR - http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a2/ LA - en ID - YJOR_1997_7_1_a2 ER -
Anđelija Nedić; Milojica Jaćimović; Anatoly S. Antipin. The Continuous Linearization Method of the Fourth Order. Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 39 . http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a2/