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)