Results 21 to 30 of about 820,651 (313)
Mathematics, 2021 For the past few decades, various algorithms have been proposed to solve convex minimization problems in the form of the sum of two lower semicontinuous and convex functions.
Dawan Chumpungam +2 more
doaj +1 more source
Searching for Emission-Line Galaxies [PDF]
International Astronomical Union Colloquium, 1984 Survey methods for finding emission-line galaxies are reviewed. Observational selection effects are investigated by comparing different surveys and the limitations of the different techniques are discussed. The advantages of Ha surveys for finding low luminosity galaxies and those with low excitation emission spectra are emphasized.
openaire +1 more source
Line search for generalized alternating projections [PDF]
2017 American Control Conference (ACC), 2017 This paper is about line search for the generalized alternating projections (GAP) method. This method is a generalization of the von Neumann alternating projections method, where instead of performing alternating projections, relaxed projections are alternated. The method can be interpreted as an averaged iteration of a nonexpansive mapping. Therefore,
Fält, Mattias, Giselsson, Pontus
openaire +2 more sources
A brief survey of line search methods for optimization problems
Results in Control and OptimizationThe line search methods for optimization problems have garnered widespread adoption across various domains and applications, primarily due to their effectiveness in addressing intricate problems. An important component that ensures the success of various
Audu Umar Omesa +5 more
doaj +1 more source
Efficient Line Searching for Convex Functions [PDF]
SSRN Electronic Journal, 2004 In this paper we propose two new line search methods for convex functions. These new methods exploit the convexity property of the function, contrary to existing methods.The worst method is an improved version of the golden section method.For the second method it is proven that after two evaluations the objective gap is at least halved.The practical ...
Boef, E. den, Hertog, D. den
openaire +5 more sources
AIMS Mathematics, 2023 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 ...
Jie Guo , Zhong Wan
doaj +1 more source
Croatian Operational Research Review, 2022 In this paper, it is aimed to computationally conduct a performance benchmarking for the steepest descent and the three well-known conjugate gradient methods (i.e., Fletcher-Reeves, Polak- Ribiere and Hestenes-Stiefel) along with six different step ...
Kadir Kiran
doaj
A New Restarting Criterion for FR-CG Method with Exact and Inexact Line Searches [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 A new restarting criterion for FR-CG method is derived and investigated in this paper. This criterion is globally convergent whenever the line search fulfills the Wolfe conditions.
Maha Younis
doaj +1 more source
Approximately Exact Line Search
, 2020 We propose approximately exact line search (AELS), which uses only function evaluations to select a step size within a constant fraction of the exact line search minimizer of a unimodal objective. We bound the number of iterations and function evaluations of AELS, showing linear convergence on smooth, strongly convex objectives with no dependence on ...
Fridovich-Keil, Sara, Recht, Benjamin
openaire +2 more sources
Line search for averaged operator iteration [PDF]
2016 IEEE 55th Conference on Decision and Control (CDC), 2016 Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers (ADMM), can be formulated as averaged iteration of a nonexpansive mapping.
Giselsson, Pontus +2 more
openaire +2 more sources