ترغب بنشر مسار تعليمي؟ اضغط هنا

Higher-Order Cone Programming

82   0   0.0 ( 0 )
 نشر من قبل Lijun Ding
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We introduce a conic embedding condition that gives a hierarchy of cones and cone programs. This condition is satisfied by a large number of convex cones including the cone of copositive matrices, the cone of completely positive matrices, and all symmetric cones. We discuss properties of the intermediate cones and conic programs in the hierarchy. In particular, we demonstrate how this embedding condition gives rise to a family of cone programs that interpolates between LP, SOCP, and SDP. This family of $k$th order cones may be realized either as cones of $n$-by-$n$ symmetric matrices or as cones of $n$-variate even degree polynomials. The cases $k = 1, 2, n$ then correspond to LP, SOCP, SDP; or, in the language of polynomial optimization, to DSOS, SDSOS, SOS.



قيم البحث

اقرأ أيضاً

This paper is devoted to the study of tilt stability of local minimizers, which plays an important role in both theoretical and numerical aspects of optimization. This notion has been comprehensively investigated in the unconstrained framework as wel l as for problems of nonlinear programming with $C^2$-smooth data. Available results for nonpolyhedral conic programs were obtained only under strong constraint nondegeneracy assumptions. Here we develop an approach of second-order variational analysis, which allows us to establish complete neighborhood and pointbased characterizations of tilt stability for problems of second-order cone programming generated by the nonpolyhedral second-order/Lorentz/ice-cream cone. These characterizations are established under the weakest metric subregularity constraint qualification condition.
131 - Josh Taylor 2021
We maximize the production of biogas in a gradostat at steady state. The physical decision variables are the water, substrate, and biomass entering each tank and the flows through the interconnecting pipes. Our main technical focus is the nonconvex c onstraint describing microbial growth. We formulate a relaxation and prove that it is exact when the gradostat is outflow connected, its system matrix is irreducible, and the growth rate satisfies a simple condition. The relaxation has second-order cone representations for the Monod and Contois growth rates. We extend the steady state models to the case of multiple time periods by replacing the derivatives with numerical approximations instead of setting them to zero. The resulting optimizations are second-order cone programs, which can be solved at large scales using standard industrial software.
113 - Cong D. Dang , Guanghui Lan 2013
In this paper, we consider two formulations for Linear Matrix Inequalities (LMIs) under Slater type constraint qualification assumption, namely, SDP smooth and non-smooth formulations. We also propose two first-order linearly convergent algorithms fo r solving these formulations. Moreover, we introduce a bundle-level method which converges linearly uniformly for both smooth and non-smooth problems and does not require any smoothness information. The convergence properties of these algorithms are also discussed. Finally, we consider a special case of LMIs, linear system of inequalities, and show that a linearly convergent algorithm can be obtained under a weaker assumption.
300 - Xiaoxiao Ma , Wei Yao , Jane J. Ye 2021
In this paper, we propose a combined approach with second-order optimality conditions of the lower level problem to study constraint qualifications and optimality conditions for bilevel programming problems. The new method is inspired by the combined approach developed by Ye and Zhu in 2010, where the authors combined the classical first-order and the value function approaches to derive new necessary optimality conditions under weaker conditions. In our approach, we add the second-order optimality condition to the combined program as a new constraint. We show that when all known approaches fail, adding the second-order optimality condition as a constraint makes the corresponding partial calmness condition easier to hold. We also give some discussions on optimality conditions and advantages and disadvantages of the combined approaches with the first-order and the second-order information.
In this paper, we present a generalization of the super-twisting algorithm for perturbed chains of integrators of arbitrary order. This Higher Order Super-Twisting (HOST) controller, which extends the approach of Moreno and als., is homegeneous with respect to a family of dilations and can be continuous. Its design is derived from a first result obtained for pure chains of integrators, the latter relying on a geometric condition introduced by the authors. The complete result is established using a homogeneous strict Lyapunov function which is explicitely constructed. The effectiveness of the controller is finally illustrated with simulations for a chain of integrator of order four, first pure then perturbed, where we compare the performances of two HOST controllers.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا