Adaptive Step Size Strategy for Orthogonality Constrained Line Search Methods Article Swipe
Xiaoying Dai
,
Liwei Zhang
,
Aihui Zhou
·
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1906.02883
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1906.02883
In this paper, we propose an adaptive step size strategy for a class of line search methods for orthogonality constrained minimization problems, which avoids the classic backtracking procedure. We prove the convergence of the line search methods equipped with our adaptive step size strategy under some mild assumptions.We then apply the adaptive algorithm to electronic structure calculations, which show that our strategy is efficient and recommended.
Related Topics To Compare & Contrast
Concepts
Orthogonality
Backtracking
Line search
Computer science
Convergence (economics)
Mathematical optimization
Line (geometry)
Class (philosophy)
Adaptive strategies
Minification
Algorithm
Mathematics
Artificial intelligence
Path (computing)
Geometry
Programming language
Archaeology
History
Economics
Economic growth
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/1906.02883
- https://arxiv.org/pdf/1906.02883
- OA Status
- green
- Cited By
- 4
- References
- 32
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2948518813
All OpenAlex metadata
Raw OpenAlex JSON
No additional metadata available.