Relevant bibliographies by topics / Inexact line searches

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Inexact line searches'

Author: Grafiati
Published: 5 June 2025
Last updated: 1 August 2025

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 'Inexact line searches.'

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 "Inexact line searches"

1

Shi, Zhen-Jun, and Jie Shen. "A gradient-related algorithm with inexact line searches." Journal of Computational and Applied Mathematics 170, no. 2 (2004): 349–70. http://dx.doi.org/10.1016/j.cam.2003.10.025.

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

Y. Al-Bayati, Abbas, and Basim A. Hassan. "A Spectral Conjugate Gradient Method with Inexact line searches." IRAQI JOURNAL OF STATISTICAL SCIENCES 11, no. 20 (2011): 155–63. http://dx.doi.org/10.33899/iqjoss.2011.27895.

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

Y. Al-Bayati, Abbas, and Basim A. Hassan. "A Spectral Conjugate Gradient Method with Inexact line searches." IRAQI JOURNAL OF STATISTICAL SCIENCES 11, no. 2 (2011): 155–63. http://dx.doi.org/10.33899/iqjoss.2011.027895.

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

Al-Assady, N. H., and A. Y. Al-Bayati. "Minimization of extended quadratic functions with inexact line searches." Journal of Optimization Theory and Applications 82, no. 1 (1994): 139–47. http://dx.doi.org/10.1007/bf02191784.

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

Burachik, R., L. M. Graña Drummond, A. N. Iusem, and B. F. Svaiter. "Full convergence of the steepest descent method with inexact line searches." Optimization 32, no. 2 (1995): 137–46. http://dx.doi.org/10.1080/02331939508844042.

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

Sherali, Hanif D., and Osman Ulular. "Conjugate gradient methods using quasi-Newton updates with inexact line searches." Journal of Mathematical Analysis and Applications 150, no. 2 (1990): 359–77. http://dx.doi.org/10.1016/0022-247x(90)90109-s.

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

Al-Bayati, Abbas Younis, and Muna M. M. Ali. "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. http://dx.doi.org/10.11591/ijeecs.v19.i3.pp1564-1573.

Full text
Abstract:
<p>This work suggests several multi-step three-term Conjugate Gradient (CG)-algorithms that satisfies their sufficient descent property and conjugacy conditions. First, we have considered a number of well-known three-term CG-method, and we have, therefore, suggested two new classes of this type of algorithms which was 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 versi
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Al-Saidi, Amal. "Improved Fletcher-Reeves Methods Based on New Scaling Techniques." Sultan Qaboos University Journal for Science [SQUJS] 26, no. 2 (2021): 141–51. http://dx.doi.org/10.53539/squjs.vol26iss2pp141-151.

Full text
Abstract:
This paper introduces a scaling parameter to the Fletcher-Reeves (FR) nonlinear conjugate gradient method. The main aim is to improve its theoretical and numerical properties when applied with inexact line searches to unconstrained optimization problems. We show that the sufficient descent and global convergence properties of Al-Baali for the FR method with a fairly accurate line search are maintained. We also consider the possibility of extending this result to less accurate line search for appropriate values of the scaling parameter. The reported numerical results show that several values fo
APA, Harvard, Vancouver, ISO, and other styles
10

Nazareth, J. L. "Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches." SIAM Journal on Numerical Analysis 23, no. 1 (1986): 170–77. http://dx.doi.org/10.1137/0723012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Inexact line searches"

1

Sung, Shao-Wei, and 宋少瑋. "Modification of the Dai-Yuan method with inexact line search." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/03796860566601250976.

Full text
Abstract:
碩士<br>國立中正大學<br>應用數學研究所<br>93<br>This article is concerned with a new method which modifies the Dai-Yuan method. We prove the descent property and global convergence for this new method. Our numerical experiments indicate that the new method is better than the Dai-Yuan method.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Inexact line searches"

1

Lin, Guangtai, Wen Zhou, Minyao Qin, Yulun Wu, Gonglin Yuan, and Chen Ouyang. "A Conjugate Gradient Algorithm Based on Cable-Stayed Bridges Model for Nonconvex Minimization." In Advances in Transdisciplinary Engineering. IOS Press, 2023. http://dx.doi.org/10.3233/atde230826.

Full text
Abstract:
This paper examines the optimization problem of cable force in the construction phase of single-tower cable-stayed bridges, transforming it into an unconstrained problem that aims to control the vertical displacement of main beam nodes and the horizontal displacement of tower nodes. By introducing penalty terms, the constrained optimization problem is converted into an unconstrained one. The conjugate gradient algorithm is adopted to solve the unconstrained problem due to its simplicity, low storage requirement, and effectiveness in various engineering applications such as image restoration an
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Inexact line searches"

1

‘Aini, Nurul, Mohd Rivaie, and Mustafa Mamat. "A modified conjugate gradient coefficient with inexact line search for unconstrained optimization." In 4TH INTERNATIONAL CONFERENCE ON FUNDAMENTAL AND APPLIED SCIENCES (ICFAS2016). Author(s), 2016. http://dx.doi.org/10.1063/1.4968158.

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

Ju, J. J., S. Q. Du, and D. Y. Pang. "Convergence analysis of the scaled conjugate gradient method with inexact line search." In International Conference on Computer Science and Systems Engineering. WIT Press, 2015. http://dx.doi.org/10.2495/csse140021.

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

Wang, Baohua, Mingyuan Xu, Qiaoyun Li, et al. "A Scalable Numerical Solution Method for Fine Scale Compositional Simulation." In International Petroleum Technology Conference. IPTC, 2024. http://dx.doi.org/10.2523/iptc-24428-ea.

Full text
Abstract:
Summary Nonlinear iteration is a very important part of reservoir numerical simulation. If the iteration steps can be reduced, the speed of the iteration and the reservoir numerical simulation will be helped greatly. In this study, a self-equilibrium Newton method has been explored for nonlinear system of compositional simulator, which is composed of inexact Newton method, non-negative constraint line search method of molar concentration and automatic time step selection method. Furthermore, a multilevel preconditioning operator and domain decomposition method are adopted to realize parallel c
APA, Harvard, Vancouver, ISO, and other styles
4

Sun, Zhongbo, Chunling Xu, and Haiyin Gao. "The R-convergence rate of MDY conjugate gradient method with inexact line search for unconstrained optimization." In 2013 25th Chinese Control and Decision Conference (CCDC). IEEE, 2013. http://dx.doi.org/10.1109/ccdc.2013.6561755.

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

Liu, Jia, and Qiang Liu. "Speed and Resource Optimization of BFGS Quasi-Newton Implementation on FPGA Using Inexact Line Search Method for Neural Network Training." In 2018 International Conference on Field-Programmable Technology (FPT). IEEE, 2018. http://dx.doi.org/10.1109/fpt.2018.00074.

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

Balima, Olivier, Daniel Marceau, Joan Boulanger, and Andre Charette. "NEW DEVELOPMENTS IN FREQUENCY DOMAIN OPTICAL TOMOGRAPHY. PART II. APPLICATION WITH A L-BFGS ASSOCIATED TO AN INEXACT LINE SEARCH." In RADIATIVE TRANSFER - VI. Proceedings of the 6th International Symposium on Radiative Transfer. Begellhouse, 2010. http://dx.doi.org/10.1615/ichmt.2010.rad-6.40.

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

Vakili, S., and M. S. Gadala. "Low Cost Particle Swarm Algorithm Using Surrogate Model Based Pre-Evaluation for Inverse Heat Conduction Analysis." In ASME 2010 International Mechanical Engineering Congress and Exposition. ASMEDC, 2010. http://dx.doi.org/10.1115/imece2010-38256.

Full text
Abstract:
Using internal temperature measurements from inside a solid to determine the initial or boundary conditions or material properties is a common inverse heat conduction problem. These problems are ill-posed in nature and a robust mathematical solution is not available for them. Stochastical search algorithms like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) have been found to be very effective in dealing with some of the challenges in solving inverse problems, such as time step size limit and sensitivity to the measurement errors. However, these methods normally require large pop
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Inexact line searches' for particular source types:
Journal articles
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!

To the bibliography