Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cornelis Roos / rank
 
Normal rank
Property / author
 
Property / author: Tamás Terlaky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for convex programming that uses analytic centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane method from analytic centers for stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic barrier cutting plane method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A build-up variant of the logarithmic barrier method for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Barrier Decomposition Methods for Semi-infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the center of a convex quadratically constrained set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates of some cutting plane methods based on the analytic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial method of approximate centers for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of the analytic center cutting plane method that uses multiple cuts / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0168-9274(98)00103-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992586141 / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
scientific article

    Statements

    Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2000
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers