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)