|
Organizers |
A conic approach for separable convex optimization
by
François Glineur
Faculté Polytechnique de Mons
Two classes of structured convex optimization problems known as geometric optimization and lp-norm optimization have been recently studied in the framework of conic optimization, relying on the definition of dedicated convex cones.
In this talk, we present a generalization of these cones that allows us to model a wide class of separable convex problems. We also investigate the development of interior-point methods for this class of problems using the theory of self-concordant barriers.
Date received: February 21, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafv-30.