Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
From MaRDI portal
(Redirected from Publication:1294550)
Recommendations
Cites work
- scientific article; zbMATH DE number 4041641 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3631468 (Why is no real title available?)
- scientific article; zbMATH DE number 4123531 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 4121759 (Why is no real title available?)
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 4197759 (Why is no real title available?)
- scientific article; zbMATH DE number 3248677 (Why is no real title available?)
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- A Potential Reduction Algorithm Allowing Column Generation
- A build-up variant of the logarithmic barrier method for LP
- A central cutting plane algorithm for the convex programming problem
- A cutting plane algorithm for convex programming that uses analytic centers
- A cutting plane method from analytic centers for stochastic programming
- A logarithmic barrier cutting plane method for convex programming
- A polynomial method of approximate centers for linear programming
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- 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
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- On computing the center of a convex quadratically constrained set
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Polynomial algorithms in linear programming
- Solving combinatorial optimization problems using Karmarkar's algorithm
Cited in
(8)- scientific article; zbMATH DE number 5289787 (Why is no real title available?)
- Linear semi-infinite programming theory: an updated survey
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- scientific article; zbMATH DE number 5244807 (Why is no real title available?)
- Polynomial Interior Point Cutting Plane Methods
- Recent contributions to linear semi-infinite optimization
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294550)
