id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-2411	G. Vanaja	Comparison Between Cauchy's Steepest Descent and Fletcher-Reeves Methods in Solving Unconstrained Neutrosophic Nonlinear Programming Problems	2024	20	.pdf	application/pdf	8764	393	64	4.1 Neutrosophic Cauchy’s Steepest Descent Method Consider an unconstrained minimization problem min𝑓𝒩(�̃�1, �̃�2, … , �̃�𝔫). As a result, the iterative approach consists of, �̃�𝜅+1 = �̃�𝜅 + (�̃�𝜅�̃�(�̃�𝜅))𝒩 (2) where as �̃�𝜅 is the current estimate of �̃�∗, (�̃�κ)𝒩 = (�̃�(�̃�𝜅))𝒩 is the search direction and 𝛼(κ) is the step length parameter in the space ℛ𝒩 of design variables.	cache/cana-2411.pdf	txt/cana-2411.txt