This paper presents a global optimization algorithm for solving the signomial geometric programming (SGP) problem. In the algorithm, by the straight forward algebraic manipulation of terms and by utilizing a transformation of variables, the initial nonconvex programming problem (SGP) is first converted into an equivalent monotonic optimization problem and then is reduced to a sequence of linear programming problems, based on the linearizing technique. To improve the computational efficiency of the algorithm, two range reduction operations are combined in the branch and bound procedure. The proposed algorithm is convergent to the global minimum of the (SGP) by means of the subsequent solutions of a series of relaxation linear programming problems. And finally, the numerical results are reported to vindicate the feasibility and effectiveness of the proposed method.
We present a branch and bound algorithm for globally solving the sum of ratios problem. In this problem, each term in the objective function is a ratio of two functions which are the sums of the absolute values of affine functions with coefficients. This problem has an important application in financial optimization, but the global optimization algorithm for this problem is still rare in the literature so far. In the algorithm we presented, the branch and bound search undertaken by the algorithm uses rectangular partitioning and takes place in a space which typically has a much smaller dimension than the space to which the decision variables of this problem belong. Convergence of the algorithm is shown. At last, some numerical examples are given to vindicate our conclusions.
This paper is concerned with an efficient global optimization algorithm for solving a kind of fractional program problem(P), whose objective and constraints functions are all defined as the sum of ratios generalized polynomial functions. The proposed algorithm is a combination of the branch-and-bound search and two reduction operations, based on an equivalent monotonic optimization problem of(P). The proposed reduction operations specially offer a possibility to cut away a large part of the currently investigated region in which the global optimal solution of(P)does not exist, which can be seen as an accelerating device for the solution algorithm of(P). Furthermore, numerical results show that the computational efficiency is improved by using these operations in the number of iterations and the overall execution time of the algorithm, compared with other methods. Additionally, the convergence of the algorithm is presented, and the computational issues that arise in implementing the algorithm are discussed. Preliminary indications are that the algorithm can be expected to provide a practical approach for solving problem(P)provided that the number of variables is not too large.
In this paper, we are concerned with the Cauchy problem for the modified Novikov equation. By using the transport equation theory and Littlewood-Paley decomposition as well as nonhomogeneous Besov spaces, we prove that the Cauchy problem for the modified Novikov equation is locally well posed in the Besov space B s p,r with 1 ≤ p, r ≤ +∞ and s > max{1 + 1 p , 3 2 } and show that the Cauchy problem for the modified Novikov equation is locally well posed in the Besov space B 3/2 2,1 with the aid of Osgood lemma.
The purpose of this paper is to introduce the following new general implicit iteration scheme for approximating the common fixed points of a pair of nonexpansive mappings in a uniformly convex Banach space: for any x 0 ∈ C, the iterative process {x n } defined by x n = a n x n-1 + b n Ty n + c n Sx n , y n = a n x n-1 + b n x n + c n Sx n-1 + d n Tx n , where {a n }, {b n }, {c n }, {a n }, {b n }, {c n }, {d n } are seven sequences of real numbers satisfying a n + b n + c n = 1, a n + b n + c n + d n = 1, and T, S : C → C are two nonexpansive mappings. We approximate the common fixed points of these two mappings by weak and strong convergence of the scheme.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.