A Non-monotone Adaptive Scaled Gradient Projection Method for Orthogonality Constrained Problems

Optimization problems with orthogonality constraints are classical nonconvex nonlinear problems and have been widely applied in science and engineering. In order to solve this problem, we come up with an adaptive scaled gradient projection method. The method combines a scaling matrix that depends on...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of applied and computational mathematics Ročník 10; číslo 2; s. 89
Hlavní autoři: Ji, Quanming, Zhou, Qinghua
Médium: Journal Article
Jazyk:angličtina
Vydáno: New Delhi Springer India 01.04.2024
Springer Nature B.V
Témata:
Algorithms
Applications of Mathematics
Computational Science and Engineering
Convergence
Eigenvalues
Lagrange multiplier
Mathematical and Computational Physics
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Nuclear Energy
Operations Research/Decision Theory
Optimization
Original Paper
Orthogonality
Theoretical
BB step size
Nonmonotone technique
Adaptive scaled gradient projection method
Stiefel manifold
Orthogonality constraint
ISSN:2349-5103, 2199-5796
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Optimization problems with orthogonality constraints are classical nonconvex nonlinear problems and have been widely applied in science and engineering. In order to solve this problem, we come up with an adaptive scaled gradient projection method. The method combines a scaling matrix that depends on the step size with some parameters that control the search direction. In addition, we consider the BB step size and combine a nonmonotone line search technique to accelerate the convergence speed of the proposed algorithm. Under the premise of non-monotonic, we prove the convergence of the algorithm. Also, the computation results proved the efficiency of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2349-5103
2199-5796
DOI:10.1007/s40819-024-01689-6