Results 41 to 50 of about 10,265,072 (333)
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
Synthetically-focused surface-penetrating radar for operation from a moving vehicle [PDF]
, 1998 This paper reports on a research programme, started recently under DERA sponsorship, on applying synthetic focusing to an oblong horizontal stand-off array, where all the voxels in a vertical slice underneath the centre-line of the array are synthesised ...
Benjamin, R +4 more
core +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
Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization [PDF]
SIAM Journal on Optimization, 2017 There has been much recent interest in finding unconstrained local minima of smooth functions, due in part of the prevalence of such problems in machine learning and robust statistics.
C. Royer, Stephen J. Wright
semanticscholar +1 more source
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
Mathematics, 2022 The paper presents a multi-fidelity extension of a local line-search-based derivative-free algorithm for nonsmooth constrained optimization (MF-CS-DFN).
Riccardo Pellegrini +5 more
doaj +1 more source
A search for the 55 MHz OH line [PDF]
, 2010 The OH molecule, found abundantly in the Milky Way, has four transitions at the ground state rotational level(J = 3/2) at cm wavelengths. These are E1 transitions between the F+ and F- hyperfine levels of the Lambda doublet of the J=3/2 state.
Chengalur, Jayaram N. +1 more
core +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