Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal projective interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conical projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variant of the primal affine scaling algorithm for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point techniques in optimization. Complementarity, sensitivity and algorithms / 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: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling / 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: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine scaling algorithm fails for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / 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: Superlinear convergence of interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric primal-dual path-following algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sensitivity of central solutions in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nesterov--Todd Direction in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / 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: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank

Revision as of 20:17, 28 May 2024

scientific article
Language Label Description Also known as
English
Polynomial primal-dual cone affine scaling for semidefinite programming
scientific article

    Statements

    Polynomial primal-dual cone affine scaling for semidefinite programming (English)
    0 references
    0 references
    0 references
    0 references
    29 June 1999
    0 references
    semidefinite programming
    0 references
    affine scaling
    0 references
    primal-dual interior point methods
    0 references
    0 references

    Identifiers