A primal affine-scaling algorithm for constrained convex programs
Clovis C. Gonzaga (clovismtm.ufsc.br)
Abstract: The affine-scaling algorithm was initially developed for linear programming problems. Its extension to problems with a nonlinear objective performs at each iteration a scaling followed by a line search along the steepest descent direction. In this paper we prove that any accumulation point generated by this algorithm when applied to a convex function is an optimal solution, under a primal non-degeneracy hypothesis and very general line search procedures.
Keywords: Interior point methods, convex programming, affine-scaling.
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Citation: Report ES-238/90, COPPE - Federal University of Rio de Janeiro, 1990. Revised in September 2002.
Entry Submitted: 09/10/2002
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|