Search Results - "DC (Difference of Convex functions) Programming"

The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems by An, Le Thi Hoai, Tao, Pham Dinh

“…The DC programming and its DC algorithm (DCA) address the problem of minimizing a function f=g-h (with g,h being lower semicontinuous proper convex functions…”
Get full text

A continuous approach for the concave cost supply problem via DC programming and DCA by Le Thi, Hoai An, Pham Dinh, Tao

“…The paper addresses an important but difficult class of concave cost supply management problems which consist in minimizing a separable increasing concave…”
Get full text

Discrete Tomography Based on DC Programming and DCA by Le Thi Hoai An, Nguyen Trong Phuc, Pham Dinh Tao

“…In this article, we present a new continuous approach based on DC (Difference of Convex functions…”
Get full text

Solving a multimodal transport problem by DCA by Le Thi, Hoai An, Ndiaye, Babacar Mbaye, Pham Dinh, Tao

“…The combined transport appears as a promising alternative to road transportation for containers allocation. It possesses a strong potential market, conditioned…”
Get full text

DC approximation approaches for sparse optimization by Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.

“… (Difference of Convex functions) programming framework. Considering…”
Get full text

Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning by Le Thi, Hoai An, Le, Hoai Minh, Phan, Duy Nhat, Tran, Bach

“… (Difference of Convex functions) programming and DCA (DC Algorithm).•We first develop a standard DCA scheme especially dealing with the very specific structure of this problem…”
Get full text

A generalized adaptive robust distance metric driven smooth regularization learning framework for pattern recognition by Ma, Jun, Yu, Guolin

“…), regularization and smoothing techniques.•The fast Newton-Armijo algorithm and DC (difference of convex functions…”
Get full text

Adaptive robust learning framework for twin support vector machine classification by Ma, Jun, Yang, Liming, Sun, Qun

“…In general, introducing robust distance metrics and loss functions in the learning process can improve the robustness of the algorithms. In this work, we first…”
Get full text

Efficient Nonnegative Matrix Factorization by DC Programming and DCA by Le Thi, Hoai An, Vo, Xuan Thanh, Dinh, Tao Pham

“… Two approaches based on DC (difference of convex functions) programming and DCA (DC algorithm) are developed. The first approach follows the alternating framework…”
Get more information

Alternating DC algorithm for partial DC programming problems by Pham Dinh, Tao, Huynh, Van Ngai, Le Thi, Hoai An, Ho, Vinh Thanh

“…DC (Difference of Convex functions) programming and DCA (DC Algorithm) play a key role in nonconvex programming framework…”
Get full text

DCA based algorithms for feature selection in multi-class support vector machine by Le Thi, Hoai An, Nguyen, Manh Cuong

“… (Difference of Convex functions) programming and DCA (DC Algorithms) are investigated. The first is DC approximation via several sparse inducing functions and the second is an exact reformulation approach using penalty techniques…”
Get full text

DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices by Le Thi, Hoai An, Phan, Duy Nhat, Pham Dinh, Tao

“…•Two new models via new regularizations for bi-level variable selection are considered.•The first uses the mixed zero norm and the second is the combined…”
Get full text

Support vector machine with truncated pinball loss and its application in pattern recognition by Yang, Liming, Dong, Hongwei

“…(difference of convex functions) programming method, to solve the proposed TPINSVM. The resulting DC optimization algorithm converges finitely…”
Get full text

New and efficient DCA based algorithms for minimum sum-of-squares clustering by Hoai An, Le Thi, Hoai Minh, Le, Tao, Pham Dinh

“…The purpose of this paper is to develop new efficient approaches based on DC (Difference of Convex functions…”
Get full text

Community detection via an efficient nonconvex optimization approach based on modularity by Yuan, Quan, Liu, Binghui

“…Maximizing modularity is a widely used method for community detection, which is generally solved by approximate or greedy search because of its high…”
Get full text

Robust Support Vector Machine With Asymmetric Truncated Generalized Pinball Loss by Suppalap, Siwakon, Wangkeeree, Rabian

“…The support vector machine (SVM) with pinball loss (Pin-SVM) can handle noise sensitivity and instability to re-sampling but loses sparsity. To solve this…”
Get full text

Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation by Le Thi, Hoai An, Ho, Vinh Thanh

“…We study a challenging problem in machine learning that is the reduced-rank multitask linear regression with covariance matrix estimation. The objective is to…”
Get full text

Online Learning Based on Online DCA and Application to Online Classification by Le Thi, Hoai An, Ho, Vinh Thanh

“…We investigate an approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm…”
Get more information

A Robust Regression Framework with Laplace Kernel-Induced Loss by Yang, Liming, Ren, Zhuo, Wang, Yidan, Dong, Hongwei

“… The problems are formulated as DC (difference of convex functions) programming. The corresponding DC algorithms (DCAs) converge linearly…”
Get more information

Open issues and recent advances in DC programming and DCA by Le Thi, Hoai An, Pham Dinh, Tao

“…DC (difference of convex functions) programming and DC algorithm (DCA) are powerful tools for nonsmooth nonconvex optimization…”
Get full text