Solving viscoelastic problems with cyclic symmetry via a temporally adaptive EFG-SB partitioning algorithm
Sign Up to like & getrecommendations! Published in 2018 at "Engineering with Computers"
DOI: 10.1007/s00366-018-0586-6
Abstract: Based upon a combination of a temporally-piecewise adaptive algorithm with an Element-Free Galerkin Scaled Boundary Method (EFG-SBM), a partitioning algorithm is presented for the two-dimensional viscoelastic analysis of cyclically symmetric structures. By expanding variables at… read more here.
Keywords: viscoelastic problems; partitioning algorithm; solving viscoelastic; problems cyclic ... See more keywords
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Global Optimization"
DOI: 10.1007/s10898-018-00734-1
Abstract: In this work, we develop an adaptive, multivariate partitioning algorithm for solving nonconvex, Mixed-Integer Nonlinear Programs (MINLPs) with polynomial functions to global optimality. In particular, we present an iterative algorithm that exploits piecewise, convex relaxation… read more here.
Keywords: adaptive multivariate; partitioning algorithm; global optimization; multivariate partitioning ... See more keywords
Manifold Learning Inspired Dynamic Hybrid Precoding With Antenna Partitioning Algorithm for Dual-Hop Hybrid FSO-RF Systems
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Access"
DOI: 10.1109/access.2022.3216897
Abstract: The decode-and-forward (DF) based free-space optical-radio frequency (FSO-RF) hybrid system combines the advantages of both FSO links and RF links, which makes the system easy to be deployed and enables the extended transmission coverage. In… read more here.
Keywords: manifold learning; algorithm dual; dual hop; antenna partitioning ... See more keywords
Simple K-Medoids Partitioning Algorithm for Mixed Variable Data
Sign Up to like & getrecommendations! Published in 2019 at "Algorithms"
DOI: 10.3390/a12090177
Abstract: A simple and fast k-medoids algorithm that updates medoids by minimizing the total distance within clusters has been developed. Although it is simple and fast, as its name suggests, it nonetheless has neglected local optima… read more here.
Keywords: distance; variable data; simple medoids; partitioning algorithm ... See more keywords