Relaxed-Inertial Proximal Point Type Algorithms for Quasiconvex Minimization
Abstract
We propose a relaxed-inertial proximal point type algorithm for solving optimization problems consisting in minimizing strongly quasiconvex functions whose variables lie in finitely dimensional linear subspaces. A relaxed version of the method where the constraint set is only closed and convex is also discussed, and so is the case of a quasiconvex objective function. Numerical experiments illustrate the theoretical results.
Origin | Files produced by the author(s) |
---|