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

Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem

Photo from wikipedia

Abstract The aim of the paper is to characterize weakly sharp solutions of a variational inequality problem. In particular, we present weak sharpness results by using primal and dual gap… Click to show full abstract

Abstract The aim of the paper is to characterize weakly sharp solutions of a variational inequality problem. In particular, we present weak sharpness results by using primal and dual gap functions, g and G, and also without considering gap functions, either. The subdifferential and locally Lipschitz properties of for are first studied since they are useful for discussing weakly sharp solutions of the variational inequality. A result of finite termination of a class of algorithms for solving the variational inequality problem is also studied.

Keywords: inequality problem; weakly sharp; sharp solutions; inequality; variational inequality

Journal Title: Optimization
Year Published: 2018

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.