article · PeerJ Computer Science
A modified conjugate gradient algorithm has been developed to improve unconstrained optimisation performance in computational tasks. The approach introduces an adjusted conjugate gradient coefficient that remains integrated into the search direction, ensuring the descent property is maintained under appropriate line search conditions. Global convergence is established under strong Wolfe line search conditions assuming Lipschitz continuity. In computational evaluations across diverse test problems, the algorithm demonstrated superior performance. Practical assessments confirmed its capability to restore corrupted images with high precision, alongside effectively handling motion control tasks within a three-degree-of-freedom robotic arm model. These experimental findings indicate that the mathematical technique addresses critical computational bottlenecks in both digital image processing and automated robotics.
Many engineering challenges, from clarifying degraded visual data to guiding robotic machinery, depend on solving complex mathematical equations rapidly and reliably. By guaranteeing mathematical convergence and maintaining stable descent, this improved optimisation method helps computational systems process digital imagery accurately and control physical robotic movements with greater operational stability.
The algorithm targets applications in digital image restoration and robotic motion control. Potential end users include developers of image enhancement software and engineers building control systems for multi-joint robotic arms. Because the work is demonstrated through computational experiments on test problems and a three-degree-of-freedom arm model, it represents applied and tested research requiring integration into commercial software pipelines before market adoption.
AI-generated from the published abstract. Always read the original work before citing.
This study presents a novel gradient-based algorithm designed to enhance the performance of optimization models, particularly in computer science applications such as image restoration and robotic motion control. The proposed algorithm introduces a modified conjugate gradient (CG) method, ensuring the CG coefficient, β κ, remains integral to the search direction, thereby maintaining the descent property under appropriate line search conditions. Leveraging the strong Wolfe conditions and assuming Lipschitz continuity, we establish the global convergence of the algorithm. Computational experiments demonstrate the algorithm's superior performance across a range of test problems, including its ability to restore corrupted images with high precision and effectively manage motion control in a 3DOF robotic arm model. These results underscore the algorithm's potential in addressing key challenges in image processing and robotics.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.7717/peerj-cs.2783
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
