Inspired by the very recent work by Noor and Noor [9] and given a closed convex set-valued mapping C, we propose a split algorithm for solving the problem of finding an element x∗ which is a zero of a given maximal monotone operator T such that its image, Ax∗, under a linear operator, A, is in a closed convex set C(x∗). Then, we present two strong convergence results and state some examples as ...

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of convex feasibility problem, which consists a monotone variational inequality problem and fixed point demicontractive mapping. Strong convergence theorems suggested are established under some standard conditions. Finally, implement computational tests show efficiency advantage...

An algorithm for solving convex feasibility problem for a finite family of convex sets is considered. The acceleration scheme of De Pierro (em Methodos de projeção para a resolução de sistemas gerais de equações algébricas lineares. Thesis (tese de Doutoramento), Instituto de Matemática da UFRJ, Cidade Universitária, Rio de Janeiro, Brasil, 1981), which is designed for simultaneous algorithms, ...

A definition of oblique projections onto closed convex sets that use seminorms induced by diagonal matrices which may have zeros on the diagonal is introduced. Existence and uniqueness of such projections are secured via directional affinity of the sets with respect to the diagonal matrices involved. A blockiterative algorithmic scheme for solving the convex feasibility problem, employing semin...

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some linear equality (Positivstellensatz ). This produces a witness for the desired property, from which it is reasonably easy to obtain a formal proof of the pro...

The orthogonal packing of rectangular items in an arbitrary convex region is considered in this work. The packing problem is modeled as the problem of deciding for the feasibility or infeasibility of a set of nonlinear equality and inequality constraints. A procedure based on nonlinear programming is introduced and numerical experiments which show that the new procedure is reliable are exhibite...

Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems Amir Beck & Marc Teboulle To cite this article: Amir Beck & Marc Teboulle (2003) Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems, Optimization Methods and Software, 18:4, 377-394, DOI: 10.1080/10556780310001604977 To link to this article: http:/...

In this paper, we propose two new multiple-sets split feasibility problem (MSFP) models, where the MSFP requires to find a point closest to the intersection of a family of closed convex sets in one space, such that its image under a linear transformation will be closest to the intersection of another family of closed convex sets in the image space. This problem arises in image restoration, sign...