نتایج جستجو برای: p power convexification method

تعداد نتایج: 3129501  

2006
Hao Jiang SIMON FRASER

In this thesis, a novel successive convexification scheme is proposed for solving consistent labeling problems with convex regularization terms. Many computer vision problems can be modeled as such consistent labeling problems. The main optimization term, the labeling cost, however, is typically non-convex, which makes the problem difficult. As well, the large search space, i.e., formally the l...

Journal: :Journal of Inverse and Ill-posed Problems 2017

Journal: :Comp. Opt. and Appl. 2016
Naiyuan Chiang Victor M. Zavala

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger conv...

Journal: :SIAM J. Matrix Analysis Applications 2011
Chee Wei Tan Shmuel Friedland Steven H. Low

Maximizing the sum rates in a multiuser Gaussian channel by power control is a nonconvex NP-hard problem that finds engineering application in code division multiple access (CDMA) wireless communication network. In this paper, we extend and apply several fundamental nonnegative matrix inequalities initiated by Friedland and Karlin in a 1975 paper to solve this nonconvex power control optimizati...

Journal: :IEEE Transactions on Pattern Analysis and Machine Intelligence 2007

2014
David Günther Alec Jacobson Jan Reininghaus Hans-Peter Seidel Olga Sorkine-Hornung Tino Weinkauf

We know that the same set of selected extrema can be represented by a large number of different monotonicity graphs. We are interested in understanding how different, or how similar, the converged reconstruction results can be with respect to different monotonicity graphs. To do so, we made the following experiment. We constructed 100 random monotonicity graphs for the 2D vorticity data set (Fi...

2016

System identification studies how to construct mathematical models for dynamical systems from the input and output data, which finds applications in many scenarios, such as predicting future output of the system or building model based controllers for regulating the output the system. Among many other methods, convex optimization is becoming an increasingly useful tool for solving system identi...

2016
Iaroslav Shcherbatyi Bjoern Andres

Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a mixed integer program (MIP) whose objective function is non-convex. In this form, the problem is resistant to standard optimization techniques. We construct MIP...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم بهزیستی و توانبخشی 1388

qeeg به مفهوم ساده عبارتست از آنالیز کمی (quantitative) امواج یک نوار مغزی برای پی بردن به مختصات کمی موج های موجود در آن از جمله توزیع کمی امواج در محل های مختلف جمجمه یا قدرت هر کدام از امواج از نظر دامنه. در این مطالعه به منظور درک بهتر اختلال اسکیزوافکتیو ، تعداد 40 بیمار بطور تصادفی و بر اساس معیارهای ورود و خروج از مطالعه انتخاب شدند و نوار مغزی آنها که به شیوه کمی مورد آنالیز قرار گرفت...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید