An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450): 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: Second-order cone programming / 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: Euclidean Jordan algebras and interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order 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: 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: Extension of primal-dual interior point algorithms to symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications / 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

Latest revision as of 17:25, 8 July 2024

scientific article; zbMATH DE number 6315992
Language Label Description Also known as
English
An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
scientific article; zbMATH DE number 6315992

    Statements

    An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2014
    0 references
    second-order cone programming
    0 references
    path-following interior-point method
    0 references
    wide neighbourhood
    0 references
    iteration complexity bound
    0 references
    convex optimization
    0 references
    second-order Lorentz cones
    0 references
    Nesterov-Todd search direction
    0 references
    convergence
    0 references
    algorithm
    0 references

    Identifiers

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