• 제목/요약/키워드: First-order gradient optimization

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

FIRST ORDER GRADIENT OPTIMIZATION IN LISP

  • Stanimirovic, Predrag;Rancic, Svetozar
    • Journal of applied mathematics & informatics
    • /
    • 제5권3호
    • /
    • pp.701-716
    • /
    • 1998
  • In this paper we develop algorithms in programming lan-guage SCHEME for implementation of the main first order gradient techniques for unconstrained optimization. Implementation of the de-scent techniques which use non-optimal descent steps as well as imple-mentation of the optimal descent techniques are described. Also we investigate implementation of the global problem called optimization along a line. Developed programs are effective and simpler with re-spect to the corresponding in the procedural programming languages. Several numerical examples are reported.

Gradient Optimized Gradient-Echo Gradient Moment Nulling Sequences for Flow Compensation of Brain Images

  • Jahng, Geon-Ho;Stephen Pickup
    • Investigative Magnetic Resonance Imaging
    • /
    • 제4권1호
    • /
    • pp.20-26
    • /
    • 2000
  • Gradient moment nulling techniques require the introduction of an additional gradient on each axis for each order of motion correction to be applied. The additional gradients introduce new constraints on the sequence design and increase the demands on the gradient system. The purpose of this paper is to demonstrate techniques for optimization of gradient echo gradient moment nulling sequences within the constraints of the gradient hardware. Flow compensated pulse sequences were designed and implemented on a clinical magnetic resonance imaging system. The design of the gradient moment nulling sequences requires the solution of a linear system of equations. A Mathematica package was developed that interactively solves the gradient moment nulling problem. The package allows the physicist to specify the desired order of motion compensation and the duration of the gradients in the sequence with different gradient envelopes. The gradient echo sequences with first, second, and third order motion compensation were implemented with minimum echo time. The sequences were optimized to take full advantage of the capabilities of the gradient hardware. The sequences were used to generate images of phantoms and human brains. The optimized sequences were found to have better motion compensation than comparable standard sequences.

  • PDF

최적화기법을 이용한 익형의 역설계 (Inverse Design For a Airfoil Using Optimizing Method)

  • 김종섭;박원규
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1997년도 추계 학술대회논문집
    • /
    • pp.126-130
    • /
    • 1997
  • A new and efficient method is presented for design optimization, which is based on a computational fluid dynamics (CFD). The method is applied to design an airfoil configuration. The Navier-Stokes equations are solved for the viscous analysis of the flow, which provides the object function. The CFD analysis is then coupled with the optimization procedure that used a conjugate gradient method. During the one-dimensional search of the optimization procedure, an approximate flow analysis based on a first-order Taylor series expansion is used to reduce the computational cost, (This study is supported by Korean Ministry of Education through Research Fund)

  • PDF

Fraud Detection in E-Commerce

  • Alqethami, Sara;Almutanni, Badriah;AlGhamdi, Manal
    • International Journal of Computer Science & Network Security
    • /
    • 제21권6호
    • /
    • pp.200-206
    • /
    • 2021
  • Fraud in e-commerce transaction increased in the last decade especially with the increasing number of online stores and the lockdown that forced more people to pay for services and groceries online using their credit card. Several machine learning methods were proposed to detect fraudulent transaction. Neural networks showed promising results, but it has some few drawbacks that can be overcome using optimization methods. There are two categories of learning optimization methods, first-order methods which utilizes gradient information to construct the next training iteration whereas, and second-order methods which derivatives use Hessian to calculate the iteration based on the optimization trajectory. There also some training refinements procedures that aims to potentially enhance the original accuracy while possibly reduce the model size. This paper investigate the performance of several NN models in detecting fraud in e-commerce transaction. The backpropagation model which is classified as first learning algorithm achieved the best accuracy 96% among all the models.

HS 최적화 알고리즘을 이용한 계단응답과 연속시스템 인식 (Identification of Continuous System from Step Response using HS Optimization Algorithm)

  • 이태봉;손진근
    • 전기학회논문지P
    • /
    • 제65권4호
    • /
    • pp.292-297
    • /
    • 2016
  • The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

HS 알고리즘을 이용한 계단응답으로부터 FOPDT 모델 인식 (Identification of First-order Plus Dead Time Model from Step Response Using HS Algorithm)

  • 이태봉
    • 한국항행학회논문지
    • /
    • 제19권6호
    • /
    • pp.636-642
    • /
    • 2015
  • 본 논문에서는 계단응답으로부터 시 지연을 갖는 선형 연속시스템을 식별하기 위해 HS 최적화 알고리즘을 적용에 관하여 연구하였다. 인식 모델은 1차 시 지연 모델 (FOPDT)로써, FOPDT은 많은 화학 공정과 HAVC 공정에 실효성이 있으며 PID 튜닝에도 적합하다. 최근에 개발된 HS 알고리즘은 완벽한 하모니를 찾아가는 음악적 과정을 개념화 한 것이다. 수학을 기반으로 하는 전통적 기법과 달리 HS는 확률적인 방법을 사용하므로 미분과 같은 수학적 접근을 필요로 하지 않는다. 제시된 인식 방법의 효과를 입증하기 위해 많은 수치 예를 수행하여 결과를 제시하였다.

Recovering Incomplete Data using Tucker Model for Tensor with Low-n-rank

  • Thieu, Thao Nguyen;Yang, Hyung-Jeong;Vu, Tien Duong;Kim, Sun-Hee
    • International Journal of Contents
    • /
    • 제12권3호
    • /
    • pp.22-28
    • /
    • 2016
  • Tensor with missing or incomplete values is a ubiquitous problem in various fields such as biomedical signal processing, image processing, and social network analysis. In this paper, we considered how to reconstruct a dataset with missing values by using tensor form which is called tensor completion process. We applied Tucker factorization to solve tensor completion which was built base on optimization problem. We formulated the optimization objective function using components of Tucker model after decomposing. The weighted least square matric contained only known values of the tensor with low rank in its modes. A first order optimization method, namely Nonlinear Conjugated Gradient, was applied to solve the optimization problem. We demonstrated the effectiveness of the proposed method in EEG signals with about 70% missing entries compared to other algorithms. The relative error was proposed to compare the difference between original tensor and the process output.

확률조건의 근사화를 통한 효율적인 강건 최적설계 기법의 개발 (Development of an Efficient Optimization Technique for Robust Design by Approximating Probability Constratints)

  • 정도현;이병채
    • 대한기계학회논문집A
    • /
    • 제24권12호
    • /
    • pp.3053-3060
    • /
    • 2000
  • Alternative formulation is presented for robust optimization problems and an efficient computational scheme for reliability estimation is proposed. Both design variables and design parameters considered as random variables about their nominal values. To ensure the robustness of objective performance a new cost function bounding the performance and a new constraint limiting the performance variation are introduced. The constraint variations are regulated by considering the probability of feasibility. Each probability constraint is transformed into a sub-optimization problem and then is resolved with the modified advanced first order second moment(AFOSM) method for computational efficiency. The proposed robust optimization method has advantages that the mean value and the variation of the performance function are controlled simultaneously and the second order sensitivity information is not required even in case of gradient based optimization. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

A fast and robust procedure for optimal detail design of continuous RC beams

  • Bolideh, Ameneh;Arab, Hamed Ghohani;Ghasemi, Mohammad Reza
    • Computers and Concrete
    • /
    • 제24권4호
    • /
    • pp.313-327
    • /
    • 2019
  • The purpose of the present study is to present a new approach to designing and selecting the details of multidimensional continuous RC beam by applying all strength, serviceability, ductility and other constraints based on ACI318-14 using Teaching Learning Based Optimization (TLBO) algorithm. The optimum reinforcement detailing of longitudinal bars is done in two steps. in the first stage, only the dimensions of the beam in each span are considered as the variables of the optimization algorithm. in the second stage, the optimal design of the longitudinal bars of the beam is made according to the first step inputs. In the optimum shear reinforcement, using gradient-based methods, the most optimal possible mode is selected based on the existing assumptions. The objective function in this study is a cost function that includes the cost of concrete, formwork and reinforcing steel bars. The steel used in the objective function is the sum of longitudinal and shear bars. The use of a catalog list consisting of all existing patterns of longitudinal bars based on the minimum rules of the regulation in the second stage, leads to a sharp reduction in the volume of calculations and the achievement of the best solution. Three example with varying degrees of complexity, have been selected in order to investigate the optimal design of the longitudinal and shear reinforcement of continuous beam.

원심압축기 최적 임펠러 형상설계에 관한 연구 (A Study on the Design Method to Optimize an Impeller of Centrifugal Compressor)

  • 조수용;이영덕;안국영;김영철
    • 한국유체기계학회 논문집
    • /
    • 제16권1호
    • /
    • pp.11-16
    • /
    • 2013
  • A numerical study was conducted to improve the performance of an impeller of centrifugal compressor. Nine design variables were chosen with constraints. Only meridional contours and blade profile were adjusted. ANN (Artificial Neural Net) was adopted as a main optimization algorithm with PSO (Particle Swarm Optimization) in order to reduce the optimization time. At first, ANN was learned and trained with the design variable sets which were obtained using DOE (Design of Experiment). This ANN was continuously improved its accuracy for each generation of which population was one hundred. New design variable set in each generation was selected using a non-gradient based method of PSO in order to obtain the global optimized result. After $7^{th}$ generation, the prediction difference of efficiency and pressure ratio between ANN and CFD was less than 0.6%. From more than 1,200 design variable sets, a pareto of efficiency versus pressure ratio was obtained and an optimized result was selected based on the multi-objective function. On this optimized impeller, the efficiency and pressure ratio were improved by 1% and 9.3%, respectively.