An easy way to teach interior-point methods. (Q5932020): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initialization in semidefinite programming via a self-dual skew-symmetric embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear programming: Just be careful! / 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: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general parametric analysis approach and its implication to sensitivity analysis in interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity analysis of the primal-dual Newton method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous interrior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank

Revision as of 16:52, 3 June 2024

scientific article; zbMATH DE number 1594883
Language Label Description Also known as
English
An easy way to teach interior-point methods.
scientific article; zbMATH DE number 1594883

    Statements

    An easy way to teach interior-point methods. (English)
    0 references
    0 references
    2001
    0 references
    Linear optimization
    0 references
    Interior-point methods
    0 references
    Self-dual embedding
    0 references
    Strictly complementary solution
    0 references
    Strongly polynomial rounding procedure
    0 references
    Polynomial complexity
    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