Academic literature on the topic 'Three-term conjugate gradient'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Three-term conjugate gradient.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Three-term conjugate gradient"

1

Ibrahim, Yahya Ismail, and Hisham Mohammed Khudhur. "Modified three-term conjugate gradient algorithm and its applications in image restoration." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 3 (2022): 1510–17. https://doi.org/10.11591/ijeecs.v28.i3.pp1510-1517.

Full text
Abstract:
In image restoration, the goal is often to bring back a high-quality version of an image from a lower-quality copy of it. In this article, we will investigate one kind of recovery issue, namely recovering photos that have been blurred by noise in digital photographs (sometimes known as "salt and pepper" noise). When subjected to noise at varying frequencies and intensities (30,50,70,90). In this paper, we used the conjugate gradient algorithm to Restorative images and remove noise from them, we developed the conjugate gradient algorithm with three limits using the conjugate condition
APA, Harvard, Vancouver, ISO, and other styles
2

Ahmed, Alaa Saad, Hisham M. Khudhur, and Mohammed S. Najmuldeen. "A new parameter in three-term conjugate gradient algorithms for unconstrained optimization." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 1 (2021): 338–44. https://doi.org/10.11591/ijeecs.v23.i1.pp338-344.

Full text
Abstract:
In this study, we develop a different parameter of three term conjugate gradient kind, this scheme depends principally on pure conjugacy condition (PCC), Whereas, the conjugacy condition (PCC) is an important condition in unconstrained non-linear optimization in general and in conjugate gradient methods in particular. The proposed method becomes converged, and satisfy conditions descent property by assuming some hypothesis, The numerical results display the effectiveness of the new method for solving test unconstrained non-linear optimization problems compared to other conjugate gradient algor
APA, Harvard, Vancouver, ISO, and other styles
3

Ahmed, Alaa Saad, Hisham M. Khudhur, and Mohammed S. Najmuldeen. "A new parameter in three-term conjugate gradient algorithms for unconstrained optimization." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 1 (2021): 338. http://dx.doi.org/10.11591/ijeecs.v23.i1.pp338-344.

Full text
Abstract:
<span>In this study, we develop a different parameter of three term conjugate gradient kind, this scheme depends principally on pure conjugacy condition (PCC), Whereas, the conjugacy condition (PCC) is an important condition in unconstrained non-linear optimization in general and in conjugate gradient methods in particular. The proposed method becomes converged, and satisfy conditions descent property by assuming some hypothesis, The numerical results display the effectiveness of the new method for solving test unconstrained non-linear optimization problems compared to other conjugate gr
APA, Harvard, Vancouver, ISO, and other styles
4

Meansri, K., N. Benrabia, M. Ghiat, H. Guebbai та I. Hafaidia. "Представление TTMDY — трехчленный модифицированный метод сопряженных градиентов DY для крупномасштабных задач без ограничений". Вычислительные технологии 29, № 3 (2024): 81–91. http://dx.doi.org/10.25743/ict.2024.29.3.007.

Full text
Abstract:
The main focus of our paper is a novel approach to enhance the MDY conjugate gradient direction. The key modification involves incorporating a third term, which plays a crucial role in determining the descent direction. By introducing this additional term, we transform the MDY conjugate gradient direction into a three-term conjugate gradient direction. This modification aims to improve the convergence properties of the algorithm and enhance its performance in solving optimization problems. In comparison to traditional MDY conjugate gradient methods, our approach demon- strates improved converg
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Zhan, Pengyuan Li, Xiangrong Li, and Hongtruong Pham. "A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems." Mathematical Problems in Engineering 2020 (September 4, 2020): 1–14. http://dx.doi.org/10.1155/2020/4381515.

Full text
Abstract:
Conjugate gradient methods are well-known methods which are widely applied in many practical fields. CD conjugate gradient method is one of the classical types. In this paper, a modified three-term type CD conjugate gradient algorithm is proposed. Some good features are presented as follows: (i) A modified three-term type CD conjugate gradient formula is presented. (ii) The given algorithm possesses sufficient descent property and trust region property. (iii) The algorithm has global convergence with the modified weak Wolfe–Powell (MWWP) line search technique and projection technique for gener
APA, Harvard, Vancouver, ISO, and other styles
6

Dixon, L. C. W., P. G. Ducksbury, and P. Singh. "A new three-term conjugate gradient method." Journal of Optimization Theory and Applications 47, no. 3 (1985): 285–300. http://dx.doi.org/10.1007/bf00941495.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ahmed, Huda I., Rana Z. Al-Kawaz, and Abbas Y. Al-Bayati. "Spectral Three-Term Constrained Conjugate Gradient Algorithm for Function Minimizations." Journal of Applied Mathematics 2019 (December 25, 2019): 1–6. http://dx.doi.org/10.1155/2019/6378368.

Full text
Abstract:
In this work, we tend to deal within the field of the constrained optimization methods of three-term Conjugate Gradient (CG) technique which is primarily based on Dai–Liao (DL) formula. The new proposed technique satisfies the conjugacy property and the descent conditions of Karush–Kuhn–Tucker (K.K.T.). Our planned constrained technique uses the robust Wolfe line search condition with some assumptions. We tend to prove the global convergence property of the new planned technique. Numeral comparisons for (30-thirty) constrained optimization issues make sure the effectiveness of the new planned
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Jie, and Zhong Wan. "A new three-term conjugate gradient algorithm with modified gradient-differences for solving unconstrained optimization problems." AIMS Mathematics 8, no. 2 (2022): 2473–88. http://dx.doi.org/10.3934/math.2023128.

Full text
Abstract:
<abstract><p>Unconstrained optimization problems often arise from mining of big data and scientific computing. On the basis of a modified gradient-difference, this article aims to present a new three-term conjugate gradient algorithm to efficiently solve unconstrained optimization problems. Compared with the existing nonlinear conjugate gradient algorithms, the search directions in this algorithm are always sufficiently descent independent of any line search, as well as having conjugacy property. Using the standard Wolfe line search, global and local convergence of the proposed alg
APA, Harvard, Vancouver, ISO, and other styles
9

Abbas, Y. Al-Bayati, and M. M. Ali Muna. "New multi-step three-term conjugate gradient algorithms with inexact line searches." Indonesian Journal of Electrical Engineering and Computer Science 19, no. 3 (2020): 1564–73. https://doi.org/10.11591/ijeecs.v19.i3.pp1564-1573.

Full text
Abstract:
This work suggests several multi-step three-term Conjugate Gradient (CG)- algorithms that satisfies their sufficient descent property and conjugacy conditions. First, we considered (39) well-known three-term CG-method, and we have, therefore, suggested two new classes of this type of algorithms based on Hestenes and Stiefel (HS) and Polak-Ribière (PR) formulas with four different versions. Both descent and conjugacy conditions for all the proposed algorithms are satisfied, at each iteration by using the strong Wolfe line search condition and it's accelerated version. These new sugge
APA, Harvard, Vancouver, ISO, and other styles
10

Baluch, Bakhtawar, Zabidin Salleh, and Ahmad Alhawarat. "A New Modified Three-Term Hestenes–Stiefel Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence." Journal of Optimization 2018 (September 27, 2018): 1–13. http://dx.doi.org/10.1155/2018/5057096.

Full text
Abstract:
This paper describes a modified three-term Hestenes–Stiefel (HS) method. The original HS method is the earliest conjugate gradient method. Although the HS method achieves global convergence using an exact line search, this is not guaranteed in the case of an inexact line search. In addition, the HS method does not usually satisfy the descent property. Our modified three-term conjugate gradient method possesses a sufficient descent property regardless of the type of line search and guarantees global convergence using the inexact Wolfe–Powell line search. The numerical efficiency of the modified
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Three-term conjugate gradient"

1

Andrei, Neculai. "Three-Term Conjugate Gradient Methods." In Nonlinear Conjugate Gradient Methods for Unconstrained Optimization. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42950-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yunus, Rabiu Bashir, Kamilu Kamfa, Sulaiman Ibrahim Mohammed, and Mustafa Mamat. "A Novel Three Term Conjugate Gradient Method for Unconstrained Optimization via Shifted Variable Metric Approach with Application." In Studies in Systems, Decision and Control. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-04028-3_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gautam, Budhayash. "Energy Minimization." In Homology Molecular Modeling - Perspectives and Applications [Working Title]. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.94809.

Full text
Abstract:
The energetic state of a protein is one of the most important representative parameters of its stability. The energy of a protein can be defined as a function of its atomic coordinates. This energy function consists of several components: 1. Bond energy and angle energy, representative of the covalent bonds, bond angles. 2. Dihedral energy, due to the dihedral angles. 3. A van der Waals term (also called Leonard-Jones potential) to ensure that atoms do not have steric clashes. 4. Electrostatic energy accounting for the Coulomb’s Law m protein structure, i.e. the long-range forces between charg
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Three-term conjugate gradient"

1

Khadijah, Wan, Mohd Rivaie, and Mustafa Mamat. "A three-term conjugate gradient method under the strong-Wolfe line search." In PROCEEDINGS OF THE 24TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES: Mathematical Sciences Exploration for the Universal Preservation. Author(s), 2017. http://dx.doi.org/10.1063/1.4995888.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fadhilah, Nurul Hafawati, Mohd Rivaie, Fuziyah Ishak, and Nur Idalisa. "New coefficient of three-term conjugate gradient method for solving unconstrained optimization problems." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hameed, Nasmah Jameel, and Hamsa Th Saeed. "A Numerical Study for Solving Unconstrained Optimization Problems Using Method of Three-Term Conjugate Gradient." In 2022 International Conference on Computer Science and Software Engineering (CSASE). IEEE, 2022. http://dx.doi.org/10.1109/csase51777.2022.9759658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Jui-Yu, and Pei-Ci Liu. "Identifying a Default of Credit Card Clients by using a LSTM Method: A Case Study." In 8th International Conference on Artificial Intelligence (ARIN 2022). Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.121012.

Full text
Abstract:
Detecting fraudulent transactions is critical and challenging for financial banks and institutes. This study used a deep learning technique, which is a long short-term memory (LSTM) method, for identifying a default of credit card clients (an imbalanced dataset). To evaluate the performance of optimizers for the LSTM approach, this study employed three optimizers based on gradient methods, such as adaptive moment estimation (Adam), stochastic gradient descent with momentum (Sgdm) and root mean square propagation (Rmsprop). This study used 10-fold cross-validation. Moreover, this study compared
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Rajeev, and Brian H. Dennis. "A Least-Squares/Galerkin Finite Element Method for Incompressible Navier-Stokes Equations." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49654.

Full text
Abstract:
The least-squares finite element method (LSFEM), which is based on minimizing the l2-norm of the residual, has many attractive advantages over Galerkin finite element method (GFEM). It is now well established as a proper approach to deal with the convection dominated fluid dynamic equations. The least-squares finite element method has a number of attractive characteristics such as the lack of an inf-sup condition and the resulting symmetric positive system of algebraic equations unlike GFEM. However, the higher continuity requirements for second-order terms in the governing equations force the
APA, Harvard, Vancouver, ISO, and other styles
6

Kolachalama, Srikanth, and Hafiz Malik. "Extended Deep Learning Model to Predict the Electric Vehicle Motor Operating Point." In WCX SAE World Congress Experience. SAE International, 2024. http://dx.doi.org/10.4271/2024-01-2551.

Full text
Abstract:
<div class="section abstract"><div class="htmlview paragraph">The transition from combustion engines to electric propulsion is accelerating in every coordinate of the globe. The engineers had strived hard to augment the engine performance for more than eight decades, and a similar challenge had emerged again for electric vehicles. To analyze the performance of the engine, the vector engine operating point (EOP) is defined, which is common industry practice, and the performance vector electric vehicle motor operating point (EVMOP) is not explored in the existing literature. In an an
APA, Harvard, Vancouver, ISO, and other styles
7

Lestari, Dwi Mardika, and Pin-chuan Chen. "Rapid Manufacturing Solid Microneedle Array by Integrated Digital Light Processing With Machine Learning (DLP-ML)." In ASME 2024 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2024. https://doi.org/10.1115/imece2024-142167.

Full text
Abstract:
Abstract Microneedle arrays (μNA) are gaining popularity in the field of drug delivery due to their potential to minimize side effects compared to conventional hypodermic needles. Generally, μNA is manufacturing through three or two stages which lack of flexibility in design. 3d printing is one of the powerful method that could be employed in three or two stages. However, it could be extended to single stage by directly manufacturing μNA from designated material. Digital light processing (DLP) is a kind of 3d printing which is using in this study. A further understanding of DLP printing parame
APA, Harvard, Vancouver, ISO, and other styles
8

Panta Pazos, Rube´n. "Krylov Techniques for 3D Problems in Transport Theory." In 14th International Conference on Nuclear Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/icone14-89562.

Full text
Abstract:
When solving integro-differential equations by means of numerical methods one has to deal with large systems of linear equations, such as happens in transport theory [10]. Many iterative techniques are now used in Transport Theory in order to solve problems of 2D and 3D dimensions. In this paper, we choose two problems to solve the following transport equation, μ∂ψ∂x(x,μ)+h(x,μ)ψ(x,μ)==∫−11k(x,μ,μ')ψ(x,μ')dμ'+q(x,μ)(1) where x: represents the spatial variable, μ: the cosine of the angle, ψ: the angular flux, h(x, μ): is the collision frequency, k(x, μ, μ'): the scattering kernel, q(x, μ): the
APA, Harvard, Vancouver, ISO, and other styles
9

Bihs, Hans, Arun Kamath, Ankit Aggarwal, and Csaba Pakozdi. "Efficient Wave Modeling Using Non-Hydrostatic Pressure Distribution and Free Surface Tracking on Fixed Grids." In ASME 2018 37th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/omae2018-78158.

Full text
Abstract:
For the estimation of wave loads on offshore structures, relevant extreme wave events need to be identified. In order to achieve this, long term wave simulations of relatively large scales need to be performed. Computational Fluid Dynamics (CFD) based Numerical Wave Tanks (NWT) with an interface capturing two-phase flow approach typically require too large computational resources to achieve this efficiently. They are more suitable for the near-field hydrodynamics of steep and breaking wave impacts on the structures. In the current paper, a three-dimensional non-hydrostatic wave model is presen
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!