Iterative hard thresholding methods for ... regularized convex cone programming

(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).In this paper we consider ... regularized convex cone programming problems. In particular, we first propose an iterative hard thresholding (IHT) method and its variant for solving ... regularized box constrained convex progr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 147; číslo 1-2; s. 125 - 154
Hlavní autor: Lu, Zhaosong
Médium: Journal Article
Jazyk:angličtina
Vydáno: 01.10.2014
Témata:
Complexity
Constraints
Iterative methods
Mathematical analysis
Mathematical programming
Programming
Texts
ISSN:0025-5610, 1436-4646
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í:(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).In this paper we consider ... regularized convex cone programming problems. In particular, we first propose an iterative hard thresholding (IHT) method and its variant for solving ... regularized box constrained convex programming. We show that the sequence generated by these methods converges to a local minimizer. Also, we establish the iteration complexity of the IHT method for finding an ...-local-optimal solution. We then propose a method for solving ... regularized convex cone programming by applying the IHT method to its quadratic penalty relaxation and establish its iteration complexity for finding an ...-approximate local minimizer. Finally, we propose a variant of this method in which the associated penalty parameter is dynamically updated, and show that every accumulation point is a local izer of the problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-013-0714-4