• 제목/요약/키워드: interior-point algorithm

검색결과 90건 처리시간 0.026초

ON COMPLEXITY ANALYSIS OF THE PRIMAL-DUAL INTERIOR-POINT METHOD FOR SECOND-ORDER CONE OPTIMIZATION PROBLEM

  • Choi, Bo-Kyung;Lee, Gue-Myung
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제14권2호
    • /
    • pp.93-111
    • /
    • 2010
  • The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

Quadratic Interior Point 법을 적용한 전력계통의 경제급전 (Application of Quadratic Interior Point Method to Economic Dispatch)

  • 이홍주;정재길;이인용;김경신;박규홍
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 A
    • /
    • pp.344-346
    • /
    • 2000
  • The Paper describes the implementation of a quadratic interior point method for optimal power flow involves the determination of the optimal of a given objectives function subject to given constraints. The scheme developed solves the quadratic or linear optimization problem subject to linear constraints. The algorithm has been evaluated on a 14-bus system, and its accuracy and speed are demonstrated.

  • PDF

NEW INTERIOR POINT METHODS FOR SOLVING $P_*(\kappa)$ LINEAR COMPLEMENTARITY PROBLEMS

  • Cho, You-Young;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제13권3호
    • /
    • pp.189-202
    • /
    • 2009
  • In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

  • PDF

Patch loading resistance prediction of steel plate girders using a deep artificial neural network and an interior-point algorithm

  • Mai, Sy Hung;Tran, Viet-Linh;Nguyen, Duy-Duan;Nguyen, Viet Tiep;Thai, Duc-Kien
    • Steel and Composite Structures
    • /
    • 제45권2호
    • /
    • pp.159-173
    • /
    • 2022
  • This paper proposes a hybrid machine-learning model, which is called DANN-IP, that combines a deep artificial neural network (DANN) and an interior-point (IP) algorithm in order to improve the prediction capacity on the patch loading resistance of steel plate girders. For this purpose, 394 steel plate girders that were subjected to patch loading were tested in order to construct the DANN-IP model. Firstly, several DANN models were developed in order to establish the relationship between the patch loading resistance and the web panel length, the web height, the web thickness, the flange width, the flange thickness, the applied load length, the web yield strength, and the flange yield strength of steel plate girders. Accordingly, the best DANN model was chosen based on three performance indices, which included the R^2, RMSE, and a20-index. The IP algorithm was then adopted to optimize the weights and biases of the DANN model in order to establish the hybrid DANN-IP model. The results obtained from the proposed DANN-IP model were compared with of the results from the DANN model and the existing empirical formulas. The comparison showed that the proposed DANN-IP model achieved the best accuracy with an R^2 of 0.996, an RMSE of 23.260 kN, and an a20-index of 0.891. Finally, a Graphical User Interface (GUI) tool was developed in order to effectively use the proposed DANN-IP model for practical applications.

실내디자인 이미지의 유사성 측정 - 관찰자 직관 기반 측정법과 알고리즘 기반 정량적 측정법의 결과 비교를 중심으로 - (The Similarity Measurement of Interior Design Images - Comparison between Measurement based on Perceptual Judgment and Measurement through Computing the Algorithm -)

  • 유호정;하미경
    • 한국실내디자인학회논문집
    • /
    • 제24권2호
    • /
    • pp.32-41
    • /
    • 2015
  • We live in the era of unlimited design competition. As the importance of design is increasing in all areas including marketing, each country does its best effort on design development. However, the preparation on protecting interior design rights by intellectual property laws(IPLs) has not been enough even though they occupy an important place in the design field. It is not quite easy to make a judgement on the similarity between two images having a single common factor because the factors which are composed of interior design have complicated interactive relations between them. From the IPLs point of view, designs with the similar overall appearance are decided to be similar. Objective evaluation criteria not only for designers but also for design examiners and judges are required in order to protect interior design by the IPLs. The objective of this study is the analysis of the possibility that a computer algorithm method can be useful to decide the similarity of interior design images. According to this study, it is realized that the Img2 which is one of content-based image retrieval computer programs can be utilized to measure the degree of the similarity. The simulation results of three descriptors(CEDD, FCTH, JCD) in the Img2 showed the high degree of similar patterns compared with the results of perceptual judgment by observers. In particular, it was verified that the Img2 has high availability on interior design images with a high score of similarity below 60 which are perceptually judged by observers.

Power Allocation Method of Downlink Non-orthogonal Multiple Access System Based on α Fair Utility Function

  • Li, Jianpo;Wang, Qiwei
    • Journal of Information Processing Systems
    • /
    • 제17권2호
    • /
    • pp.306-317
    • /
    • 2021
  • The unbalance between system ergodic sum rate and high fairness is one of the key issues affecting the performance of non-orthogonal multiple access (NOMA) system. To solve the problem, this paper proposes a power allocation algorithm to realize the ergodic sum rate maximization of NOMA system. The scheme is mainly achieved by the construction algorithm of fair model based on α fair utility function and the optimal solution algorithm based on the interior point method of penalty function. Aiming at the construction of fair model, the fair target is added to the traditional power allocation model to set the reasonable target function. Simultaneously, the problem of ergodic sum rate and fairness in power allocation is weighed by adjusting the value of α. Aiming at the optimal solution algorithm, the interior point method of penalty function is used to transform the fair objective function with unequal constraints into the unconstrained problem in the feasible domain. Then the optimal solution of the original constrained optimization problem is gradually approximated within the feasible domain. The simulation results show that, compared with NOMA and time division multiple address (TDMA) schemes, the proposed method has larger ergodic sum rate and lower Fairness Index (FI) values.

A Formulation of Hybrid Algorithm for Linear Programming

  • Kim, Koon-Chan
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.187-201
    • /
    • 1994
  • This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.

  • PDF

LMI 가능성 문제를 위한 타원 알고리즘의 개선 (An improved ellipsoid algorithm for LMI feasibility problems)

  • 방대인;최진영
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
    • /
    • pp.188-192
    • /
    • 2002
  • The ellipsoid algorithm solves some feasibility(or optimization) problems with LMI(Linear Matrix Inequality) constraint in polynomial time. Recently, it has been replaced by interior point algorithm due to its slow convergence and incapability of verifying feasibility. This paper proposes a method to improve its convergence by using the deep-cut method of linear programming. Simulation results show that the improved algorithm is more effective than the original one.

  • PDF

엔진마운트의 전달경로해석을 통한 실내소음저감 시뮬레이션 (Simulation on the Reduction of Interior Noise using the Transfer Path Analysis of the Active Engine Mount)

  • 이충휘;김영호;최현준;원종식
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2008년도 춘계학술대회논문집
    • /
    • pp.166-170
    • /
    • 2008
  • In this study, it proved that transfer path analysis is a proper technique to estimate the interior noise from comparing measured interior noise in case of 3 point supported engine mount system. And the simulation of the vibration isolation for active engine mount using FXLMS algorithm is performed. Also, it verified that reduction of estimated interior noise from transfer path analysis and simulation of the vibration isolation.

  • PDF

이산 제어 변수를 포함한 비선형 내점법 기반 최적조류계산 (NIPM -Based Optimal Power Flow Including Discrete Control Variables)

  • 로델 도사노;송화창;김태균
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.226-228
    • /
    • 2007
  • This paper proposes Nonlinear Interior Point Method (NIPM) including discrete control variables optimal power flow formulations. The algorithm utilizes the robustness in terms of starting point and fast convergence for large scale power system of NIPM and an introduction of rounding penalty function which is augmented in the Lagrangian function to handle discrete control variables. The derived formulation shows a simplified approach to deal with discrete control problems which is implementable in real large scale systems.

  • PDF