Fractional-order derivative is attracting more and more attention of researchers in image processing because of its better property in restoring more texture than the total variation. To improve the performance of fra...
详细信息
Fractional-order derivative is attracting more and more attention of researchers in image processing because of its better property in restoring more texture than the total variation. To improve the performance of fractional-order variation model in image restoration, a truncated fractional-order variation model was proposed in Chan and Liang [Truncated fractional-order variation model for image restoration, J. Oper. Res. Soc. China]. In this paper, we propose a dual approach to solve this truncated fractional-order variation model on noise removal. The proposed algorithm is based on the dual approach proposed by Chambolle [An algorithm for total variation minimisation and applications, J. Math Imaging Vis. 20 (2004), pp. 89-97]. Conversely, the Chambolle's dual approach can be treated as a special case of the proposed algorithm with fractional order . The work of this paper modifies the result in Zhang et al. [Adaptive fractional-order multi-scale method for image denoising, J. Math. Imaging Vis. 43(1) (2012), pp. 39-49. Springer Netherlands 0924-9907, Computer Science, pp. 1-11, 2011], where the convergence is not analysed. Based on the truncation, the convergence of the proposed dual method can be analysed and the convergence criteria can be provided. In addition, the accuracy of the reconstruction is improved after the truncation is taken.
dual algorithms are ideally suited for the purpose of topology optimization since they work in the space of Lagrange multipliers associated with the constraints. To date, dual algorithms have been applied only for lin...
详细信息
dual algorithms are ideally suited for the purpose of topology optimization since they work in the space of Lagrange multipliers associated with the constraints. To date, dual algorithms have been applied only for linear structures. Here we extend this methodology to the case of non-linear structures. The perimeter constraint is used to make the topology problem well-posed. We show that the proposed algorithm yields a value of perimeter that is close to that specified by the user. We also address the issue of manufacturability of these designs, by proposing a variant of the standard dual algorithm, which generates designs that are two-dimensional although the loading and the geometry are three-dimensional. Copyright (C) 2008 John Wiley & Sons, Ltd.
This paper is intended as a companion to [12] and focuses on the numerical implementations of the method in the context of insurance problems with mixed controls: reinsurance acting as continuous control, and capital ...
详细信息
This paper is intended as a companion to [12] and focuses on the numerical implementations of the method in the context of insurance problems with mixed controls: reinsurance acting as continuous control, and capital injection and dividend payment acting as singular ones. The aim is twofold. On the one hand, we provide a comparison of the output of our method in terms of the optimal value against two benchmarks. The first benchmark is provided by [4] in the noreinsurance setting and when the claims are exponentially distributed. The second benchmark refers to [8] where capital injections are not permitted, but different claim distributions can be employed. On the other hand, we illustrate the improvement of the models in [8] when capital injection is allowed. We also look into the effect of reinsurance in the model [4]. Several cases for the equity cost parameter are discussed as are the boundary (or limit) situations.
Most of local region-based active contour models in terms of the level set approach are able to segment images with intensity inhomogeneity. However, these models do not utilize global statistical information and are ...
详细信息
Most of local region-based active contour models in terms of the level set approach are able to segment images with intensity inhomogeneity. However, these models do not utilize global statistical information and are quite sensitive to the initial placement of the contour. This paper presents a new global and local region-based active contour model to segment images with intensity inhomogeneity. First, in order to reduce number of iterations, the global energy functional of the Chan-Vese (C-V) model is used as the global term. Then, the local term is proposed to incorporate both local spatial information and local intensity information to handle intensity inhomogeneity. Moreover, to increase robustness of the initialization of the contour and reduce number of iterations, a convex energy functional and the dual algorithm are designed in the numerical implementation. Experimental results for synthetic and medical images have shown the efficiency and robustness of the proposed method. (C) 2017 Elsevier Ltd. All rights reserved.
We apply the dual algorithm of Chambolle for the minimization of the LLT model. A convergence theorem is given for the proposed algorithm. The algorithm overcomes the numerical difficulties related to the non-differen...
详细信息
We apply the dual algorithm of Chambolle for the minimization of the LLT model. A convergence theorem is given for the proposed algorithm. The algorithm overcomes the numerical difficulties related to the non-differentiability of the LLT model. The dual algorithm is faster than the original gradient descent algorithm. Numerical experiments are supplied to demonstrate the efficiency of the algorithm.
In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of...
详细信息
In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Tucker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.
This paper studies the properties of a class of nonlinear Lagrangians for nonlinear programming with inequality constraints. It's shown that under a set of conditions this class of Lagrange algorithm is locally co...
详细信息
ISBN:
(纸本)1424403316
This paper studies the properties of a class of nonlinear Lagrangians for nonlinear programming with inequality constraints. It's shown that under a set of conditions this class of Lagrange algorithm is locally convergent when the penalty parameter is larger than a threshold. An error bound estimate of the solution, depending on the penalty, is also established. The paper also discusses the properties of the dual function associated with the proposed nonlinear Lagrangians. Finally, the dual algorithm corresponding to the proposed nonlinear Lagrangians is developed and used to solve some numerical examples by using the nonlinear Lagrangians in the literature. Numerical results suggest that the dual algorithm is effective for solving nonlinear programming.
This paper focuses on linearisation techniques for a class of mixed singular/continuous control problems and ensuing algorithms. The motivation comes from (re)insurance problems with reserve-dependent premiums with Cr...
详细信息
This paper focuses on linearisation techniques for a class of mixed singular/continuous control problems and ensuing algorithms. The motivation comes from (re)insurance problems with reserve-dependent premiums with Cramer-Lundberg claims, by allowing singular dividend payments and capital injections. Using variational techniques and embedding the trajectories in an appropriate family of occupation measures, we provide the linearisation of such problems in which the continuous control is given by reinsurance policies and the singular one by dividends and capital injections. The linearisation translates into a dual dynamic programming (DDP) algorithm. An important part of the paper is dedicated to structural considerations allowing reasonable implementation. We also hint connections to methods relying on moment sum of squares and LMI (linear matrix inequality)-relaxations to approximate the optimal candidates.
Parabolic trough systems require accurate, reliable, and robust solar trackers to achieve their maximum thermal efficiency. This paper presents a dual closed-loop control strategy for single-axis solar trackers of par...
详细信息
Parabolic trough systems require accurate, reliable, and robust solar trackers to achieve their maximum thermal efficiency. This paper presents a dual closed-loop control strategy for single-axis solar trackers of parabolic trough systems. This strategy consists of the use of a dual control feedback through the integration of a typical photodiode-based solar sensors, to perform the coarse control, and a proposed shadow-based visual device that performs the fine position adjustment. A comparative analysis between a simple closed-loop control, typically used in parabolic trough systems, and the proposed control algorithm was conducted. Experimental tests were carried out for several days under different weather conditions. The experimental results showed that the mean solar tracking error obtained with the simple control was 0.97 degrees, while the error of the proposed dual control was 0.21 degrees;i.e., the error decreased by 78%, demonstrating greater stability and robustness of solar tracking. The proposed strategy proved to be a technically and economically feasible option to increase accuracy, reliability, and robustness in single-axis solar tracking systems of parabolic trough systems.
作者:
Pan, PQSE Univ
Dept Math Nanjing 210018 Peoples R China
Recently, a linear programming problem solver, called dual projective simplex method, was proposed (Pan, Computers and Mathematics with Applications, vol. 35, no. 6, pp. 119-135, 1998). This algorithm requires a crash...
详细信息
Recently, a linear programming problem solver, called dual projective simplex method, was proposed (Pan, Computers and Mathematics with Applications, vol. 35, no. 6, pp. 119-135, 1998). This algorithm requires a crash procedure to provide an initial (normal or deficient) basis. In this paper, it is recast in a more compact form so that it can get itself started from scratch with any dual (basic or nonbasic) feasible solution. A new dual Phase-1 approach for producing such a solution is proposed. Reported are also computational results obtained with a set of standard NETLIB problems.
暂无评论