Finding a point in the relative interior of a polyhedron
A new initialization or `Phase I' strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible points - an all-pervasive assumption in...
Главные авторы: | Cartis, C, Gould, N |
---|---|
Формат: | Report |
Опубликовано: |
Unspecified
2007
|
Схожие документы
-
Bounded-Degree Polyhedronization of Point Sets
по: Barequet, Gill, и др.
Опубликовано: (2011) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
по: Cartis, C, и др.
Опубликовано: (2012) -
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
по: Cartis, C, и др.
Опубликовано: (2016) -
Transformation of polyhedrons
по: Chen, Y, и др.
Опубликовано: (2018) -
Polyhedron models/
по: 309959 Wenninger, Magnus J.
Опубликовано: (1970)