اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUnifying Farkas lemma and S-lemma: new theory and applications in nonquadratic nonconvex optimization
72
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We unify nonlinear Farkas lemma and S-lemma to a generalized alternative theorem for nonlinear nonconvex system. It provides fruitful applications in globally solving nonconvex non-quadratic optimization problems via revealing the hidden convexity.
قيم البحث
اقرأ أيضاً
We extend Polyaks theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result covers the fu
ndamental Diness theorem. As applications, we further extend Yuans lemma and S-lemma, respectively. Our extended Yuans lemma is used to build a more generalized assumption than that of Haeser (J. Optim. Theory Appl. 174(3): 641-649, 2017), under which the standard second-order necessary optimality condition holds at local minimizer. The extended S-lemma reveals strong duality of homogeneous quadratic optimization problem with two bilateral quadratic constraints.
The concept of dissipativity, as introduced by Jan Willems, is one of the cornerstones of systems and control theory. Typically, dissipativity properties are verified by resorting to a mathematical model of the system under consideration. In this pap
er, we aim at assessing dissipativity by computing storage functions for linear systems directly from measured data. As our main contributions, we provide conditions under which dissipativity can be ascertained from a finite collection of noisy data samples. Three different noise models will be considered that can capture a variety of situations, including the cases that the data samples are noise-free, the energy of the noise is bounded, or the individual noise samples are bounded. All of our conditions are phrased in terms of data-based linear matrix inequalities, which can be readily solved using existing software packages.
We prove the Zabreikos lemma in 2-Banach spaces. As an application we shall prove a version of the closed graph theorem and open mapping theorem.
We study the set of continuous functions that admit no spurious local optima (i.e. local minima that are not global minima) which we term textit{global functions}. They satisfy various powerful properties for analyzing nonconvex and nonsmooth optimiz
ation problems. For instance, they satisfy a theorem akin to the fundamental uniform limit theorem in the analysis regarding continuous functions. Global functions are also endowed with useful properties regarding the composition of functions and change of variables. Using these new results, we show that a class of nonconvex and nonsmooth optimization problems arising in tensor decomposition applications are global functions. This is the first result concerning nonconvex methods for nonsmooth objective functions. Our result provides a theoretical guarantee for the widely-used $ell_1$ norm to avoid outliers in nonconvex optimization.
We reprove the $lambda$-Lemma for finite dimensional gradient flows by generalizing the well-known contraction method proof of the local (un)stable manifold theorem. This only relies on the forward Cauchy problem. We obtain a rather quantitative desc
ription of (un)stable foliations which allows to equip each leaf with a copy of the flow on the central leaf -- the local (un)stable manifold. These dynamical thickenings are key tools in our recent work [Web]. The present paper provides their construction.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
