METODE NUMERIK STEPEST DESCENT TERINDUKSI NEWTON DALAM PEMECAHAN MASALAH OPTIMISASI TANPA KENDALA
Abstract
Abstrak
Penelitian teoritis ini mengkaji mengenai metode numerik Stepest Descent yang terinduksi Newton. Penelitian ini dilakukan dengan cara memahami terlebih dahulu mengenai metode numerik Stepest Descent dan Newton, kemudian mengkonstruksi metode baru yang disebut dengan Stepest Descent terinduksi Newton. Pada makalah ini turut disertakan pula contoh perhitungan numerik antara ketiga metode tersebut beserta analisis perhitungannya.
Abstract
This research is investigating numerical method of Steepest Descent inducted of Newton. Steps of this research can be described as follows: First, the author has to understand the definition and algorithm of Steepest Descent and Newton methods. After that, the second, author constructing the new method called by Steepest Descent inducted newton. In this paper, author also containing examples of numerical counting among that three methods and analyze them self.
Keywords
Full Text:
PDFReferences
Rinaldi Munir, Metode numeric,
Bandung: Informatika, 2008.
Salmah. Diktat Optimisasi.
Yogyakarya: FMIPA UGM, 2011.
Howard Anton, Aljabar Linier,
Penerjemah Pantur Silaban, Jakarta:
Erlangga, 1991.
Edwin K. P. Chong, An Introduction
to Optimization, USA: John Wiley &
Sons, Inc. 2001.
S. Bazaraa. Mochtar, Nonlinear
Programming Theory and
Algorithms, London: Willey
Interscience, 2006.
Yoshikazu Sawaragi, Theory of
multiobjective optimization, London:
Academic Press Inc. 1985.
Rukmono Budi Utomo, (2016, Mei),
Materi Ajar Metode Numerik FKIP
UMT,
http://www.fkip.umt.ac.id/download
s.
DOI: https://doi.org/10.31980/mosharafa.v5i3.274
Refbacks
- There are currently no refbacks.
Copyright (c) 2016 Mosharafa: Jurnal Pendidikan Matematika
Indexed by:

Mosharafa: Jurnal Pendidikan Matematika is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
View My Stats