A logarithmic barrier cutting plane method for convex programming (Q1904709): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected lagrangian algorithm for semi-infinite 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: Q3932564 / 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: Q3858016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes and column generation techniques with the projective algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / 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: 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 Short-Cut Potential Reduction Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / 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: A polynomial-time algorithm, based on Newton's method, for linear programming / 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: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02032162 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054876264 / rank
 
Normal rank

Latest revision as of 11:47, 30 July 2024

scientific article
Language Label Description Also known as
English
A logarithmic barrier cutting plane method for convex programming
scientific article

    Statements

    A logarithmic barrier cutting plane method for convex programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    column generation
    0 references
    decomposition
    0 references
    interior point method
    0 references
    nonsmooth optimization
    0 references
    logarithmic barrier cutting plane algorithm
    0 references
    central path of a linear relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references