Potential Theory and Quadratic Programming
Optimization and Control
2016-11-10 v1
Abstract
We extend the notion of some energy-type expressions based on two sets, developed in the abstract potential theory. We also give the discretized version of the quantities defined, similar to Chebyshev constant. This extension allows to apply the potential-theoretic results to infinite quadratic programming problems. Together with a cutting plane algorithm, the Chebyshev-constant method ensures that under certain conditions, the infinite problem can be reduced to semi-infinite or to finite problems.
Cite
@article{arxiv.1611.02824,
title = {Potential Theory and Quadratic Programming},
author = {Á. P. Horváth},
journal= {arXiv preprint arXiv:1611.02824},
year = {2016}
}