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...
Egile Nagusiak: | Cartis, C, Gould, N |
---|---|
Formatua: | Report |
Argitaratua: |
Unspecified
2007
|
Antzeko izenburuak
-
Bounded-Degree Polyhedronization of Point Sets
nork: Barequet, Gill, et al.
Argitaratua: (2011) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
nork: Cartis, C, et al.
Argitaratua: (2012) -
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
nork: Cartis, C, et al.
Argitaratua: (2016) -
Transformation of polyhedrons
nork: Chen, Y, et al.
Argitaratua: (2018) -
Polyhedron models/
nork: 309959 Wenninger, Magnus J.
Argitaratua: (1970)