Results 21 to 30 of about 7,898,408 (287)
A new conjugate gradient method for acceleration of gradient descent algorithms
Moroccan Journal of Pure and Applied Analysis, 2021 An accelerated of the steepest descent method for solving unconstrained optimization problems is presented. which propose a fundamentally different conjugate gradient method, in which the well-known parameter βk is computed by an new formula.
Rahali Noureddine +2 more
doaj +1 more source
Gradient-only line searches: An Alternative to Probabilistic Line Searches
CoRR, 2019 Step sizes in neural network training are largely determined using predetermined rules such as fixed learning rates and learning rate schedules. These require user input or expensive global optimization strategies to determine their functional form and associated hyperparameters. Line searches are capable of adaptively resolving learning rate schedules.
Dominic Kafka, Daniel N. Wilke
openaire +2 more sources
Real-Time Detection Method for Center and Attitude Precise Positioning of Cross Laser-Pattern
Applied Sciences, 2021 Optical metrology has experienced a fast development in recent years—cross laser-pattern has become a common cooperative measuring marker in optical metrology equipment, such as infrared imaging equipment or visual 3D measurement system.
Haopeng Li, Zurong Qiu, Haodan Jiang
doaj +1 more source
A general framework for searching on a line
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Jean-Lou De Carufel
openaire +2 more sources
A Line Search Multilevel Truncated Newton Algorithm for Computing the Optical Flow [PDF]
, 2015 We describe the implementation details and give the experimental results of three optimization algorithms for dense optical flow computation. In particular, using a line search strategy, we evaluate the performance of the unilevel truncated Newton method
El Mostafa Kalmoun +2 more
core +1 more source
, 2017 U radu su opisane iterativne metode bezuvjetne višedimenzionalne optimizacije, točnije metode linijskog pretraživanja. Prije spomenute metode podijeljene su na: egzaktne ili optimalne metode linijskog pretraživanja i aproksimativne ili približne metode
Trošić, Ivana
core +1 more source
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
Revisiting the Problem of Searching on a Line [PDF]
, 2013 We revisit the problem of searching for a target at an unknown location on a line when given upper and lower bounds on the distance D that separates the initial position of the searcher from the target. Prior to this work, only asymptotic bounds were known for the optimal competitive ratio achievable by any search strategy in the worst case. We present
Prosenjit Bose +2 more
openaire +4 more sources
Competitive Searching for a Line on a Line Arrangement.
, 2018 We discuss the problem of searching for an unknown line on a known or unknown line arrangement by a searcher S, and show that a search strategy exists that finds the line competitively, that is, with detour factor at most a constant when compared to the situation where S has all knowledge. In the case where S knows all lines but not which one is sought,
Quirijn W. Bouts +4 more
openaire +6 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