نتایج جستجو برای: under constraint cdpm
تعداد نتایج: 1114294 فیلتر نتایج به سال:
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.
In this paper, we present a face detector based on Cascade Deformable Part Models (CDPM) [1]. Our model is learnt from partially labelled images using Latent Support Vector Machines (LSVM). Recently Zhu et al. [2] proposed a Tree Structure Model for multi-view face detection trained with facial landmark labels, which resulted on a complex and suboptimal system for face detection. Instead, we ad...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید