• Title/Summary/Keyword: Approximated optimization problem

Search Result 42, Processing Time 0.025 seconds

Whole learning algorithm of the neural network for modeling nonlinear and dynamic behavior of RC members

  • Satoh, Kayo;Yoshikawa, Nobuhiro;Nakano, Yoshiaki;Yang, Won-Jik
    • Structural Engineering and Mechanics
    • /
    • v.12 no.5
    • /
    • pp.527-540
    • /
    • 2001
  • A new sort of learning algorithm named whole learning algorithm is proposed to simulate the nonlinear and dynamic behavior of RC members for the estimation of structural integrity. A mathematical technique to solve the multi-objective optimization problem is applied for the learning of the feedforward neural network, which is formulated so as to minimize the Euclidean norm of the error vector defined as the difference between the outputs and the target values for all the learning data sets. The change of the outputs is approximated in the first-order with respect to the amount of weight modification of the network. The governing equation for weight modification to make the error vector null is constituted with the consideration of the approximated outputs for all the learning data sets. The solution is neatly determined by means of the Moore-Penrose generalized inverse after summarization of the governing equation into the linear simultaneous equations with a rectangular matrix of coefficients. The learning efficiency of the proposed algorithm from the viewpoint of computational cost is verified in three types of problems to learn the truth table for exclusive or, the stress-strain relationship described by the Ramberg-Osgood model and the nonlinear and dynamic behavior of RC members observed under an earthquake.

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

  • Li, Jianpo;Wang, Qiwei
    • Journal of Information Processing Systems
    • /
    • v.17 no.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.

Approximate Shape Optimization Technique by Sequential Design Domain (순차설계영역을 이용한 근사 형상최적에 관한 연구)

  • 김우현;임오강
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.17 no.1
    • /
    • pp.31-38
    • /
    • 2004
  • Mechanical design process is generally accomplished by design, analysis, and test. Designers use programs fitting purpose, and obtain repeatedly a response of a simulation program, a sub-program for optimization. In this paper, shape optimization using approximate optimization technique is carried out with sequential design domain(SDD). In addition, algorithm executing Pro/Engineer and ANSYS automatically are adopted in the approximate optimization program by SDD. It is difficult for design problem to be approximated accurately for the whole range of design space. However, more or less accurate approximation is constructed if SDD is applied to that case. SDD starts with a certain range which is off-seted from midpoint of an initial design domain and then SDD of the next step is determined by a move limited. Convergence criterion is defined such that optimal point must be located within SDD during the two steps. Also, the PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information and the active set strategy, in order to seek the direction of design variables.

Minimum-Time Guidance and Control Law for High Maneuvering Missile

  • Yamaoka, Seiji
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.10 no.1
    • /
    • pp.46-58
    • /
    • 2009
  • This paper deals with design procedure of online guidance and control law for future missiles that requires agile maneuverability. For the purpose, the missile with high powered side thruster is proposed. The guidance and control law for such missiles is discussed from a point of view of optimal control theory in this paper. Minimum time problem is solved for the approximated system. It is derived that bang- bang control is optimal input from the necessary conditions of optimal solution. Feedback guidance without iterative calculation is useful for actual systems. In this paper. multiple design point method is applied to design feedback gains and feed forward inputs of the guidance and control law. The numerical results show that the proposed guidance and control law has a high -performance for wide-ranging boundary conditions.

Robust Optimal Design Method Using Two-Point Diagonal Quadratic Approximation and Statistical Constraints (이점 대각 이차 근사화 기법과 통계적 제한조건을 적용한 강건 최적설계 기법)

  • Kwon, Yong-Sam;Kim, Min-Soo;Kim, Jong-Rip;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.12
    • /
    • pp.2483-2491
    • /
    • 2002
  • This study presents an efficient method for robust optimal design. In order to avoid the excessive evaluations of the exact performance functions, two-point diagonal quadratic approximation method is employed for approximating them during optimization process. This approximation method is one of the two point approximation methods. Therefore, the second order sensitivity information of the approximated performance functions are calculated by an analytical method. As a result, this enables one to avoid the expensive evaluations of the exact $2^{nd}$ derivatives of the performance functions unlike the conventional robust optimal design methods based on the gradient information. Finally, in order to show the numerical performance of the proposed method, one mathematical problem and two mechanical design problems are solved and their results are compared with those of the conventional methods.

SWCL Extension for Knowledge Representation of Piecewise linear Constraints on the Semantic Web (시맨틱 웹 환경에서의 부분선형 제약지식표현을 위한 SWCL의 확장)

  • Lee, Myungjin;Kim, Wooju;Kim, Hak-Jin
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.4
    • /
    • pp.19-35
    • /
    • 2012
  • The Semantic Web technology, purporting to share, to reuse and to process by machines data stored in the Web environment, incessantly evolves to help human decision making; in particular, decision making based on data, or quantitative decision making. This trend drives researchers to fill the gap with strenuous efforts between the current state of the technology and the terminus of this evolution. The Semantic Web Constraint Language (SWCL) together with SWRL is one of these endeavors to achieve the goal. This paper focuses particularly on how to express the piecewise linear form in the context of SWCL. The importance of this ingredient can be fortified by the fact that any nonlinear expression can be approximated in the piecewise linear form. This paper will also provide the information of how it will work in the decision making process through an example of the Internet shopping mall problem.

Adaptive Signal Separation with Maximum Likelihood

  • Zhao, Yongjian;Jiang, Bin
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.145-154
    • /
    • 2020
  • Maximum likelihood (ML) is the best estimator asymptotically as the number of training samples approaches infinity. This paper deduces an adaptive algorithm for blind signal processing problem based on gradient optimization criterion. A parametric density model is introduced through a parameterized generalized distribution family in ML framework. After specifying a limited number of parameters, the density of specific original signal can be approximated automatically by the constructed density function. Consequently, signal separation can be conducted without any prior information about the probability density of the desired original signal. Simulations on classical biomedical signals confirm the performance of the deduced technique.

Optimal LNG Procurement Policy in a Spot Market Using Dynamic Programming (동적 계획법을 이용한 LNG 현물시장에서의 포트폴리오 구성방법)

  • Ryu, Jong-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.3
    • /
    • pp.259-266
    • /
    • 2015
  • Among many energy resources, natural gas has recently received a remarkable amount of attention, particularly from the electrical generation industry. This is in part due to increasing shale gas production, providing an environment-friendly fossil fuel, and high risk of nuclear power. Because South Korea, the world's second largest LNG importing nation after Japan, has no international natural gas pipelines and relies on imports in the form of LNG, the natural gas has been traditionally procured by long term LNG contracts at relatively high price. Thus, there is a need of developing an Asian LNG trading hub, where LNG can be traded at more competitive spot prices. In a natural gas spot market, the amount of natural gas to be bought should be carefully determined considering a limited storage capacity and future pricing dynamics. In this work, the problem to find the optimal amount of natural gas in a spot market is formulated as a Markov decision process (MDP) in risk neutral environment and the optimal base stock policy which depends on a stage and price is established. Taking into account price and demand uncertainties, the basestock target levels are simply approximated from dynamic programming. The simulation results show that the basestock policy can be one of effective ways for procurement of LNG in a spot market.

Approximate Multi-Objective Optimization of Scroll Compressor Lower Frame Considering the Axial Load (축하중을 고려한 스크롤 압축기 하부 프레임의 최적설계)

  • Kim, JungHwan;Lee, Jongsoo
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.3
    • /
    • pp.308-313
    • /
    • 2015
  • In this research, a multi-objective optimal design of a scroll compressor lower frame was approximated, and the design parameters of the lower frame were selected. The sensitivity of the design parameters was induced through a parameter analysis, and the thickness was determined to be the most sensitive parameter to stress and deflection. All of the design parameters regarding the mass are sensitive factors. It was formulated for the problem about stress and deflection to be caused by the axial load. The sensitivity of the design variables was determined using an orthogonal array for the parameter analysis. Using the central composite and D-optimal designs, a second polynomial approximation of the objective and constraint functions was formulated and the accuracy was verified through an R-square. These functions were applied to the optimal design program (NSGA-II). Through a CAE analysis, the effectiveness of the central composite and D-optimal designs was determined.

Centroidal Voronoi Tessellation-Based Reduced-Order Modeling of Navier-Stokes Equations

  • 이형천
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.1-1
    • /
    • 2003
  • In this talk, a reduced-order modeling methodology based on centroidal Voronoi tessellations (CVT's)is introduced. CVT's are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. The discrete data sets, CVT's are closely related to the h-means clustering techniques. Even with the use of good mesh generators, discretization schemes, and solution algorithms, the computational simulation of complex, turbulent, or chaotic systems still remains a formidable endeavor. For example, typical finite element codes may require many thousands of degrees of freedom for the accurate simulation of fluid flows. The situation is even worse for optimization problems for which multiple solutions of the complex state system are usually required or in feedback control problems for which real-time solutions of the complex state system are needed. There hava been many studies devoted to the development, testing, and use of reduced-order models for complex systems such as unsteady fluid flows. The types of reduced-ordered models that we study are those attempt to determine accurate approximate solutions of a complex system using very few degrees of freedom. To do so, such models have to use basis functions that are in some way intimately connected to the problem being approximated. Once a very low-dimensional reduced basis has been determined, one can employ it to solve the complex system by applying, e.g., a Galerkin method. In general, reduced bases are globally supported so that the discrete systems are dense; however, if the reduced basis is of very low dimension, one does not care about the lack of sparsity in the discrete system. A discussion of reduced-ordering modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples and is also shown to be inexpensive to apply compared to other reduced-order methods.

  • PDF