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)