On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

Author: Ariyawansa K.A.   Jiang P.L.  

Publisher: Springer Publishing Company

ISSN: 0022-3239

Source: Journal of Optimization Theory and Applications, Vol.107, Iss.2, 2000-11, pp. : 223-243

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract