Search Results (11)

The Barzilai-Borwein (BB) method usually uses BB stepsize for iteration so as to eliminate the line search step in the steepest descent method. In this paper, we modify the BB stepsize and extend it to solve the optimization problems of three-dimensional quadratic functions. The discussion is divided into two cases. Firstly, we study the case where the coefficient matrix of the quadratic term of quadratic function is a special third-order diagonal matrix and prove that using the new modified stepsize, this case is R-superlinearly convergent. In addition to that, we extend it to n-dimensional case and prove the rate of convergence is R-linear. Secondly, we analyze that the coefficient matrix of the quadratic term of quadratic function is a third-order asymmetric matrix, that is, when the matrix has a double characteristic root and prove the global convergence of this case. The results of numerical experiments show that the modified method is effective for the above two cases. Full article

In this paper, we propose a modified RFedSVRG method by incorporating the Barzilai–Borwein (BB) method to approximate second-order information on the manifold for Federated Learning (FL). Moreover, we use the BB strategy to obtain self-adjustment of step size. We show the convergence of our methods under some assumptions. The numerical experiments on both synthetic and real datasets demonstrate that the proposed methods outperform some used methods in FL in some test problems. Full article

In this paper, we first develop an active set identification technique, and then we suggest a modified nonmonotone line search rule, in which a new parameter formula is introduced to control the degree of the nonmonotonicity of line search. By using the modified line search and the active set identification technique, we propose a global convergent method to solve the NMF based on the alternating nonnegative least squares framework. In addition, the larger step size technique is exploited to accelerate convergence. Finally, a large number of numerical experiments are carried out on synthetic and image datasets, and the results show that our presented method is effective in calculating speed and solution quality. Full article

This study presents a new semi-supervised action recognition method via adaptive feature analysis. We assume that action videos can be regarded as data points in embedding manifold subspace, and their matching problem can be quantified through a specific Grassmannian kernel function while integrating feature correlation exploration and data similarity measurement into a joint framework. By maximizing the intra-class compactness based on labeled data, our algorithm can learn multiple features and leverage unlabeled data to enhance recognition. We introduce the Grassmannian kernels and the Projected Barzilai–Borwein (PBB) method to train a subspace projection matrix as a classifier. Experiment results show our method has outperformed the compared approaches when a few labeled training samples are available. Full article

Many data analysis problems can be modeled as a constrained optimization problem characterized by nonsmooth functionals, often because of the presence of ${\ell }_1$-regularization terms. One of the most effective ways to solve such problems is through the Alternate Direction Method of Multipliers (ADMM), which has been proved to have good theoretical convergence properties even if the arising subproblems are solved inexactly. Nevertheless, experience shows that the choice of the parameter $\tau$ penalizing the constraint violation in the Augmented Lagrangian underlying ADMM affects the method’s performance. To this end, strategies for the adaptive selection of such parameter have been analyzed in the literature and are still of great interest. In this paper, starting from an adaptive spectral strategy recently proposed in the literature, we investigate the use of different strategies based on Barzilai–Borwein-like stepsize rules. We test the effectiveness of the proposed strategies in the solution of real-life consensus logistic regression and portfolio optimization problems. Full article

In this paper, we propose two scaled Dai–Yuan (DY) directions for solving constrained monotone nonlinear systems. The proposed directions satisfy the sufficient descent condition independent of the line search strategy. We also reasonably proposed two different relations for computing the scaling parameter at every iteration. The first relation is proposed by approaching the quasi-Newton direction, and the second one is by taking the advantage of the popular Barzilai–Borwein strategy. Moreover, we propose a robust projection-based algorithm for solving constrained monotone nonlinear equations with applications in signal restoration problems and reconstructing the blurred images. The global convergence of this algorithm is also provided, using some mild assumptions. Finally, a comprehensive numerical comparison with the relevant algorithms shows that the proposed algorithm is efficient. Full article

The extreme value theory is expanded by proposing and studying a new version of the Fréchet model. Some new bivariate type extensions using Farlie–Gumbel–Morgenstern copula, modified Farlie–Gumbel–Morgenstern copula, Clayton copula, and Renyi’s entropy copula are derived. After a quick study for its properties, different non-Bayesian estimation methods under uncensored schemes are considered, such as the maximum likelihood estimation method, Anderson–Darling estimation method, ordinary least square estimation method, Cramér–von-Mises estimation method, weighted least square estimation method, left-tail Anderson–Darling estimation method, and right-tail Anderson–Darling estimation method. Numerical simulations were performed for comparing the estimation methods using different sample sizes for three different combinations of parameters. The Barzilai–Borwein algorithm was employed via a simulation study. Three applications were presented for measuring the flexibility and the importance of the new model for comparing the competitive distributions under the uncensored scheme. Using the approach of the Bagdonavicius–Nikulin goodness-of-fit test for validation under the right censored data, we propose a modified chi-square goodness-of-fit test for the new model. The modified goodness-of-fit statistic test was applied for the right censored real data set, called leukemia free-survival times for autologous transplants. Based on the maximum likelihood estimators on initial data, the modified goodness-of-fit test recovered the loss in information while the grouping data and followed chi-square distributions. All elements of the modified goodness-of-fit criteria tests are explicitly derived and given. Full article

After defining a new log-logistic model and studying its properties, some new bivariate type versions using “Farlie-Gumbel-Morgenstern Copula”, “modified Farlie-Gumbel-Morgenstern Copula”, “Clayton Copula”, and “Renyi’s entropy Copula” are derived. Then, using the Bagdonavicius-Nikulin goodness-of-fit (BN-GOF) test for validation, we proposed a goodness-of-fit test for a new log-logistic model. The modified test is applied for the “right censored” real dataset of survival times. All elements of the modified test are explicitly derived and given. Three real data applications are presented for measuring the flexibility and the importance of the new model under the uncensored scheme. Two other real datasets are analyzed for censored validation. Full article

In time-of-arrival (TOA)-based source localization, accurate positioning can be achieved only when the correct signal propagation time between the source and the sensors is obtained. In practice, a clock error usually exists between the nodes causing the source and sensors to often be in an asynchronous state. This leads to the asynchronous source localization problem which is then formulated to a least square problem with nonconvex and nonsmooth objective function. The state-of-the-art algorithms need to relax the original problem to convex programming, such as semidefinite programming (SDP), which results in performance loss. In this paper, unlike the existing approaches, we propose a proximal alternating minimization positioning (PAMP) method, which minimizes the original function without relaxation. Utilizing the biconvex property of original asynchronous problem, the method divides it into two subproblems: the clock offset subproblem and the synchronous source localization subproblem. For the former we derive a global solution, whereas the later is solved by a proposed efficient subgradient algorithm extended from the simulated annealing-based Barzilai–Borwein algorithm. The proposed method obtains preferable localization performance with lower computational complexity. The convergence of our method in Lyapunov framework is also established. Simulation results demonstrate that the performance of PAMP method can be close to the optimality benchmark of Cramér–Rao Lower Bound. Full article

In this paper, we propose a two-step iterative algorithm based on projection technique for solving system of monotone nonlinear equations with convex constraints. The proposed two-step algorithm uses two search directions which are defined using the well-known Barzilai and Borwein (BB) spectral parameters.The BB spectral parameters can be viewed as the approximations of Jacobians with scalar multiple of identity matrices. If the Jacobians are close to symmetric matrices with clustered eigenvalues then the BB parameters are expected to behave nicely. We present a new line search technique for generating the separating hyperplane projection step of Solodov and Svaiter (1998) that generalizes the one used in most of the existing literature. We establish the convergence result of the algorithm under some suitable assumptions. Preliminary numerical experiments demonstrate the efficiency and computational advantage of the algorithm over some existing algorithms designed for solving similar problems. Finally, we apply the proposed algorithm to solve image deblurring problem. Full article

The reconstruction for limited-view scanning, though often the case in practice, has remained a difficult issue for photoacoustic imaging (PAI). The incompleteness of sampling data will cause serious artifacts and fuzziness in those missing views and it will heavily affect the quality of the image. To solve the problem of limited-view PAI, a compensation method based on the Gerchberg–Papoulis (GP) extrapolation is applied into PAI. Based on the known data, missing detectors elements are estimated and the image in the missing views is then compensated using the Fast Fourier Transform (FFT). To accelerate the convergence speed of the algorithm, the total variation (TV)-based iterative algorithm is incorporated into the GP extrapolation-based FFT-utilized compensation method (TV-GPEF). The effective variable splitting and Barzilai–Borwein based method is adopted to solve the optimization problem. Simulations and in vitro experiments for both limited-angle circular scanning and straight-line scanning are conducted to validate the proposed algorithm. Results show that the proposed algorithm can greatly suppress the artifacts caused by the missing views and enhance the edges and the details of the image. It can be indicated that the proposed TV-GPEF algorithm is efficient for limited-view PAI. Full article