Cutting plane algorithms for robust conic convex optimization problems

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.21, Iss.5, 2006-10, pp. : 779-803

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 Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm

By Still Claus Westerlund Tapio

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 63-83

Springer Publishing Company

Access to resources Recommend Favorite

Duality gap of the conic convex constrained optimization problems in normed spaces

By Ban Liqun

Mathematical Programming, Vol. 119, Iss. 2, 2009-07 ,pp. : 195-214

Springer Publishing Company

Access to resources Recommend Favorite

A proximal cutting plane method using Chebychev center for nonsmooth convex optimization

By Ouorou Adam

Mathematical Programming, Vol. 119, Iss. 2, 2009-07 ,pp. : 239-271

Springer Publishing Company

Access to resources Recommend Favorite

Convex Nondifferentiable Optimization: A Survey Focused on the Analytic Center Cutting Plane Method

By Goffin Jean-Louis Vial Jean-Philippe

Optimization Methods and Software, Vol. 17, Iss. 5, 2002-01 ,pp. : 805-867

Taylor & Francis Ltd

Access to resources Recommend Favorite

Cutting-set methods for robust convex optimization with pessimizing oracles

By Mutapcic Almir Boyd Stephen

Optimization Methods and Software, Vol. 24, Iss. 3, 2009-06 ,pp. : 381-406

Taylor & Francis Ltd

Access to resources Recommend Favorite