نتایج جستجو برای: smooth cost functions

تعداد نتایج: 967405  

افضلان, احسان , جورابیان, محمود ,

In this paper, solving optimal power flow problem has been investigated by using hybrid particle swarm optimization and Nelder Mead Algorithms. The goal of combining Nelder-Mead (NM) simplex method and particle swarm optimization (PSO) is to integrate their advantages and avoid their disadvantages. NM simplex method is a very efficient local search procedure but its convergence is extremely sen...

Journal: :journal of industrial engineering, international 2009
b afshar nadjafi b abbasi

extensive research has been devoted to economic production quantity (epq) problem. however, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. in this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...

Journal: :bulletin of the iranian mathematical society 2012
fazhan geng

a reproducing kernel hilbert space restricts the space of functions to smooth functions and has structure for function approximation and some aspects in learning theory. in this paper, the solution of an integral equation of the third kind is constructed analytically using a new method. the analytical solution is represented in the form of series in the reproducing kernel space. some numerical ...

2008
Chandra Sekhar Seelamantula François Aguet Sebastien Romain Philippe Thévenaz Michael Unser

We construct parametric active contours (snakes) for outlining cells in histology images. These snakes are defined in terms of cubic B-spline basis functions. We use a steerable ridge detector for obtaining a reliable map of the cell boundaries. Using the contour information thus obtained, we compute a distance map and specify it as one of the snake energies. To ensure smooth contours, we also ...

Journal: :Siam Journal on Mathematical Analysis 2021

This paper establishes the (nearly) optimal approximation error characterization of deep rectified linear unit (ReLU) networks for smooth functions in terms both width and depth simultaneously. To that end, we first prove multivariate polynomials can be approximated by ReLU $\mathcal{O}(N)$ $\mathcal{O}(L)$ with an $\mathcal{O}(N^{-L})$. Through local Taylor expansions their network approximati...

Journal: :Journal of Approximation Theory 1976

Journal: :Stochastic Processes and their Applications 1983

Journal: :Computational Statistics & Data Analysis 2007

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید