Sciweavers

309 search results - page 26 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
MICS
2007
90views more  MICS 2007»
13 years 7 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter
ICML
2003
IEEE
14 years 8 months ago
Modified Logistic Regression: An Approximation to SVM and Its Applications in Large-Scale Text Categorization
Logistic Regression (LR) has been widely used in statistics for many years, and has received extensive study in machine learning community recently due to its close relations to S...
Jian Zhang, Rong Jin, Yiming Yang, Alexander G. Ha...
ICCS
2009
Springer
14 years 2 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
SIAMJO
2008
74views more  SIAMJO 2008»
13 years 7 months ago
Lagrangian-Dual Functions and Moreau--Yosida Regularization
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Sou...
STACS
2001
Springer
14 years 3 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...