• Title/Summary/Keyword: differentiable

Search Result 195, Processing Time 0.024 seconds

Generating Complicated Models for Time Series Using Genetic Programming

  • Yoshihara, Ikuo;Yasunaga, Moritoshi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.146.4-146
    • /
    • 2001
  • Various methods have been proposed for the time series prediction. Most of the conventional methods only optimize parameters of mathematical models, but to construct an appropriate functional form of the model is more difficult in the first place. We employ the Genetic Programming (GP) to construct the functional form of prediction models. Our method is distinguished because the model parameters are optimized by using Back-Propagation (BP)-like method and the prediction model includes discontinuous functions, such as if and max, as node functions for describing complicated phenomena. The above-mentioned functions are non-differentiable, but the BP method requires derivative. To solve this problem, we develop ...

  • PDF

MULTI-SCALE DERIVATIVE OF IRREGULAR FUNCTIONS

  • Kim, Tae-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.1_2
    • /
    • pp.393-404
    • /
    • 2003
  • In general, a differential operator can be used as a tool of treating the local properties of given function. However, when the given function is varied with high frequency and has irregular form with non-stationary evolution it may not act its role sufficiently as in case of nowhere differentiable curves. In this paper we introduce a multi-scale derivative as a form of weakened global derivative so that it may explain its semi global diffusion properties as well as local ones for the various irregular diffusion phenomena.

An algorithm for computer-aided controller design using semi-infinite programming technique (SIP를 이용한 computer-aided 제어기 설계에 대한 알고리즘)

  • 권태용;이종용;이상효
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1986.10a
    • /
    • pp.629-632
    • /
    • 1986
  • Both combinatorial and parametric optimization are used in computer-aided design(CAD). The most commonly occuring parametric optimization problems in engineering design such as design of control systems, design of electric circuits are usually expressed either as differentiable or as nondifferentiable semi-infinite programming(SIP) problems. In this paper we express algorithms for a class of computer-aided design problems arising in control systems.

  • PDF

The Image of Derivations on Banach Algebras of Differential Functions

  • Park, Dal-Won
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.2 no.1
    • /
    • pp.81-90
    • /
    • 1989
  • Let $D:C^n(I){\longrightarrow}M$ be a derivation from the Banach algebra of n times continuously differentiable functions on an interval I into a Banach $C^n(I)$-module M. If D is continuous and D(z) is contained in the k-differential subspace, the image of D is contained in the k-differential subspace. The question of when the image of a derivation is contained in the k-differential subspace is discussed.

  • PDF

ON SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Kim, Moon-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.2
    • /
    • pp.287-305
    • /
    • 2003
  • Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

ITERATIVE ALGORITHMS WITH ERRORS FOR NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Jung, Jong-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.4
    • /
    • pp.771-790
    • /
    • 2006
  • The iterative algorithms with errors for nonexpansive mappings are investigated in Banach spaces. Strong convergence theorems for these algorithms are obtained. Our results improve the corresponding results in [5, 13-15, 23, 27-29, 32] as well as those in [1, 16, 19, 26] in framework of a Hilbert space.

OPTIMAL CONDITIONS FOR ENDPOINT CONSTRAINED OPTIMAL CONTROL

  • Kim, Kyung-Eung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.563-571
    • /
    • 2008
  • We deduce the necessary conditions for the optimality of endpoint constrained optimal control problem. These conditions comprise the adjoint equation, the maximum principle and the transversality condition. We assume that the cost function is merely differentiable. Therefore the technique under Lipschitz continuity hypothesis is not directly applicable. We introduce Fermat's rule and value function technique to obtain the results.

Spatial Histograms for Region-Based Tracking

  • Birchfield, Stanley T.;Rangarajan, Sriram
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.697-699
    • /
    • 2007
  • Spatiograms are histograms augmented with spatial means and covariances to capture a richer description of the target. We present a particle filtering framework for region-based tracking using spatiograms. Unlike mean shift, the framework allows for non-differentiable similarity measures to compare two spatiograms; we present one such similarity measure, a combination of a recent weighting scheme and histogram intersection. Experimental results show improved performance with the new measure as well as the importance of global spatial information for tracking. The performance of spatiograms is compared with color histograms and several texture histogram methods.

  • PDF