On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems

Author： Larsson T.   Patriksson M.   Stromberg A.-B.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.151, Iss.3, 2003-12, pp. : 461-473

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

Related content

Exact solution methods for uncapacitated location problems with convex transportation costs

By Holmberg K.  

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 127-140

Elsevier

Access to resources Recommend Favorite

The Construction Technology of the High-Rise Shear Wall Angles of the Concave and the Convex

By  

Advanced Materials Research, Vol. 2014, Iss. 1065, 2015-01 ,pp. : 1573-1576

Trans Tech Publications

Access to resources Recommend Favorite

Approximation methods for non-convex curves

By Liu Y.   Teo K.L.   Yang X.Q.  

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 125-135

Elsevier

Access to resources Recommend Favorite

Difference of convex solution of quadratically constrained optimization problems

By Van Voorhis T.   Al-Khayyal F.A.  

European Journal of Operational Research, Vol. 148, Iss. 2, 2003-07 ,pp. : 349-362

Elsevier

Access to resources Recommend Favorite

Accelerating the convergence of subgradient optimisation

By Baker B.M.   Sheasby J.  

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 136-144

Elsevier

Access to resources Recommend Favorite