Minimax risk over quadratically convex sets

ISSN： 1072-3374

Source： Journal of Mathematical Sciences, Vol.167, Iss.4, 2010-06, pp. : 537-542

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

Solving quadratically constrained convex optimization problems with an interior-point method

By Mészáros Csaba

Optimization Methods and Software, Vol. 26, Iss. 3, 2011-06 ,pp. : 421-429

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

By Mitchell John E. Pang Jong-Shi Yu Bin

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 120-136

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Ariyawansa K.A. Jiang P.L.

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

Springer Publishing Company

Access to resources Recommend Favorite

A property on convex fuzzy sets

By Yang X.M. Yang F.M.

Fuzzy Sets and Systems, Vol. 126, Iss. 2, 2002-03 ,pp. : 269-271

Elsevier

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