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...
| Główni autorzy: | , |
|---|---|
| Format: | Report |
| Wydane: |
Unspecified
2007
|
| _version_ | 1826297055998377984 |
|---|---|
| author | Cartis, C Gould, N |
| author_facet | Cartis, C Gould, N |
| author_sort | Cartis, C |
| collection | OXFORD |
| description | 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 interior point method theory that implies the existence of the central path - our initial method (Algorithm 1) is globally Q-linearly and asymptotically Q-quadratically convergent, with a provable worst-case iteration complexity bound. When this assumption is not met, the numerical behaviour of Algorithm 1 is highly disappointing, even when the problem is primal-dual feasible. This is due to the presence of implicit equalities, inequality constraints that hold as equalities at all the feasible points. Controlled perturbations of the inequality constraints of the primal-dual problems are introduced - geometrically equivalent to enlarging the primal-dual feasible region and then systematically contracting it back to its initial shape - in order for the perturbed problems to satisfy the assumption. Thus Algorithm 1 can successfully be employed to solve each of the perturbed problems. We show that, when there exist primal-dual strictly feasible points of the original problems, the resulting method, Algorithm 2, finds such a point in a finite number of changes to the perturbation parameters. When implicit equalities are present, but the original problem and its dual are feasible, Algorithm 2 asymptotically detects all the primal-dual implicit equalities and generates a point in the relative interior of the primal-dual feasible set. Algorithm 2 can also asymptotically detect primal-dual infeasibility. Successful numerical experience with Algorithm 2 on linear programs from NETLIB and CUTEr, both with and without any significant preprocessing of the problems, indicates that Algorithm 2 may be used as an algorithmic preprocessor for removing implicit equalities, with theoretical guarantees of convergence. |
| first_indexed | 2024-03-07T04:25:47Z |
| format | Report |
| id | oxford-uuid:cc91bae2-2b8d-48d6-be48-9e6a0fa5f9a9 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T04:25:47Z |
| publishDate | 2007 |
| publisher | Unspecified |
| record_format | dspace |
| spelling | oxford-uuid:cc91bae2-2b8d-48d6-be48-9e6a0fa5f9a92022-03-27T07:22:53ZFinding a point in the relative interior of a polyhedronReporthttp://purl.org/coar/resource_type/c_93fcuuid:cc91bae2-2b8d-48d6-be48-9e6a0fa5f9a9Mathematical Institute - ePrintsUnspecified2007Cartis, CGould, NA 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 interior point method theory that implies the existence of the central path - our initial method (Algorithm 1) is globally Q-linearly and asymptotically Q-quadratically convergent, with a provable worst-case iteration complexity bound. When this assumption is not met, the numerical behaviour of Algorithm 1 is highly disappointing, even when the problem is primal-dual feasible. This is due to the presence of implicit equalities, inequality constraints that hold as equalities at all the feasible points. Controlled perturbations of the inequality constraints of the primal-dual problems are introduced - geometrically equivalent to enlarging the primal-dual feasible region and then systematically contracting it back to its initial shape - in order for the perturbed problems to satisfy the assumption. Thus Algorithm 1 can successfully be employed to solve each of the perturbed problems. We show that, when there exist primal-dual strictly feasible points of the original problems, the resulting method, Algorithm 2, finds such a point in a finite number of changes to the perturbation parameters. When implicit equalities are present, but the original problem and its dual are feasible, Algorithm 2 asymptotically detects all the primal-dual implicit equalities and generates a point in the relative interior of the primal-dual feasible set. Algorithm 2 can also asymptotically detect primal-dual infeasibility. Successful numerical experience with Algorithm 2 on linear programs from NETLIB and CUTEr, both with and without any significant preprocessing of the problems, indicates that Algorithm 2 may be used as an algorithmic preprocessor for removing implicit equalities, with theoretical guarantees of convergence. |
| spellingShingle | Cartis, C Gould, N Finding a point in the relative interior of a polyhedron |
| title | Finding a point in the relative interior of a polyhedron |
| title_full | Finding a point in the relative interior of a polyhedron |
| title_fullStr | Finding a point in the relative interior of a polyhedron |
| title_full_unstemmed | Finding a point in the relative interior of a polyhedron |
| title_short | Finding a point in the relative interior of a polyhedron |
| title_sort | finding a point in the relative interior of a polyhedron |
| work_keys_str_mv | AT cartisc findingapointintherelativeinteriorofapolyhedron AT gouldn findingapointintherelativeinteriorofapolyhedron |