Interior-point algorithms for semi-infinite programming
From MaRDI portal
Publication:1334960
DOI10.1007/BF01581697zbMath0831.90114OpenAlexW2007911602MaRDI QIDQ1334960
Publication date: 26 September 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581697
linear semi-infinite programminginterior point algorithmdiscretized dual problemlarge-step path-followingpotential-reduction
Related Items
A fifth bibliography of fractional programming*, A globally convergent method for semi-infinite linear programming, Recent contributions to linear semi-infinite optimization, On the numerical treatment of linearly constrained semi-infinite optimization problems, Recent contributions to linear semi-infinite optimization: an update, A new smoothing Newton-type algorithm for semi-infinite programming, Unnamed Item, Proximal interior point method for convex semi-infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A modification of Karmarkar's linear programming algorithm
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- A polynomial Newton method for linear programming
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Conical projection algorithms for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An interior point algorithm for semi-infinite linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Interior point algorithms for linear programming with inequality constraints
- A survey of search directions in interior point methods for linear programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On affine scaling and semi-infinite programming
- A polynomial method of approximate centers for linear programming
- On the number of iterations of Karmarkar's algorithm for linear programming
- Polynomial affine algorithms for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Search directions for interior linear-programming methods
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Centered Projective Algorithm for Linear Programming
- A Mesh-Independence Principle for Operator Equations and Their Discretizations
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
