نتایج جستجو برای: روش بهینه سازی sdp

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

2009
Nathan Krislock Henry Wolkowicz

The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are within radio range and the positions of a subset of the sensors (called anchors). Current solution techniques relax this problem to a weighted, nearest, (positive) semidefinite programming, SDP , completion problem, by...

Journal: :Development and psychopathology 2008
Brian M D'Onofrio Carol A Van Hulle Irwin D Waldman Joseph Lee Rodgers K Paige Harden Paul J Rathouz Benjamin B Lahey

Previous studies have documented that smoking during pregnancy (SDP) is associated with offspring externalizing problems, even when measured covariates were used to control for possible confounds. However, the association may be because of nonmeasured environmental and genetic factors that increase risk for offspring externalizing problems. The current project used the National Longitudinal Sur...

Journal: :Theor. Comput. Sci. 2012
Oliver Kullmann Xishun Zhao

DP-reduction F ❀ DPv(F ), applied to a clause-set F and a variable v, replaces all clauses containing v by their resolvents (on v). A basic case, where the number of clauses is decreased (i.e., c(DPv(F )) < c(F )), is singular DP-reduction (sDP-reduction), where v must occur in one polarity only once. For minimally unsatisfiable F ∈ MU , sDPreduction produces another F ′ := DPv(F ) ∈ MU with th...

Journal: :The journal of trauma and acute care surgery 2015
Philip C Spinella Elfaridah Frazier Heather F Pidcoke Dennis J Dietzen Shibani Pati Oleg Gorkun James K Aden Philip J Norris Andrew P Cap

BACKGROUND Plasma can be manufactured by multiple methods. Few studies have compared quality parameters between plasma products that may affect efficacy and safety. METHODS Four different plasma products were analyzed to include fresh frozen plasma (FFP), liquid plasma (LP), solvent detergent plasma (SDP), and a spray-dried, solvent detergent-treated plasma (SD-SDP) at multiple time points of...

2006
Cong Vo Masakazu Muramatsu Masakazu Kojima

The SDP (semidefinite programming) relaxation for general POPs (polynomial optimization problems), which was proposed as a method for computing global optimal solutions of POPs by Lasserre, has become an active research subject recently. We propose a new heuristic method exploiting the equality constraints in a given POP, and strengthen the SDP relaxation so as to achieve faster convergence to ...

2016
Anna Pérez-Bosque Lluïsa Miró Concepció Amat Javier Polo Miquel Moretó

Spray-dried preparations from porcine and bovine plasma can alleviate mucosal inflammation in experimental models and improve symptoms in patients with enteropathy. In rodents, dietary supplementation with porcine spray-dried plasma (SDP) attenuates intestinal inflammation and improves the epithelial barrier function during intestinal inflammation induced by Staphylococcus aureus enterotoxin B ...

2003
Hirokazu Anai Pablo A. Parrilo

Semidefinite Programming (SDP) is a class of convex optimization problems with a linear objective function and linear matrix inequality (LMI) constraints. SDP problems have many applications in engineering and applied mathematics. We propose a reasonably fast algorithm to prove and solve SDP exactly by exploiting the convexity of the SDP feasibility domain. This is achieved by combining a symbo...

Journal: :مهندسی مکانیک دانشگاه تبریز 0
سید مهدی سیدی کارشناسی ارشد، مهندسی مکانیک، دانشگاه فردوسی مشهد، مشهد، ایران محمدحسین ابوالبشری استاد، گروه مهندسی مکانیک، مرکز پژوهشی مهندسی تولید ناب، دانشگاه فردوسی مشهد، مشهد، ایران

هدف از این پژوهش بهینه سازی سازه های دو بعدی با روش بهینه سازی تبرید تدریجی و بررسی معایب و مزایای آن نسبت به روش بهینه سازی تکاملی سازه ها است. سه مثال در این پژوهش مطرح شده که عبارت اند از صفحه مربعی، صفحه مستطیل شکل و تیر با تکیه گاه ساده معروف به ام ب ب. این مثال ها با حالت های مختلف بارگذاری و با در نظر گرفتن تعداد المان های متفاوت در ضخامت حل شده اند. برای داشتن یک طرح بهینه عملی، در هر د...

2011
Hayato Waki Masakazu Muramatsu

Abstract We propose a method to reduce the sizes of SDP relaxation problems for a given polynomial optimization problem (POP). This method is an extension of the elimination method for a sparse SOS polynomial in [8] and exploits sparsity of polynomials involved in a given POP. In addition, we show that this method is a partial application of a facial reduction algorithm, which generates a small...

Journal: :APJOR 2010
Martin Mevissen Masakazu Kojima

Based on the convergent sequence of SDP relaxations for a multivariate polynomial optimization problem (POP) by Lasserre, Waki et al. constructed a sequence of sparse SDP relaxations to solve sparse POPs efficiently. Nevertheless, the size of the sparse SDP relaxation is the major obstacle in order to solve POPs of higher degree. This paper proposes an approach to transform general POPs to quad...

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

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