A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search directions in interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method 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: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scaling technique for finding the weighted analytic center of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank

Revision as of 09:32, 24 May 2024

scientific article
Language Label Description Also known as
English
A primal-dual interior-point method for linear programming based on a weighted barrier function
scientific article

    Statements

    A primal-dual interior-point method for linear programming based on a weighted barrier function (English)
    0 references
    0 references
    0 references
    6 February 1996
    0 references
    polynomial convergence
    0 references
    quadratic convergence
    0 references
    superlinear convergence
    0 references
    interior-point methods
    0 references
    primal-dual interior-point method
    0 references
    modified least-squares problem
    0 references
    0 references

    Identifiers