A Subgradient Algorithm for Solving K-Convex Inequalities.

摘要

An algorithm is presented for solving a system of K-convex inequalities. The method requires the computation of a subgradient of the system at each iteration, but differentiability is not required. Global convergence, at least linear and sometimes quadratic, is shown to hold if the inequalities are regular. (Author)