Convex programming with single separable constraint and bounded variables

Author： Dahiya Kalpana   Suneja Surjeet   Verma Vanita  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.36, Iss.1, 2007-01, pp. : 67-82

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

On the Constructive Solution of Convex Programming Problems in Separable Form

By Tchemisova T. V.  

Journal of Mathematical Sciences, Vol. 120, Iss. 1, 2004-03 ,pp. : 1016-1031

Springer Publishing Company

Access to resources Recommend Favorite

Adaptive constraint reduction for convex quadratic programming

By Jung Jin  

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 125-157

Springer Publishing Company

Access to resources Recommend Favorite

An alternating direction-based contraction method for linearly constrained separable convex programming problems

By He Bingsheng  

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 573-596

Taylor & Francis Ltd

Access to resources Recommend Favorite

On volumes of bounded convex sets

By Elster Rosalind  

Optimization, Vol. 59, Iss. 1, 2010-01 ,pp. : 141-146

Taylor & Francis Ltd

Access to resources Recommend Favorite

Stochastic simulation based genetic algorithm for chance constraint programming problems with some discrete random variables

By R. K. Jana   M. P. Biswal  

International Journal of Computer Mathematics, Vol. 81, Iss. 12, 2004-12 ,pp. : 1455-1463

Taylor & Francis Ltd

Access to resources Recommend Favorite