A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Neighborhood-following algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(Q\) method for symmetric cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Jordan algebras and interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: 对称锥规划的邻域跟踪算法 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / 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: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of primal-dual interior point algorithms to symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming / rank
 
Normal rank

Latest revision as of 08:15, 14 July 2024

scientific article
Language Label Description Also known as
English
A new infeasible-interior-point algorithm for linear programming over symmetric cones
scientific article

    Statements

    A new infeasible-interior-point algorithm for linear programming over symmetric cones (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2017
    0 references
    symmetric cone
    0 references
    Euclidean Jordan algebra
    0 references
    interior-point methods
    0 references
    linear programming
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references