Keywords
Interior point methodLinear programmingMathematicsPoint (geometry)Face (sociological concept)Set (abstract data type)Mathematical optimizationAlgorithmComputer scienceGeometryProgramming language
Affiliated Institutions
Related Publications
On Finding Primal- and Dual-Optimal Bases
We show that if there exists a strongly polynomial time algorithm that finds a basis which is optimal for both the primal and the dual problems, given an optimal solution for on...
Interior-Point Polynomial Algorithms in Convex Programming
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynom...
On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
In the adaptive step primal-dual interior point method for linear programming, polynomial algorithms are obtained by computing Newton directions towards targets on the central p...
Interior Methods for Nonlinear Optimization
Interior methods are an omnipresent, conspicuous feature of the constrained optimization landscape today, but it was not always so. Primarily in the form of barrier methods, int...
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming pr...
Publication Info
- Year
- 1993
- Type
- article
- Volume
- 62
- Issue
- 1-3
- Pages
- 497-515
- Citations
- 69
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
69
OpenAlex
Cite This
Sanjay Mehrotra,
Yinyu Ye
(1993).
Finding an interior point in the optimal face of linear programs.
Mathematical Programming
, 62
(1-3)
, 497-515.
https://doi.org/10.1007/bf01585180
Identifiers
- DOI
- 10.1007/bf01585180