Approximate Subgradient Methods for Nonlinearly Constrained Network Flow Problems

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.128, Iss.1, 2006-01, pp. : 167-190

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

String-averaging projected subgradient methods for constrained minimization

By Censor Yair Zaslavski Alexander J.

Optimization Methods and Software, Vol. 29, Iss. 3, 2014-05 ,pp. : 658-670

Taylor & Francis Ltd

Access to resources Recommend Favorite

Primal-dual subgradient methods for convex problems

By Nesterov Yurii

Mathematical Programming, Vol. 120, Iss. 1, 2009-08 ,pp. : 221-259

Springer Publishing Company

Access to resources Recommend Favorite

A proximal subgradient projection algorithm for linearly constrained strictly convex problems

By Ouorou Adam

Optimization Methods and Software, Vol. 22, Iss. 4, 2007-08 ,pp. : 617-636

Taylor & Francis Ltd

Access to resources Recommend Favorite

Symmetric approximate linear programming for factored MDPs with application to constrained problems

By Dolgov Dmitri

Annals of Mathematics and Artificial Intelligence, Vol. 47, Iss. 3-4, 2006-08 ,pp. : 273-293

Springer Publishing Company

Access to resources Recommend Favorite

Chance‐constrained multi‐terminal network design problems

Naval Research Logistics: An International Journal, Vol. 62, Iss. 4, 2015-06 ,pp. : 321-334

John Wiley & Sons Inc

Access to resources Recommend Favorite