Interior-point method for non-linear non-convex optimization.

Ladislav Luksan Ctirad Matonoha Jan Vlcek

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

Keyphrases

convex optimization
interior point methods
primal dual
convex programming
convex optimization problems
total variation
convex relaxation
low rank
norm minimization
linear programming problems
semidefinite
feature selection
image restoration
high quality
optimization problems
quadratic programming