Suchergebnisse - Discrete difference of convex algorithm

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

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

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

A proximal difference-of-convex algorithm with extrapolation von 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 …”
Volltext

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

“… For discrete user preferences, DCA (difference …”
Volltext

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

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

A Privacy Protection Task Offloading Algorithm in MEC von 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 …”
Volltext

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

Discrete convex subdifferentials and optimality von 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 …”
Volltext

Discrete Choquet Integral Optimisation With Positive and Negative Interactions von 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 …”
Volltext

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

On solving difference of convex functions programs with linear complementarity constraints von 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 …”
Volltext

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

A boosted DC algorithm for non-differentiable DC components with non-monotone line search von 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 …”
Volltext

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

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

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

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

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

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

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

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

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