BATSE Gamma-Ray Burst Line Search: IV. Line Candidates from the Visual Search [PDF]
The Astrophysical Journal, 1995 We evaluate the significance of the line candidates identified by a visual search of burst spectra from BATSE's Spectroscopy Detectors. None of the candidates satisfy our detection criteria: an F-test probability less than 10^-4 for a feature in one ...
Band, D. L. +9 more
core +2 more sources
A Subsampling Line-Search Method with Second-Order Results [PDF]
INFORMS Journal on Optimization, 2020 In many contemporary optimization problems such as those arising in machine learning, it can be computationally challenging or even infeasible to evaluate an entire function or its derivatives.
Bergou, El-houcine +4 more
core +4 more sources
Dai-Kou type conjugate gradient methods with a line search only using gradient [PDF]
Journal of Inequalities and Applications, 2017 In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope.
Yuanyuan Huang, Changhe Liu
doaj +2 more sources
Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models [PDF]
Neural Information Processing Systems, 2023 Recent works have shown that line search methods can speed up Stochastic Gradient Descent (SGD) and Adam in modern over-parameterized settings. However, existing line searches may take steps that are smaller than necessary since they require a monotone ...
Leonardo Galli +2 more
semanticscholar +1 more source
Line Search for Convex Minimization [PDF]
arXiv.org, 2023 Golden-section search and bisection search are the two main principled algorithms for 1d minimization of quasiconvex (unimodal) functions. The first one only uses function queries, while the second one also uses gradient queries.
Laurent Orseau, Marcus Hutter
semanticscholar +1 more source
A modified Liu-Storey scheme for nonlinear systems with an application to image recovery [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2023 Like the Polak-Ribi`ere-Polyak (PRP) and Hestenes-Stiefel (HS) meth-ods, the classical Liu-Storey (LS) conjugate gradient scheme is widely be-lieved to perform well numerically.
A.I. Kiri, M.Y. Waziri, K. Ahmed
doaj +1 more source
Journal of Numerical Analysis and Approximation Theory, 2020 This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming.
Soraya Chaghoub, Djamel Benterki
doaj +7 more sources
Using a new line search method with gradient direction to solve nonlinear systems of equations
Journal of Physics: Conference Series, 2021 The line search techniques together with the Newton method are the best methods to solve nonlinear systems of equations. These methods use the gradient directions because they required low storage.
K. H. Hashim, M. A. Shiker
semanticscholar +1 more source
An adaptive descent extension of the Polak–Rebière–Polyak conjugate gradient method based on the concept of maximum magnification [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2021 Recently, a one-parameter extension of the Polak–Rebière–Polyak method has been suggested, having acceptable theoretical features and promising numerical behavior.
Z. Aminifard, S. Babaie-Kafaki
doaj +1 more source
Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming
Annales Mathematicae Silesianae, 2023 We propose in this study, a new logarithmic barrier approach to solve linear semidefinite programming problem. We are interested in computation of the direction by Newton’s method and of the displacement step using minorant functions instead of line ...
Leulmi Assma
doaj +1 more source