The purposes of this paper are to establish and study the convergence of a new gradient scheme with penalization terms called rapid gradient penalty algorithm (RGPA) for minimizing a convex differentiable function over the set of minimizers of a convex differentiable constrained function. Under the observation of some appropriate choices for the available properties of the considered functions and scalars, we can generate a suitable algorithm that weakly converges to a minimal solution of the considered constraint minimization problem. Further, we also provide a numerical example to compare the rapid gradient penalty algorithm (RGPA) and the algorithm introduced by Peypouquet [20]. [ABSTRACT FROM AUTHOR]
The purpose of the present paper is to investigate some argument properties for certain analytic functions in the open unit disk. The main results presented in here generalize some previous those concerning starlike function of reciprocal of order beta and strongly starlike functions. [ABSTRACT FROM AUTHOR]
Published
2021
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.