Results 91 to 100 of about 4,217,963 (196)

New CG-Based Algorithms With Second-Order Curvature Information for NLS Problems and a 4DOF Arm Robot Model

IEEE Access
This article develops two new algorithms of three-term conjugate gradient (TTCG) coefficients to handle nonlinear least-squares (NLS) problems using the structured secant equation.
Rabiu Bashir Yunus, Nooraini Zainuddin, Hanita Daud, Ramani Kannan, Mahmoud Muhammad Yahaya, Samsul Ariffin Abdul Karim   +5 more
doaj   +1 more source

Logarithmic Connections on Principal Bundles and Their Applications to Geometric Control Theory

Axioms
In this research, we establish a precise correspondence between the theory of logarithmic connections on principal G-bundles over compact Riemann surfaces and the geometric formulation of control systems on curved manifolds, providing a novel ...
Álvaro Antón-Sancho
doaj   +1 more source

Development of a Spectral Conjugate Gradient Method for Solving Optimization Problems

Al-Rafidain Journal of Computer Sciences and Mathematics
Conjugate gradient methods have been favored to use for their efficiency in solving large-scale unconstrained optimization problems, primarily because of their low memory requirements and exclusive to use the first-order derivative information.
Kamal Jameel Murad, Salah Gazi Shareef
doaj   +1 more source

Generalized Bayesian Additive Regression Trees Models: Beyond Conditional Conjugacy

Journal of the American Statistical Association
Bayesian additive regression trees have seen increased interest in recent years due to their ability to combine machine learning techniques with principled uncertainty quantification. The Bayesian backfitting algorithm used to fit BART models, however, limits their application to a small class of models for which conditional conjugacy exists.
openaire   +2 more sources

New Necessary Conditions for the Existence of Difference Sets without Self-Conjugacy

Journal of Combinatorial Theory, Series A, 2002
The author generalizes a lemma of Arasu and Ma and applies this to obtain some necessary existence conditions for difference sets which avoid the strong technical assumption of self-conjugacy. In particular, he verifies Lander's conjecture (saying that the Sylow \(p\)-subgroup of the underlying group \(G\) cannot be cyclic if \(G\) is abelian and \(p\)
openaire   +2 more sources

Two-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained Optimization [PDF]

American Journal of Economics and Business Administration, 2009
Problem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale op timization problems, because it did not need the storage of any matrix. The purpose of this construc tion was to find new CG-algorithms suitable for solving large scale optimization problems.
openaire   +1 more source

THE CLGREEN INDEX IN MONITORING THE CONDITION OF PEA CROPS

PROBLEMS OF SOIL FERTILITY IN MODERN AGRICULTURE
It was revealed that the ClGreen index on pea crops takes the highest values during the flowering period – the beginning of fruit formation. An average negative correlation is determined with the resistance to lodging during the flowering period – the ...
E. Kozhuhova, I. Botvich, D. Emel’yanov, V. Novikov   +3 more
semanticscholar   +1 more source

Arithmetical Conditions on the Length of the Conjugacy Classes of a Finite Group

Journal of Algebra, 1995
In this paper groups are finite. First, using new tools, another proof of Theorem 2 of \textit{E. A. Bertram, M. Herzog} and \textit{A. Mann} [Bull. Lond. Math. Soc. 22, No. 6, 569-575 (1990; Zbl 0743.20017)] is given (Theorem 4). Definitions: If \(G\) is a group, then \(\rho' (G)\) is the set of all primes dividing the cardinality of some conjugacy ...
openaire   +3 more sources

Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method

, 2023
The conjugate gradient (CG) method is widely used for solving nonlinear unconstrained optimization problems because it requires less memory to implement. In this paper, we propose a new parameter of the Dai Liao conjugacy condition of the CG method with the restart property, which depends on the Lipschitz constant and is related to the Hestenes Stiefel
openaire   +2 more sources

Different Types of Three-Term CG-Methods with Sufficient Descent and Conjugacy Conditions

Journal of Zankoy Sulaimani - Part A, 2014
It is very important to generate a descent search direction independent of line searches in showing the global convergence of conjugate gradient methods. Recently, Zhang et al. proposed a three-term of PR method (TTPR) and HS method (TTHS), both of which can produce sufficient descent condition.
Abbas Al-Bayati, Hawraz Al-Khayat
openaire   +1 more source