This is the authors' abstract. We don't add key points for this paper.
We consider a class of interior point algorithms for minimizing a twice continuously differentiable function over a closed convex set with nonempty interior. On one hand, our algirothms can be viewed as an approximate version of the generalized proximal point methods and, on the other hand, as an extension of unconstrained Newton-type methods to the constrained case. Each step consists of solving a strongly convex unconstrained program followed by a one-dimensional search along either a line or a curve segment in the interior of the feasible set. The information about the feasible set is contained in the generalized distance function whose gradient diverges on the boundary of this set. When the feasible set is the whole space, the standard regularized Newton method is a particular case in our framework. We show, under standard assumptions, that every accumulation point of the sequence of iterates satisfies a first order necessary optimality condition for the problem and solves the problem if the objective function is convex. Some computational results are also reported
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Iusem et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: