• 제목/요약/키워드: convex cone

검색결과 56건 처리시간 0.029초

CONVERGENCE OF A NEW MULTISTEP ITERATION IN CONVEX CONE METRIC SPACES

  • Gunduz, Birol
    • 대한수학회논문집
    • /
    • 제32권1호
    • /
    • pp.39-46
    • /
    • 2017
  • In this paper, we propose a new multistep iteration for a finite family of asymptotically quasi-nonexpansive mappings in convex cone metric spaces. Then we show that our iteration converges to a common fixed point of this class of mappings under suitable conditions. Our result generalizes the corresponding result of Lee [5] from the closed convex subset of a convex cone metric space to whole space.

STRONG CONVERGENCE IN NOOR-TYPE ITERATIVE SCHEMES IN CONVEX CONE METRIC SPACES

  • LEE, BYUNG-SOO
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제22권2호
    • /
    • pp.185-197
    • /
    • 2015
  • The author considers a Noor-type iterative scheme to approximate com- mon fixed points of an infinite family of uniformly quasi-sup(fn)-Lipschitzian map- pings and an infinite family of gn-expansive mappings in convex cone metric spaces. His results generalize, improve and unify some corresponding results in convex met- ric spaces [1, 3, 9, 16, 18, 19] and convex cone metric spaces [8].

A CHARACTERIZATION OF ELLIPTIC HYPERBOLOIDS

  • Kim, Dong-Soo;Son, Booseon
    • 호남수학학술지
    • /
    • 제35권1호
    • /
    • pp.37-49
    • /
    • 2013
  • Consider a non-degenerate open convex cone C with vertex the origin in the $n$2-dimensional Euclidean space $E^n$. We study volume properties of strictly convex hypersurfaces in the cone C. As a result, for example, if the volume of the region of an elliptic cone C cut off by the tangent hyperplane P of M at $p$ is independent of the point $p{\in}M$, then it is shown that the hypersurface M is part of an elliptic hyperboloid.

순차 컨벡스 프로그래밍을 이용한 충돌각 제어 비행궤적 최적화 (Trajectory Optimization for Impact Angle Control based on Sequential Convex Programming)

  • 권혁훈;신효섭;김윤환;이동희
    • 전기학회논문지
    • /
    • 제68권1호
    • /
    • pp.159-166
    • /
    • 2019
  • Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

ON BOUNDEDNESS OF $\epsilon$-APPROXIMATE SOLUTION SET OF CONVEX OPTIMIZATION PROBLEMS

  • Kim, Gwi-Soo;Lee, Gue-Myung
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.375-381
    • /
    • 2008
  • Boundedness for the set of all the $\epsilon$-approximate solutions for convex optimization problems are considered. We give necessary and sufficient conditions for the sets of all the $\epsilon$-approximate solutions of a convex optimization problem involving finitely many convex functions and a convex semidefinite problem involving a linear matrix inequality to be bounded. Furthermore, we give examples illustrating our results for the boundedness.

  • PDF

BOUNDARIES OF THE CONE OF POSITIVE LINEAR MAPS AND ITS SUBCONES IN MATRIX ALGEBRAS

  • Kye, Seung-Hyeok
    • 대한수학회지
    • /
    • 제33권3호
    • /
    • pp.669-677
    • /
    • 1996
  • Let $M_n$ be the $C^*$-algebra of all $n \times n$ matrices over the complex field, and $P[M_m, M_n]$ the convex cone of all positive linear maps from $M_m$ into $M_n$ that is, the maps which send the set of positive semidefinite matrices in $M_m$ into the set of positive semi-definite matrices in $M_n$. The convex structures of $P[M_m, M_n]$ are highly complicated even in low dimensions, and several authors [CL, KK, LW, O, R, S, W]have considered the possibility of decomposition of $P[M_m, M_n] into subcones.

  • PDF

ASYMPTOTIC FOLIATIONS OF QUASI-HOMOGENEOUS CONVEX AFFINE DOMAINS

  • Jo, Kyeonghee
    • 대한수학회논문집
    • /
    • 제32권1호
    • /
    • pp.165-173
    • /
    • 2017
  • In this paper, we prove that the automorphism group of a quasi-homogeneous properly convex affine domain in ${\mathbb{R}_n}$ acts transitively on the set of all the extreme points of the domain. This set is equal to the set of all the asymptotic cone points coming from the asymptotic foliation of the domain and thus it is a homogeneous submanifold of ${\mathbb{R}_n}$.

JORDAN ALGEBRAS ASSOCIATED TO T-ALGEBARS

  • Jang, Young-Ho
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.179-189
    • /
    • 1995
  • Let $V \subset R^n$ be a convex homogeneous cone which does not contain straight lines, so that the automorphism group $$ G = Aut(R^n, V)^\circ = { g \in GL(R^n) $\mid$ gV = V}^\circ $$ ($\circ$ denoting the identity component) acts transitively on V. A convex cone V is called "self-dual" if V coincides with its dual $$ (1.1) V' = { x' \in R^n $\mid$ < x, x' > > 0 for all x \in \bar{V} - {0}} $$ where $\bar{V}$ denotes the closure of V.sure of V.

  • PDF