Results 51 to 60 of about 33,726 (205)

A Semidefinite Programming Approach for Harmonic Balance Method

open access: yesIEEE Access, 2019
The harmonic balance method is broadly employed for analyzing and predicting the periodic steady-state solution. Most of the traditional methods in the literature do not guarantee global optimality. Due to its nonconvexity, it is a complex task to find a
Cheng H. Yang, Ben S. Deng
doaj   +1 more source

Computing frequency response of non‐parametric uncertainty model of MIMO systems using υ‐gap metric optimization

open access: yesIET Control Theory & Applications, 2021
This paper presents the computation of the non‐parametric uncertainty model for multi input multi output (MIMO) systems, which is described by normalized coprime factors (NCF) using the frequency response data of the system.
Seyed Masoud Tabibian   +2 more
doaj   +1 more source

MOEA/D‐based multi‐row facility layout optimisation method with discontinuity perceiving of the Pareto front

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
Abstract In a multi‐row facility layout problem (MRFLP), facilities are arranged in more than one row under the limited layout area. Considering different layout factors, various extensions of MRFLP have been modelled. However, the orientation of input/output (I/O) point in a facility, as a key factor that plays a direct impact on flow cost, is seldom ...
Yinan Guo   +5 more
wiley   +1 more source

Semidefinite programming bounds for Lee codes [PDF]

open access: yes, 2018
For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$.
Polak, Sven
core   +3 more sources

Channel width adaptation algorithm in multi-channel vehicular networks

open access: yesTongxin xuebao, 2010
Aiming at the low utilization of spectrum resource in vehicular networks,an algorithm base on semidefinite programming was presented,which could be utilized to channel width adaptation of multi-channel vehicular networks.Firstly,the algorithm need to ...
PENG Xin, LI Ren-fa, LIU Liang-jiao
doaj   +2 more sources

LIGHTWEIGHT DESIGN OF STRUCTURES BASED ON A SEMIDEFINITE PROGRAMMING METHOD (MT)

open access: yesJixie qiangdu, 2022
A semidefinite programming-based optimization method is proposed for lightweight design of boom and stay bars of container cranes. The boom and stay bars are welded together by steel plates, and in engineering practices the cross-sectional dimensions of ...
WANG XingFeng   +3 more
doaj  

HDSDP: Software for Semidefinite Programming

open access: yesCoRR, 2022
HDSDP is a numerical software solving the semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP [BY2008] and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented.
Wenzhi Gao, Dongdong Ge, Yinyu Ye 0001
openaire   +2 more sources

When wine walked into grocery stores: Examining the (un)intended economic consequences of wine Sale reform in Tennessee

open access: yesAmerican Journal of Agricultural Economics, EarlyView.
Abstract Alcohol policy liberalization is a contentious issue in the United States, including debates over whether grocery stores should be allowed to sell wine. This issue reflects a dilemma between accommodating consumer convenience, promoting wine industry growth, and generating tax revenue, versus concerns about potential harm to liquor stores ...
Jiayu Sun   +3 more
wiley   +1 more source

Linear semidefinite programming problems: regularisation and strong dual formulations

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2020
Regularisation consists in reducing a given optimisation problem to an equivalent form where certain regularity conditions, which guarantee the strong duality, are fulfilled.
Olga I. Kostyukova   +1 more
doaj   +1 more source

Computing Skinning Weights via Convex Duality

open access: yesComputer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source

Home - About - Disclaimer - Privacy