• 제목/요약/키워드: sequential quadratic programming

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

ON THE GLOBAL CONVERGENCE OF A MODIFIED SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM FOR NONLINEAR PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS

  • Liu, Bingzhuang
    • Journal of applied mathematics & informatics
    • /
    • 제29권5_6호
    • /
    • pp.1395-1407
    • /
    • 2011
  • When a Sequential Quadratic Programming (SQP) method is used to solve the nonlinear programming problems, one of the main difficulties is that the Quadratic Programming (QP) subproblem may be incompatible. In this paper, an SQP algorithm is given by modifying the traditional QP subproblem and applying a class of $l_{\infty}$ penalty function whose penalty parameters can be adjusted automatically. The new QP subproblem is compatible. Under the extended Mangasarian-Fromovitz constraint qualification condition and the boundedness of the iterates, the algorithm is showed to be globally convergent to a KKT point of the non-linear programming problem.

Development of Probiotic Candies with Optimal Viability by Using Response Surface Methodology and Sequential Quadratic Programming

  • Chen, Kun-Nan;Chen, Ming-Ju;Shiu, Jia-Shian
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제21권6호
    • /
    • pp.896-902
    • /
    • 2008
  • The objective of this research was to create a new probiotic candy with good flavor and healthy benefits by using the response surface method and a sequential quadratic programming technique. The endpoint was to increase the varieties of dairy products and enhance their market values. In this study, milk was mixed with yogurt cultures (Lactobacillus bulgaricus, Streptococcus thermophilus) and probiotics (L. paracasei, Bifidobacterium longum) and incubated at $37^{\circ}C$ for 20 h. The samples were blended with lyoprotectants (galactose, skim milk powder and sucrose), freeze dried and then mixed with sweeteners (lactose and xylitol) to improve the texture for forming tablets. The processing conditions were optimized in two steps: the first step constructed a surface model using response surface methodology; the second step optimized the model with a sequential quadratic programming procedure. Results indicated that skim milk inoculated with L. delbrueckii subsp. Bulgaricus, S. thermophilus, L. paracasei subsp. paracasei and B. longum and blended with 6.9% of galactose, 7.0% of sucrose and 8.0% of skim milk powder would produce a new probiotic candy with the highest viability of probiotics and good flavor. A relatively higher survival of probiotics can be achieved by placing the probiotic candy product in a glass bottle with deoxidant and desiccant at $4^{\circ}C$. These probiotic counts remained at 106-108 CFU/g after being stored for two months.

Sequential Quadratic Programming 방법을 이용한 인공중이용 플로팅 매스 트랜스듀서의 집중 모델 파라미터 추정 (Lumped Model Parameter Estimation of Floating Mass Transducers based on Sequential Quadratic Programming Method for IMEHDs)

  • 박일용
    • 재활복지공학회논문지
    • /
    • 제5권1호
    • /
    • pp.59-64
    • /
    • 2011
  • 인공 중이 (IMEHD, implantable middle ear hearing device)용 플로팅 매스 트랜스듀서는 제작 과정상에서 발생하는 구조적 오차 및 제작 결합시의 문제점들로 인해 설계 시 의도와 다른 진동 특성을 가질 수 있게 되고, 이렇게 제작된 진동 트랜스듀서는 향후 실제 환자에게 이식되었을 때의 진동체 진동 성능을 예측하기 어려운 문제점이 있다. 본 연구에서는 제작된 플로팅 매스형 트랜스듀서에 대해 설계값과의 비교 평가 및 향후 컴퓨터 모델화된 청각 중이 집중 소자 모델에 적용이 가능하도록 기 제작된 진동체의 집중 소자 모델 파라미터들을 추정할 수 있는 방법을 제안하였으며, 제안된 방법을 LabVIEW 기반의 그래픽 유저 인터페이스 소프트웨어로 구현하였다. 제안된 방법은 실제 제작된 플로팅 매스형 진동체의 진동 변위 및 위상 데이터를 이용하여 해당 진동체의 집중 모델 파라미터들을 순차적 이차 프로그래밍 (SQP, sequential quadratic programming) 방법으로 추정하는 방식이다. 구현된 방법을 이용하여 측정 데이터에 가해지는 잡음의 양에 따른 플로팅 매스형 진동 트랜스듀서의 집중 모델 파라미터 추정 시의 발생 오차 변화를 컴퓨터 시뮬레이션을 통해 조사하여 본 방법의 파라미터 추정 정확도를 확인하였다. 또한, 실제로 제작한 인공중이용 진동 트랜스듀서에 대해 측정된 진동 변위 및 위상 데이터를 이용하여 진동체의 집중 모델 파라미터들을 추정하였으며, 기존 설계값들과 비교를 통해 제안된 방법의 유용성을 평가하였다.

Sequential Quadratic Programming based Global Path Re-Planner for a Mobile Manipulator

  • Lee Soo-Yong
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권3호
    • /
    • pp.318-324
    • /
    • 2006
  • The mobile manipulator is expected to work in partially defined or unstructured environments. In our global/local approach to path planning, joint trajectories are generated for a desired Cartesian space path, designed by the global path planner. For a local path planner, inverse kinematics for a redundant system is used. Joint displacement limit for the manipulator links is considered in the motion planner. In an event of failure to obtain feasible trajectories, the task cannot be accomplished. At the point of failure, a deviation in the Cartesian space path is obtained and a replanner gives a new path that would achieve the goal position. To calculate the deviation, a nonlinear optimization problem is formulated and solved by standard Sequential Quadratic Programming (SQP) method.

Probabilistic Assessment of Total Transfer Capability Using SQP and Weather Effects

  • Kim, Kyu-Ho;Park, Jin-Wook;Rhee, Sang-Bong;Bae, Sungwoo;Song, Kyung-Bin;Cha, Junmin;Lee, Kwang Y.
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권5호
    • /
    • pp.1520-1526
    • /
    • 2014
  • This paper presents a probabilistic method to evaluate the total transfer capability (TTC) by considering the sequential quadratic programming and the uncertainty of weather conditions. After the initial TTC is calculated by sequential quadratic programming (SQP), the transient stability is checked by time simulation. Also because power systems are exposed to a variety of weather conditions the outage probability is increased due to the weather condition. The probabilistic approach is necessary to evaluate the TTC, and the Monte Carlo Simulation (MCS) is used to accomplish the probabilistic calculation of TTC by considering the various weather conditions.

AN ACTIVE SET SQP-FILTER METHOD FOR SOLVING NONLINEAR PROGRAMMING

  • Su, Ke;Yuan, Yingna;An, Hui
    • East Asian mathematical journal
    • /
    • 제28권3호
    • /
    • pp.293-303
    • /
    • 2012
  • Sequential quadratic programming (SQP) has been one of the most important methods for solving nonlinear constrained optimization problems. Recently, filter method, proposed by Fletcher and Leyffer, has been extensively applied for its promising numerical results. In this paper, we present and study an active set SQP-filter algorithm for inequality constrained optimization. The active set technique reduces the size of quadratic programming (QP) subproblem. While by the filter method, there is no penalty parameter estimate. Moreover, Maratos effect can be overcome by filter technique. Global convergence property of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper.

Optimization of the Growth Rate of Probiotics in Fermented Milk Using Genetic Algorithms and Sequential Quadratic Programming Techniques

  • Chen, Ming-Ju;Chen, Kun-Nan;Lin, Chin-Wen
    • Asian-Australasian Journal of Animal Sciences
    • /
    • 제16권6호
    • /
    • pp.894-902
    • /
    • 2003
  • Prebiotics (peptides, N-acetyglucoamine, fructo-oligosaccharides, isomalto-oligosaccharides and galactooligosaccharides) were added to skim milk in order to improve the growth rate of contained Lactobacillus acidophilus, Lactobacillus casei, Bifidobacterium longum and Bifidobacterium bifidum. The purpose of this research was to study the potential synergy between probiotics and prebiotics when present in milk, and to apply modern optimization techniques to obtain optimal design and performance for the growth rate of the probiotics using a response surface-modeling technique. To carry out response surface modeling, the regression method was performed on experimental results to build mathematical models. The models were then formulated as an objective function in an optimization problem that was consequently optimized using a genetic algorithm and sequential quadratic programming approach to obtain the maximum growth rate of the probiotics. The results showed that the quadratic models appeared to have the most accurate response surface fit. Both SQP and GA were able to identify the optimal combination of prebiotics to stimulate the growth of probiotics in milk. Comparing both methods, SQP appeared to be more efficient than GA at such a task.

병렬처리를 이용한 대규모 동적 시스템의 최적제어 (Optimal Control of Large-Scale Dynamic Systems using Parallel Processing)

  • 박기홍
    • 제어로봇시스템학회논문지
    • /
    • 제5권4호
    • /
    • pp.403-410
    • /
    • 1999
  • In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

  • PDF

헬리곱터 꼬리 날개의 최적 설계 (Optimal Design of Helicopter Tailer Boom)

  • 한석영
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
    • /
    • pp.419-424
    • /
    • 1999
  • In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

  • PDF

연계계통에서 가용송전용량 평가를 위한 최적화 알고리즘의 비교 (Comparison of Optimization Algorithms for Available Transfer Capability Assessment in Interconnected Systems)

  • 김규호;송경빈
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제55권12호
    • /
    • pp.549-554
    • /
    • 2006
  • Available transfer capability(ATC) is an important indicator of the usable amount of transmission capacity accessible by several parties for commercial trading in power transaction activities. This paper deals with an application of optimization technique for available transfer capability(ATC) calculation and analyzes the results of ATC by considering several constraints. Especially several optimization techniques are used to solve the ATC problem with state-steady security constraints. The results are compared with that of repeat power flow(RPF), sequential quadratic programming(SQP) and linear programming(LP). The proposed method is applied to 10 machines 39 buses model systems to show its effectiveness.