Search Results - Discrete difference of convex algorithm

MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm by 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…”
Get full text

Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm by 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…”
Get full text

On Minkowski difference-based contact detection in discrete/discontinuous modelling of convex polygons/polyhedra: Algorithms and implementation by 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…”
Get full text

A proximal difference-of-convex algorithm with extrapolation by 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…”
Get full text

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

“… For discrete user preferences, DCA (difference…”
Get full text

A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains by 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…”
Get full text

The Minkowski overlap and the energy‐conserving contact model for discrete element modeling of convex nonspherical particles by 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…”
Get full text

A Privacy Protection Task Offloading Algorithm in MEC by 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…”
Get full text

Further properties of the forward–backward envelope with applications to difference-of-convex programming by 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…”
Get full text

Discrete convex subdifferentials and optimality by 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…”
Get full text

Discrete Choquet Integral Optimisation With Positive and Negative Interactions by 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…”
Get full text

GPU based discrete element modeling for convex polyhedral shape particles: Development and validation by 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…”
Get full text

On solving difference of convex functions programs with linear complementarity constraints by 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…”
Get full text

Dynamic and Robust Sensor Selection Strategies for Wireless Positioning With TOA/RSS Measurement by 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…”
Get full text

A boosted DC algorithm for non-differentiable DC components with non-monotone line search by 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…”
Get full text

An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems by 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…”
Get full text

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

“…We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l1 (TL1…”
Get full text

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

“…We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l 1 (TL1…”
Get full text

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

“…Difference of Convex (DC) optimization problems have objective functions that are differences between two convex functions…”
Get full text

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

“… The discrete problem can be formulated as an optimization problem for a difference of two convex (DC…”
Get full text