Star subgradient projection for solving quasi-convex feasibility problems
Optimization and Control
2020-01-28 v1
Abstract
In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present some useful properties. We subsequently obtain a convergence result of the considered method by using properties of the introduced nonlinear operator.
Cite
@article{arxiv.2001.09931,
title = {Star subgradient projection for solving quasi-convex feasibility problems},
author = {Nimit Nimana and Narin Petrot},
journal= {arXiv preprint arXiv:2001.09931},
year = {2020}
}
Comments
Submitted to a Conference