Sciweavers

90 search results - page 3 / 18
» A nontangential cutting plane algorithm
Sort
View
JOTA
2011
149views more  JOTA 2011»
13 years 2 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...
JCDCG
2004
Springer
14 years 25 days ago
Grid Vertex-Unfolding Orthostacks
An algorithm was presented in [1] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was conjectured that orthostacks could be ...
Erik D. Demaine, John Iacono, Stefan Langerman
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
14 years 2 months ago
Sparse Kernel SVMs via Cutting-Plane Training
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
Thorsten Joachims, Chun-Nam John Yu
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Straightest Paths on Meshes by Cutting Planes
Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to c...
Sungyeol Lee, Joonhee Han, Haeyoung Lee