Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.17, Iss.2, 2002-01, pp. : 251-269

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

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

Inverse cutting plane methods for optimization problems with second-order stochastic dominance constraints

By Dentcheva Darinka

Optimization, Vol. 59, Iss. 3, 2010-04 ,pp. : 323-338

Taylor & Francis Ltd

Access to resources Recommend Favorite

A customized proximal point algorithm for convex minimization with linear constraints

By He Bingsheng Yuan Xiaoming Zhang Wenxing

Computational Optimization and Applications, Vol. 56, Iss. 3, 2013-12 ,pp. : 559-572

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

By Karmitsa Napsu Tanaka Filho Mario Herskovits José

Journal of Optimization Theory and Applications, Vol. 148, Iss. 3, 2011-03 ,pp. : 528-549

Springer Publishing Company

Access to resources Recommend Favorite

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