A combination of potential reduction steps and steepest descent steps for solving convex programming problems.

Published in: Numer. Linear Algebra Appl. (2002)

Keyphrases

convex programming
linear programming
convex optimization
interior point methods
solving problems
bilevel programming
primal dual
semidefinite programming
image processing
machine learning
pairwise
quadratic programming
convex functions