• Title/Summary/Keyword: approximate optimal solutions

검색결과 50건 처리시간 0.021초

PROXIMAL AUGMENTED LAGRANGIAN AND APPROXIMATE OPTIMAL SOLUTIONS IN NONLINEAR PROGRAMMING

  • Chen, Zhe;Huang, Hai Qiao;Zhao, Ke Quan
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.149-159
    • /
    • 2009
  • In this paper, we introduce some approximate optimal solutions and an augmented Lagrangian function in nonlinear programming, establish dual function and dual problem based on the augmented Lagrangian function, discuss the relationship between the approximate optimal solutions of augmented Lagrangian problem and that of primal problem, obtain approximate KKT necessary optimality condition of the augmented Lagrangian problem, prove that the approximate stationary points of augmented Lagrangian problem converge to that of the original problem. Our results improve and generalize some known results.

  • PDF

NEW ANALYTIC APPROXIMATE SOLUTIONS TO THE GENERALIZED REGULARIZED LONG WAVE EQUATIONS

  • Bildik, Necdet;Deniz, Sinan
    • 대한수학회보
    • /
    • 제55권3호
    • /
    • pp.749-762
    • /
    • 2018
  • In this paper, the new optimal perturbation iteration method has been applied to solve the generalized regularized long wave equation. Comparing the new analytic approximate solutions with the known exact solutions reveals that the proposed technique is extremely accurate and effective in solving nonlinear wave equations. We also show that,unlike many other methods in literature, this method converges rapidly to exact solutions at lower order of approximations.

AN APPROXIMATE ALTERNATING LINEARIZATION DECOMPOSITION METHOD

  • Li, Dan;Pang, Li-Ping;Xia, Zun-Quan
    • Journal of applied mathematics & informatics
    • /
    • 제28권5_6호
    • /
    • pp.1249-1262
    • /
    • 2010
  • An approximate alternating linearization decomposition method, for minimizing the sum of two convex functions with some separable structures, is presented in this paper. It can be viewed as an extension of the method with exact solutions proposed by Kiwiel, Rosa and Ruszczynski(1999). In this paper we use inexact optimal solutions instead of the exact ones that are not easily computed to construct the linear models and get the inexact solutions of both subproblems, and also we prove that the inexact optimal solution tends to proximal point, i.e., the inexact optimal solution tends to optimal solution.

자동차용 휠의 응력을 고려한 근사 최적 설계 (Approximate Optimization Design Considering Automotive Wheel Stress)

  • 이현석;이종수
    • 한국생산제조학회지
    • /
    • 제24권3호
    • /
    • pp.302-307
    • /
    • 2015
  • The automobile is an important means of transportation. For this reason, the automotive wheel is also an important component in the automotive industry because it acts as a load support and is closely related to safety. Thus, the wheel design is a very important safety aspect. In this paper, an optimal design for minimizing automotive wheel stress and increasing wheel safety is described. To study the optimal design, a central composite design (CCD) and D-optimal design theory are applied, and the approximate function using the response surface method (RSM) is generated. The optimal solutions using the non-dominant sorting genetic algorithm (NSGA-II) are then derived. Comparing CCD and D-optimal solution accuracy and verified the CCD can deduce more accuracy optimal solutions.

기지국 위치 문제를 위한 목적함수의 최적해 및 근사해 (Optimal and Approximate Solutions of Object Functions for Base Station Location Problem)

  • 손석원
    • 정보처리학회논문지C
    • /
    • 제14C권2호
    • /
    • pp.179-184
    • /
    • 2007
  • 이동 통신 시스템의 설계에 있어서 기지국의 위치를 선정하는 문제는 기본적으로 셀 내부 및 외부의 간접전파에 의한 최소 SIR을 만족하면서 최대한의 사용자를 최소의 기지국에 할당하는 문제로서 NP-hard 이다. 기존에 주로 사용된 목적함수는 창고위치문제에서 사용하던 것으로 CDMA 이동통신 시스템으로 직접 이용하는 단계에서 문제점이 발생한다. 그 문제점들을 해결하는 목적함수와 최적해 및 근사해를 구하는 알고리즘을 제안하고, 그에 따른 시뮬레이션을 하여 본 논문의 제안이 타당성이 있는지 평가 및 분석하였다. 본 논문에서는 기지국의 위치문제를 경험적 탐색방법을 사용하지 않고 혼합정수계획법의 완전해를 이용하여 최적해 및 근사해를 구하였다.

GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem

  • 최명길;응우엔만탕;황원주
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제17권3호
    • /
    • pp.39-58
    • /
    • 2008
  • Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

가압경수로용 환형 핵연료의 간극 크기 다중목적 근사최적설계 (Approximate Multi-Objective Optimization of Gap Size of PWR Annular Nuclear Fuels)

  • 도재혁;권영두;이종수
    • 한국정밀공학회지
    • /
    • 제32권9호
    • /
    • pp.815-824
    • /
    • 2015
  • In this study, we conducted the approximate multi-objective optimization of gap sizes of pressurized-water reactor (PWR) annular fuels. To determine the contacting tendency of the inner-outer gaps between the annular fuel pellets and cladding, thermoelastic-plastic-creep (TEPC)analysis of PWR annular fuels was performed, using in-house FE code. For the efficient heat transfer at certain levels of stress, we investigated the tensile, compressive hoop stress and temperature, and optimized the gap sizes using the non-dominant sorting genetic algorithm (NSGA-II). For this, response surface models of objective and constraint functions were generated, using central composite (CCD) and D-optimal design. The accuracy of approximate models was evaluated through $R^2$ value. The obtained optimal solutions by NSGA-II were verified through the TEPC analysis, and we compared the obtained optimum solutions and generated errors from the CCD and D-optimal design. We observed that optimum solutions differ, according to design of experiments (DOE) method.

구속조건의 가용성을 보장하는 신경망기반 근사최적설계 (BPN Based Approximate Optimization for Constraint Feasibility)

  • 이종수;정희석;곽노성
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2007년도 정기 학술대회 논문집
    • /
    • pp.141-144
    • /
    • 2007
  • Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

  • PDF

A Validation Method for Solution of Nonlinear Differential Equations: Construction of Exact Solutions Neighboring Approximate Solutions

  • Lee, Sang-Chul
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제3권2호
    • /
    • pp.46-58
    • /
    • 2002
  • An inverse method is introduced to construct benchmark problems for the numerical solution of initial value problems. Benchmark problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The solution is constructed such that it lies near a given approximate numerical solution, and therefore the special case solution can be generated in a versatile and physically meaningful fashion and can serve as a benchmark problem to validate approximate solution methods. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. A multi-variable orthogonal function expansion method and computer symbol manipulation are successfully used for this process. Using this special case exact solution, it is possible to directly investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given code and a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution. Illustrative examples show the utility of this method not only for the ordinary differential equations (ODEs) but for the partial differential equations (PDEs).

순차적 근사최적화 기법을 이용한 방열판 최적설계 (Optimal Design of a Heat Sink using the Sequential Approximate Optimization Algorithm)

  • 박경우;최동훈
    • 설비공학논문집
    • /
    • 제16권12호
    • /
    • pp.1156-1166
    • /
    • 2004
  • The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).