In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex. This method is an extension of Benson’s outer approximation algorithm for multi-objective linear programming problems. We prove that this method provides a set of weakly ε-nondominated points. For the case that the objectives and constraints are differentiable, we describe an efficient way to carry out the main step of the algorithm, the construction of a hyperplane separating an exterior point from the feasible set in objective space. We provide examples that show that this cannot always be done in the same way in the case of non-differentiable objectives or constraints.
Attention deficit hyperactivity disorder (ADHD) is a kind of mental disease which often appears among young children. Various machine learning techniques including deep neural networks have been used to classify ADHD. As an alternative of deep neural networks, the deep forest or gcForest recently proposed by Zhou and Feng has demonstrated excellent performance on many imaging tasks. Therefore, in this paper, we are going to investigate using fMRI data and gcForest to discriminate ADHD subjects against normal controls. Two types of features are extracted from the fMRI data, they are 1-D functional connectivity (FC) feature and 3-D amplitude of low frequency fluctuations (ALFF) feature. We propose a revised gcForest method which uses a combined multi-grained scanning structure to fuse the two features together, thus a new concatenated feature vector can be formed for each sample. Moreover, considering the imbalanced property of ADHD data, we utilize synthetic minority over-sampling technique combined with edited-nearest neighbor to form synthetic minority concatenated feature vector samples for data balancing. Finally cascade forest is used to take the concatenated feature vector samples as input for classification. We test our method on the ADHD-200 public data sets and evaluate its performance on the hold-out testing data. We compare our method with several methods in the literature. The experiment illustrates that our method performs better than the reported methods.
1 November 2020 in Computer Methods and Programs in Biomedicine
Multiplicative programming problems (MPPs) are global optimization problems known to be NP-hard. In this paper, we employ algorithms developed to compute the entire set of nondominated points of multi-objective linear programmes (MOLPs) to solve linear MPPs. First, we improve our own objective space cut and bound algorithm for convex MPPs in the special case of linear MPPs by only solving one linear programme in each iteration, instead of two as the previous version indicates. We call this algorithm, which is based on Benson’s outer approximation algorithm for MOLPs, the primal objective space algorithm. Then, based on the dual variant of Benson’s algorithm, we propose a dual objective space algorithm for solving linear MPPs. The dual algorithm also requires solving only one linear programme in each iteration. We prove the correctness of the dual algorithm and use computational experiments comparing our algorithms to a recent global optimization algorithm for linear MPPs from the literature as well as two general global optimization solvers to demonstrate the superiority of the new algorithms in terms of computation time. Thus, we demonstrate that the use of multi-objective optimization techniques can be beneficial to solve difficult single objective global optimization problems.