نتایج جستجو برای: convex semi infinite programming
تعداد نتایج: 567949 فیلتر نتایج به سال:
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The present paper intends to give a short introduction into the field and to present some preliminary discussion on the complexity of...
This work presents a stochastic outer approximation algorithm to solve air pollution control problem while minimizing the control costs which thereby occur. These air quality standards give rise to an infinite number of constraints and this is a semi-infinite programming problem.
In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify “nonlinear data”. Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of “infinite” kernel combinatio...
Míry a lineární maticové nerovnosti v optimálním polynomiálnímřízení Measures and linear matrix inequalities in polynomial optimal control Summary This lecture describes the application of modern techniques of convex optimization to solve nonconvex nonlinear optimal control problems (OCPs) which may feature oscillation phenomena (chattering control) or concentration phenomena (impulsive control...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید