Iterative Reweighted Minimization for Generalized Norm/Quasi-Norm Difference Regularized Unconstrained Nonlinear Programming

In this paper, we study the minimization of l p-q (0 <; p ≤ 1, q ≥ 1, p=6q), the general difference of l p and l q norms/quasi-norms, as a nonconvex metric for solving unconstrained nonlinear programming. We first establish an exact (stable) sparse recovery condition for the l p-q constrained pro...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 7; s. 153102 - 153122
Hlavní autoři:	Cen, Yi, Zhang, Linna, Wang, Ke, Cen, Yigang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">lₚ –<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">q -minimization <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">lₚ –<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">q -null space property Algorithms Approximation algorithms Convergence Difference of convex/nonconvex functions algorithm Iterative algorithms Iterative methods iterative reweighted <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">lₜ minimization Measurement Methods Minimization Nonlinear programming Norms Optimization Recovery Sensors
ISSN:	2169-3536, 2169-3536
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!

Buďte první, kdo okomentuje tento záznam!