An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-016-0997-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2291100075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / 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
Property / cites work
 
Property / cites work: Q4321748 / 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: Barrier Functions in Interior Point Methods / 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: High-order predictor-corrector algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones / 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: 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: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time second order mehrotra-type predictor--corrector algorithms / 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: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial arc-search interior-point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial arc-search interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank

Latest revision as of 00:58, 14 July 2024

scientific article
Language Label Description Also known as
English
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
scientific article

    Statements

    An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2017
    0 references
    Euclidean Jordan algebra
    0 references
    symmetric optimization
    0 references
    arc-search
    0 references
    infeasible-interior-point method
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers