Results 141 to 150 of about 19,953 (297)
A new Suggested Conjugate Gradient Algorithm with Logistic Mapping
In this paper, we will use logistic mapping to find new conjugate gradient coefficients for unconstrained optimization.
Dlovan H. Omar
doaj
A modified nonmonotone BFGS algorithm for unconstrained optimization. [PDF]
Li X, Wang B, Hu W.
europepmc +1 more source
Microsimulation models are increasingly used in the evaluation of cancer screening. Latent parameters of such models can be estimated by optimization of the goodness-of-fit.
Neddermeijer, H.G. +4 more
core
New Numerical Algorithms for Unconstrained Optimization Problems [PDF]
107-116Two new algorithms namely, Circle approach algorithm and Circle-tangent approach algorithm are proposed for unconstrained optimization problems.
Pandian, P, Karthikeyan, K
core
Can hydrophobic, shape‐selective zeolites efficiently remove the persistent pharmaceutical CBZ from water? This work moves beyond the static picture of interaction energies by modeling diffusion with umbrella sampling and machine‐learned potentials. Even high intrinsic diffusion barriers can be overcome through exergonic adsorption from water, yielding
Jakob Brauer +4 more
wiley +1 more source
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations. [PDF]
Yuan G, Hu W.
europepmc +1 more source
A contribution to theory and practice of nonlinear parameter optimization
Nonlinear parameter optimization in least squares was studied from a point of view of differential geometry. Properties of curvilinear coordinates, scale factors and curvature were investigated.
Stol, P.T.
core
This study shows that integrating multiple machine learning models with optimization and decision‐making improves chemical process design, and that a consensus‐based strategy across models provides more robust and reliable operating recommendations than any single model, especially under limited or noisy data conditions.
Farough Agin +2 more
wiley +1 more source
This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of ...
Brekelmans, R.C.M. +4 more
core
This lecture note is intended for use in the course 04212 Optimization and Data Fitting at the Technincal University of Denmark. It covers about 25% of the curriculum. Hopefully, the note may be useful also to interested persons not participating in that
Poul Erik Frandsen +7 more
core

