1 Interior - point methods for large - scale cone programming

Abstract

In the conic formulation of a convex optimization problem the constraints are expressed as linear inequalities with respect to a possibly non-polyhedral convex cone. This makes it possible to formulate elegant extensions of interior-point methods for linear programming to general nonlinear convex optimization. Recent research on cone programming algorithms… (More)

Topics

6 Figures and Tables

Statistics

020402012201320142015201620172018
Citations per Year

70 Citations

Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Andersen20101I, title={1 Interior - point methods for large - scale cone programming}, author={Martin Andersen}, year={2010} }