On the Convergence of Cone Splitting Algorithms with &ohgr;-Subdivisions

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.110, Iss.1, 2001-07, pp. : 119-144

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

Weak and strong convergence of proximal penalization and proximal splitting algorithms for two-level hierarchical Ky Fan minimax inequalities

Optimization, Vol. 64, Iss. 5, 2015-05 ,pp. : 1285-1303

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

By Locatelli M. Raber U.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 1, 2000-10 ,pp. : 69-79

Springer Publishing Company

Access to resources Recommend Favorite

On the convergence of genetic algorithms – a variational approach

By Stannat Wilhelm

Probability Theory and Related Fields, Vol. 129, Iss. 1, 2004-05 ,pp. : 113-132

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Splitting and Merging Algorithms for Order Decomposable Problems

By Grossi R. Italiano G.F.

Information and Computation, Vol. 154, Iss. 1, 1999-10 ,pp. : 1-33

Academic Press

Access to resources Recommend Favorite

Convergence of timespace adaptive algorithms for nonlinear conservation laws

By Coquel Frdric Postel Marie Tran Quang-Huy

IMA Journal of Numerical Analysis, Vol. 32, Iss. 4, 2012-10 ,pp. : 1440-1483

Oxford University Press

Access to resources Recommend Favorite