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)