Displaying similar documents to “Numerical considerations of a hybrid proximal projection algorithm for solving variational inequalities”

Approximating solutions of split equality of some nonlinear optimization problems using an inertial algorithm

Lateef O. Jolaoso, Oluwatosin T. Mewomo (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This paper presents an inertial iterative algorithm for approximating a common solution of split equalities of generalized mixed equilibrium problem, monotone variational inclusion problem, variational inequality problem and common fixed point problem in real Hilbert spaces. The algorithm is designed in such a way that it does not require prior knowledge of the norms of the bounded linear operators. We prove a strong convergence theorem under some mild conditions of the control sequences...

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

A new nonmonotone adaptive trust region algorithm

Ahmad Kamandi, Keyvan Amini (2022)

Applications of Mathematics

Similarity:

We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for adjusting the trust region radius that avoids undesirable directions and exploits a new strategy to prevent sudden increments of objective function values in nonmonotone trust region techniques. Global convergence of this algorithm is investigated under some mild...

A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function

Pang, Li-Ping, Xia, Zun-Quan (2003)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 90C25, 68W10, 49M37. A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function and an ε-descent...