Feasible region contraction interior point algorithm (Q858800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973254679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:31, 25 June 2024

scientific article
Language Label Description Also known as
English
Feasible region contraction interior point algorithm
scientific article

    Statements

    Feasible region contraction interior point algorithm (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2007
    0 references
    linear programming
    0 references
    feasible region contraction
    0 references
    barrier function
    0 references
    numerical examples
    0 references
    interior point algorithm
    0 references
    affine scaling algorithm
    0 references
    primal path-following algorithm
    0 references
    steepest descent
    0 references

    Identifiers