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...
Główni autorzy: | Cartis, C, Gould, N |
---|---|
Format: | Report |
Wydane: |
Unspecified
2007
|
Podobne zapisy
-
Bounded-Degree Polyhedronization of Point Sets
od: Barequet, Gill, i wsp.
Wydane: (2011) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
od: Cartis, C, i wsp.
Wydane: (2012) -
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
od: Cartis, C, i wsp.
Wydane: (2016) -
Transformation of polyhedrons
od: Chen, Y, i wsp.
Wydane: (2018) -
Polyhedron models/
od: 309959 Wenninger, Magnus J.
Wydane: (1970)