Výsledky vyhľadávania - Discrete difference of convex algorithm

MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm Autor Akagi, Yasunori, Marumo, Naoki, Kim, Hideaki, Kurashima, Takeshi, Toda, Hiroyuki

“…Collective graphical model (CGM) is a probabilistic model that provides a framework for analyzing aggregated count data. Maximum a posteriori (MAP) inference…”
Získať plný text

Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm Autor Akagi, Yasunori, Marumo, Naoki, Kim, Hideaki, Kurashima, Takeshi, Toda, Hiroyuki

“…The importance of aggregated count data, which is calculated from the data of multiple individuals, continues to increase. Collective Graphical Model (CGM) is…”
Získať plný text

On Minkowski difference-based contact detection in discrete/discontinuous modelling of convex polygons/polyhedra: Algorithms and implementation Autor Feng, Y.T., Tan, Yuanqiang

“…PurposeContact detection for convex polygons/polyhedra has been a critical issue in discrete/discontinuous modelling, such as the discrete element method (DEM…”
Získať plný text

A proximal difference-of-convex algorithm with extrapolation Autor Wen, Bo, Chen, Xiaojun, Pong, Ting Kei

“… While this kind of problems can be solved by the classical difference-of-convex algorithm (DCA) (Pham et al. Acta Math Vietnam 22…”
Získať plný text

User Preference Aware Lossless Data Compression at the Edge Autor Lu, Yawei, Chen, Wei, Poor, H. Vincent

“… For discrete user preferences, DCA (difference…”
Získať plný text

A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains Autor Xia, Ming, Xu, Xin, Gong, Fengqiang, Wang, Min, Feng, Y. T.

“…In this work, a Minkowski difference‐based advancing front approach is proposed to generate convex and non…”
Získať plný text

The Minkowski overlap and the energy‐conserving contact model for discrete element modeling of convex nonspherical particles Autor Feng, Y. T., Tan, Yuanqiang

“… to their Minkowski difference. The Minkowski contact features of a contact, including the overlap, normal direction, and contact points, are also defined for convex shapes…”
Získať plný text

A Privacy Protection Task Offloading Algorithm in MEC Autor Deng, Yun, Tang, Haihua

“…Combining discrete difference evolution and convex optimization, a privacy protection task offloading algorithm is proposed for solving the new location privacy leakage problem at mobile terminals due…”
Získať plný text

Further properties of the forward–backward envelope with applications to difference-of-convex programming Autor Liu, Tianxiang, Pong, Ting Kei

“…: 10.1007/s10589-017-9912-y , 2017 ) for problems whose objective is the sum of a proper closed convex function and a twice continuously differentiable possibly nonconvex function with Lipschitz continuous gradient…”
Získať plný text

Discrete convex subdifferentials and optimality Autor Dhingra, Nidhi Arora, Lalitha, C. S.

“… cones and subdifferentials. Various properties and calculus rules of normal cones, subdifferentials and singular subdifferentials are established and the differences with existing analogous rules in the real domain R n…”
Získať plný text

Discrete Choquet Integral Optimisation With Positive and Negative Interactions Autor Beliakov, Gleb, Wu, Jian-Zhang

“… We optimise piecewise linear objectives through the use of discrete Choquet integral, while subject to a set of linear constraints…”
Získať plný text

GPU based discrete element modeling for convex polyhedral shape particles: Development and validation Autor Mittal, Aman, Mangadoddy, Narasimha, Banerjee, Raja

“…Particle dynamics simulations face a significant challenge in understanding the intricate behaviors of convex polyhedral particles due to their complex geometries and interactions…”
Získať plný text

On solving difference of convex functions programs with linear complementarity constraints Autor Le Thi, Hoai An, Nguyen, Thi Minh Tam, Dinh, Tao Pham

“… The difference of convex functions algorithm (DCA), an efficient approach in nonconvex programming framework, is then developed to solve the resulting problems…”
Získať plný text

Dynamic and Robust Sensor Selection Strategies for Wireless Positioning With TOA/RSS Measurement Autor Oh, Myeung Suk, Hosseinalipour, Seyyedali, Kim, Taejoon, Love, David J., Krogmeier, James V., Brinton, Christopher G.

“…Emerging wireless applications are requiring ever more accurate location-positioning from sensor measurements. In this paper, we develop sensor selection…”
Získať plný text

A boosted DC algorithm for non-differentiable DC components with non-monotone line search Autor Ferreira, O. P., Santos, E. M., Souza, J. C. O.

“…We introduce a new approach to apply the boosted difference of convex functions algorithm (BDCA…”
Získať plný text

An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems Autor Liu, Tianxiang, Takeda, Akiko

“…In this paper, we propose a new method for a class of difference-of-convex (DC) optimization problems, whose objective is the sum of a smooth function and a possibly non-prox-friendly DC function…”
Získať plný text

Minimization of transformed L 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing Autor Zhang, Shuai, Xin, Jack

“…We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l1 (TL1…”
Získať plný text

Minimization of transformed L1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing Autor Zhang, Shuai, Xin, Jack

“…We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l 1 (TL1…”
Získať plný text

New Bregman proximal type algorithms for solving DC optimization problems Autor Takahashi, Shota, Fukuda, Mituhiro, Tanaka, Mirai

“…Difference of Convex (DC) optimization problems have objective functions that are differences between two convex functions…”
Získať plný text

A Nonconforming Virtual Element Method for a Fourth-order Hemivariational Inequality in Kirchhoff Plate Problem Autor Feng, Fang, Han, Weimin, Huang, Jianguo

“… The discrete problem can be formulated as an optimization problem for a difference of two convex (DC…”
Získať plný text