• Title/Summary/Keyword: convex combinations

Search Result 20, Processing Time 0.017 seconds

Minimax Choice and Convex Combinations of Generalized Pickands Estimator of the Extreme Value Index

  • Yun, Seokhoon
    • Journal of the Korean Statistical Society
    • /
    • v.31 no.3
    • /
    • pp.315-328
    • /
    • 2002
  • As an extension of the well-known Pickands (1975) estimate. for the extreme value index, Yun (2002) introduced a generalized Pickands estimator. This paper searches for a minimax estimator in the sense of minimizing the maximum asymptotic relative efficiency of the Pickands estimator with respect to the generalized one. To reduce the asymptotic variance of the resulting estimator, convex combinations of the minimax estimator are also considered and their asymptotic normality is established. Finally, the optimal combination is determined and proves to be superior to the generalized Pickands estimator.

New Subclasses of Harmonic Starlike and Convex Functions

  • Porwal, Saurabh;Dixit, Kaushal Kishore
    • Kyungpook Mathematical Journal
    • /
    • v.53 no.3
    • /
    • pp.467-478
    • /
    • 2013
  • The purpose of the present paper is to establish some interesting results involving coefficient conditions, extreme points, distortion bounds and covering theorems for the classes $V_H({\beta})$ and $U_H({\beta})$. Further, various inclusion relations are also obtained for these classes. We also discuss a class preserving integral operator and show that these classes are closed under convolution and convex combinations.

Extreme point results for robust schur stability

  • Kang, Hwan-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.467-470
    • /
    • 1994
  • In this paper, we develop two sufficient conditions for Schur stability of convex combinations of discrete time polynomials. We give conditions under which Schur stability of the extremes implies Schur stability of the entire convex combination. These results are based on Bhattacharyya's result(1991), the AHMC theory in Barmish and Kang's paper (1993) and the bilinear transformation. Important applications of the results involves robust Schur stability of a feedback system having degenerate interval plants in an extreme point context.

  • PDF

A Multi-interchange Simplex Method and its Computational Efficiency (다변환 심플렉스 기법과 이의 효율성)

  • Jeong Seong-Jin;Lee Myeon-U;Lee Chang-Hun;Gang Seok-Ho
    • Journal of the military operations research society of Korea
    • /
    • v.11 no.1
    • /
    • pp.79-86
    • /
    • 1985
  • A multi-interchange simplex method is presented. This method tries to cut almost half of the set of convex combinations which generate all decreasing feasible directions. Analysis of this method indicates high possibility of the existence of polynomial-time simplex-type methods.

  • PDF

A CERTAIN SUBCLASS OF MEROMORPHIC FUNCTIONS WITH POSITIVE COEFFICIENTS ASSOCIATED WITH AN INTEGRAL OPERATOR

  • Akgul, Arzu
    • Honam Mathematical Journal
    • /
    • v.39 no.3
    • /
    • pp.331-347
    • /
    • 2017
  • The aim of the present paper is to introduce a new subclass of meromorphic functions with positive coefficients defined by a certain integral operator and a necessary and sufficient condition for a function f to be in this class. We obtain coefficient inequality, meromorphically radii of close-to-convexity, starlikeness and convexity, convex linear combinations, Hadamard product and integral transformation for the functions f in this class.

Multivalent Harmonic Uniformly Starlike Functions

  • Ahuja, Om;Joshi, Santosh;Sangle, Naveneet
    • Kyungpook Mathematical Journal
    • /
    • v.49 no.3
    • /
    • pp.545-555
    • /
    • 2009
  • In this paper, we investigate a generalized family of complex-valued harmonic functions that are multivalent, sense-preserving, and are associated with k-uniformly harmonic functions in the unit disk. The results obtained here include a number of known and new results as their special cases.

ON SOME COMBINATIONS OF SELF-RECIPROCAL POLYNOMIALS

  • Kim, Seon-Hong
    • Communications of the Korean Mathematical Society
    • /
    • v.27 no.1
    • /
    • pp.175-183
    • /
    • 2012
  • Let $\mathcal{P}_n$ be the set of all monic integral self-reciprocal poly-nomials of degree n whose all zeros lie on the unit circle. In this paper we study the following question: For P(z), Q(z)${\in}\mathcal{P}_n$, does there exist a continuous mapping $r{\rightarrow}G_r(z){\in}\mathcal{P}_n$ on [0, 1] such that $G_0$(z) = P(z) and $G_1$(z) = Q(z)?.

Optimal wind-induced load combinations for structural design of tall buildings

  • Chan, C.M.;Ding, F.;Tse, K.T.;Huang, M.F.;Shum, K.M.;Kwok, K.C.S.
    • Wind and Structures
    • /
    • v.29 no.5
    • /
    • pp.323-337
    • /
    • 2019
  • Wind tunnel testing technique has been established as a powerful experimental method for predicting wind-induced loads on high-rise buildings. Accurate assessment of the design wind load combinations for tall buildings on the basis of wind tunnel tests is an extremely important and complicated issue. The traditional design practice for determining wind load combinations relies partly on subjective judgments and lacks a systematic and reliable method of evaluating critical load cases. This paper presents a novel optimization-based framework for determining wind tunnel derived load cases for the structural design of wind sensitive tall buildings. The peak factor is used to predict the expected maximum resultant responses from the correlated three-dimensional wind loads measured at each wind angle. An optimized convex hull is further developed to serve as the design envelope in which the peak values of the resultant responses at any azimuth angle are enclosed to represent the critical wind load cases. Furthermore, the appropriate number of load cases used for design purposes can be predicted based on a set of Pareto solutions. One 30-story building example is used to illustrate the effectiveness and practical application of the proposed optimization-based technique for the evaluation of peak resultant wind-induced load cases.

Economic Dispatch Algorithm as Combinatorial Optimization Problems (조합최적화문제로 접근한 경제급전 알고리즘 개발)

  • Min, Kyung-Il;Lee, Su-Won;Choi, In-Kyu;Moon, Young-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.8
    • /
    • pp.1485-1495
    • /
    • 2009
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the ${\lambda}-P$ function method is used to calculate ED for the fitness function of GA. The ${\lambda}-P$ function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.

An Economic Dispatch Algorithm as Combinatorial Optimization Problems

  • Min, Kyung-Il;Lee, Su-Won;Moon, Young-Hyun
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.468-476
    • /
    • 2008
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the $\lambda$-P table method is used to calculate ED for the fitness function of GA. The $\lambda$-P table method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with three kinds of ED problems, namely ED considering valve-point effects (EDVP), ED with multiple fuel units (EDMF), and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all three ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.