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...
Autors principals: | Cartis, C, Gould, N |
---|---|
Format: | Report |
Publicat: |
Unspecified
2007
|
Ítems similars
-
Bounded-Degree Polyhedronization of Point Sets
per: Barequet, Gill, et al.
Publicat: (2011) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
per: Cartis, C, et al.
Publicat: (2012) -
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
per: Cartis, C, et al.
Publicat: (2016) -
Transformation of polyhedrons
per: Chen, Y, et al.
Publicat: (2018) -
Polyhedron models/
per: 309959 Wenninger, Magnus J.
Publicat: (1970)