LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization

Photo from wikipedia

In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization. The strong… Click to show full abstract

In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization. The strong convergence of the proposed algorithm is presented. Second, we also revisit this split feasibility problem and replace the unconstrained convex optimization by a constrained convex optimization. We introduce some algorithms for two different types of objective function of the constrained convex optimization and prove some strong convergence results of the proposed algorithms. Third, we apply our algorithms for finding an equilibrium point with minimal environmental cost for a model in electricity production. Finally, we give some numerical results to illustrate the effectiveness and advantages of the proposed algorithms.

Keywords: convex optimization; split feasibility; optimization; paramonotone equilibria

Journal Title: Journal of Inequalities and Applications
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.