In this paper, we apply the -algorithm to solve the constrained minimization problem of a maximum eigenvalue function which is the composite function of an affine matrix-valued mapping and its maximum eigenvalue. Here, we convert the constrained problem into its equivalent unconstrained problem by the exact penalty function. However, the equivalent problem involves the sum of two nonsmooth functions, which makes it difficult to apply -algorithm to get the solution of the problem. Hence, our strategy first applies the smooth convex approximation of maximum eigenvalue function to get the approximate problem of the equivalent problem. Then the approximate problem, the space decomposition, and the -Lagrangian of the object function at a given point will be addressed particularly. Finally, the -algorithm will be presented to get the approximate solution of the primal problem by solving the approximate problem.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2i1cFk4
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Abstract Bromodomain proteins function as epigenetic readers that recognize acetylated histone tails to facilitate the transcription of t...
-
Objectives To optimise medical students’ early clerkship is a complex task since it is conducted in a context primarily organised to take ca...
-
Abstract Purpose Overcoming the flaws of current data management conditions in head and neck oncology could enable integrated informatio...
-
1 abqls-210rm.html Read the latest Journal of Clinical Neurophysiology - Vol. 37, No. 1, January 2020.eml 2 agx3v-nxz96.html Read the late...
-
Ambergris Caye's best News Source. A weekly tourism and community oriented newspaper providing local news, stories, and reports on what...
-
by Yanwei Li, Haifeng Liu, Wei Zeng, Jing Wei An increase in the osmolarity of tears induced by excessive evaporation of the aqueous tear p...
-
http://ift.tt/2p41efZ
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου