Approximating Geometric Optimization with l_p-Norm Optimization

Approximating Geometric Optimization with l_p-Norm Optimization (2000)

by François Glineur , Faculte Polytechnique De Mons , Rue De Houdain , B- Mons

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Approximating Geometric Optimization with l_p-Norm Optimization	user correction - Legacy Corrections
AUTHOR NAME	François Glineur	user correction - Legacy Corrections
AUTHOR NAME	Faculte Polytechnique De Mons	user correction - Legacy Corrections
AUTHOR NAME	Rue De Houdain	user correction - Legacy Corrections
AUTHOR NAME	B- Mons	user correction - Legacy Corrections
ABSTRACT	In this article, we demonstrate how to approximate geometric optimization with l p - norm optimization. These two categories of problems are well known in structured convex optimization. We describe a family of l p -norm optimization problems that can be made arbitrarily close to a geometric optimization problem, and show that the dual problems for these approximations are also approximating the dual geometric optimization problem. Finally, we use these approximations and the duality theory for l p -norm optimization to derive simple proofs of the weak and strong duality theorems for geometric optimization.	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	12 found	ParsCit 1.0