RESUMO
In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption spectroscopy, which is a highly-nonlinear problem with variables coupling, we consider a situation where straightforward translation to a fixed point problem is not possible because the operators that represent the relevant systems of nonlinear equations are not self-mappings, i.e., they operate between spaces of different dimensions. To overcome this difficulty we suggest an "alternating common fixed points algorithm" that acts alternatingly on the different vector variables. This approach translates the original problem to a common fixed point problem for which iterative algorithms are abound and exhibits a viable alternative to translation to an optimization problem, which usually requires derivatives information. However, to apply any of these iterative algorithms requires to ascertain the conditions that appear in their convergence theorems. To circumvent the need to verify conditions for convergence, we propose and motivate a derivative-free algorithm that better suits the tomographic absorption spectroscopy problem at hand and is even further improved by applying to it the superiorization approach. This is presented along with experimental results that demonstrate our approach.
RESUMO
We study a feasibility-seeking problem with percentage violation constraints (PVCs). These are additional constraints that are appended to an existing family of constraints, which single out certain subsets of the existing constraints and declare that up to a specified fraction of the number of constraints in each subset is allowed to be violated by up to a specified percentage of the existing bounds. Our motivation to investigate problems with PVCs comes from the field of radiation therapy treatment planning (RTTP) wherein the fully discretized inverse planning problem is formulated as a split feasibility problem and the PVCs give rise to nonconvex constraints. Following the CQ algorithm of Byrne (2002, Inverse Problems, Vol. 18, pp. 441-53), we develop a string-averaging CQ-method that uses only projections onto the individual sets that are half-spaces represented by linear inequalities. The question of extending our theoretical results to the nonconvex sets case is still open. We describe how our results apply to RTTP and provide a numerical example.
RESUMO
In this paper we introduce a new self-adaptive iterative algorithm for solving the variational inequalities in real Hilbert spaces, denoted by VI ( C , F ) . Here C â H is a nonempty, closed and convex set and F : C â H is boundedly Lipschitz continuous (i.e., Lipschitz continuous on any bounded subset of C) and strongly monotone operator. One of the advantages of our algorithm is that it does not require the knowledge of the Lipschitz constant of F on any bounded subset of C or the strong monotonicity coefficient a priori. Moreover, the proposed self-adaptive step size rule only adds a small amount of computational effort and hence guarantees fast convergence rate. Strong convergence of the method is proved and a posteriori error estimate of the convergence rate is obtained. Primary numerical results illustrate the behavior of our proposed scheme and also suggest that the convergence rate of the method is comparable with the classical gradient projection method for solving variational inequalities.
RESUMO
The variational inequality problem (VIP) is considered here. We present a general algorithmic scheme which employs projections onto hyperplanes that separate balls from the feasible set of the VIP instead of projections onto the feasible set itself. Our algorithmic scheme includes the classical projection method and Fukushima's subgradient projection method as special cases.