Primal interior point method for minimization of generalized minimax functions.

Ladislav Luksan Ctirad Matonoha Jan Vlcek

Published in: Kybernetika (2010)

Keyphrases

interior point methods
primal dual
convex functions
linear program
linear programming
convex programming
convex optimization
interior point algorithm

linear programming problems
objective function
semidefinite programming
approximation algorithms
quasiconvex
convergence rate
simplex method
inequality constraints

variational inequalities
optimal solution
solving problems
column generation
dynamic programming
quadratic programming
reinforcement learning
computationally intensive

nonlinear programming
image restoration
np hard
high resolution
convex optimization problems
lower bound
support vector
superlinear convergence