Nonconvex optimization-based inverse spectral decomposition
نویسندگان
چکیده
منابع مشابه
Recursive Decomposition for Nonconvex Optimization
Continuous optimization is an important problem in many areas of AI, including vision, robotics, probabilistic inference, and machine learning. Unfortunately, most real-world optimization problems are nonconvex, causing standard convex techniques to find only local optima, even with extensions like random restarts and simulated annealing. We observe that, in many cases, the local modes of the o...
متن کاملConvexification Procedures and Decomposition Methods for Nonconvex Optimization Problems 1
In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a nonconvex problem is convexified and transformed into one which can be solved with the aid of primal-dual methods. Under this transformation, separability of the type necessary for...
متن کاملA Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
and Applied Analysis 3 Proof. Since f(x) defined in (2) belongs to the PDGstructured family and by Lemma 2.1 in [16] the Clarke subdifferential of F(x, ρ) at x can be formulated by ∂F (x, ρ) = ∂f (x) + ρ∂G (x) = ∂f (x) + ρ conv { ∇g j (x) | j ∈ J (x) ∪ {0}}
متن کاملPenalty Dual Decomposition Method For Nonsmooth Nonconvex Optimization
Many contemporary signal processing, machine learning and wireless communication applications can be formulated as nonconvex nonsmooth optimization problems. Often there is a lack of efficient algorithms for these problems, especially when the optimization variables are nonlinearly coupled in some nonconvex constraints. In this work, we propose an algorithm named penalty dual decomposition (PDD...
متن کاملComplete decomposition algorithm for nonconvex separable optimization problems and applications
Abstraet~In this paper, we present a complete decomposition algorithm for nonconvex separable optimization problems applied in the optimal control problems. This complete decomposition algorithm combines recursive quadratic programming with the dual method. When our algorithm is applied to discretized optimal control problems, a simple and parallel computation and a simple and regular data flow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geophysics and Engineering
سال: 2019
ISSN: 1742-2132,1742-2140
DOI: 10.1093/jge/gxz046