An Approximation Approach to Non-strictly Convex Quadratic Semi-infinite Programming.

S. Ito Y. Liu Kok Lay Teo

Published in: J. Glob. Optim. (2004)

Keyphrases

strictly convex
semi infinite programming
optimality conditions
newton method
objective function
computational complexity
approximation algorithms
feasible set
linear programming problems
approximation methods
boundary points
high level
pairwise
scheduling problem
optimization problems
variational inequalities