Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
From MaRDI portal
Publication:1294550
DOI10.1016/S0168-9274(98)00103-2zbMath0948.90137OpenAlexW1992586141MaRDI QIDQ1294550
Zhi-Quan Luo, Cornelis Roos, Tamás Terlaky
Publication date: 27 November 2000
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00103-2
Abstract computational complexity for mathematical programming problems (90C60) Semi-infinite programming (90C34)
Related Items
Recent contributions to linear semi-infinite optimization, Recent contributions to linear semi-infinite optimization: an update, Polynomial Interior Point Cutting Plane Methods, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function, Linear semi-infinite programming theory: an updated survey
Cites Work
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A polynomial method of approximate centers for linear programming
- A build-up variant of the logarithmic barrier method for LP
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- A logarithmic barrier cutting plane method for convex programming
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Complexity estimates of some cutting plane methods based on the analytic barrier
- On computing the center of a convex quadratically constrained set
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- Polynomial algorithms in linear programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- A central cutting plane algorithm for the convex programming problem
- Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
