No article text was recorded for this version.
backtracking line search
Version 1 of 126 papers30 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Empirical risk minimization: probabilistic complexity and stepsize strategy
- Blog: Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization
- Blog: Bregman Three-Operator Splitting Methods
- Blog: Dynamic Stress Measurement with Sensor Data Compensation
- Blog: Decentralized Trajectory Optimization for Multi-Agent Ergodic Exploration
- Blog: An efficient algorithm for compressive sensing based SAR tomography
- Blog: A Fast and Accurate Basis Pursuit Denoising Algorithm With Application to Super-Resolving Tomographic SAR
- Blog: Controlling Neural Networks via Energy Dissipation
- Blog: This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms - Theory and Practice
- Blog: A Quasi-Newton Primal-Dual Algorithm with Line Search
- Blog: Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
- Blog: Relationship between Batch Size and Number of Steps Needed for Nonconvex Optimization of Stochastic Gradient Descent using Armijo-Line-Search Learning Rate
- Blog: Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient
- Blog: A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming
- Blog: Optimization Methods for Sparse Pseudo-Likelihood Graphical Model Selection
- Blog: Towards Adaptive Attacks on Constrained Tabular Machine Learning
- Blog: On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points
- Blog: Beyond Diagonal Reconfigurable Intelligent Surface Enabled Sensing: Cramér-Rao Bound Optimization
- Blog: On the Iteration Complexity of Oblivious First-Order Optimization Algorithms
- Blog: Online non-convex learning for river pollution source identification
- Blog: A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis
- Blog: Visualizing Deep Networks by Optimizing with Integrated Gradients
- Blog: Adaptive Iterative Hessian Sketch via A-Optimal Subsampling
- Blog: On the Riemannian Search for Eigenvector Computation
- Blog: A distributed block coordinate descent method for training l1 regularized linear classifiers
- Blog: Coherence Retrieval Using Trace Regularization
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_backtracking_line_search_875ed11c,
title = {backtracking line search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/backtracking-line-search/rdr_875ed11cc5a24f879693cdb6abfdf16e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_backtracking_line_search_875ed11c_v1,
title = {backtracking line search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/backtracking-line-search/rdr_875ed11cc5a24f879693cdb6abfdf16e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}