Sciweavers

2 search results - page 1 / 1
» Globally Convergent Cutting Plane Method for Nonconvex Nonsm...
Sort
View
JOTA
2011
149views more  JOTA 2011»
13 years 1 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
SIAMJO
2011
13 years 1 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye