An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107): 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: Q4091004 / 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: Euclidean Jordan algebras and 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: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / 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 Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization / 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: Extension of primal-dual interior point algorithms to symmetric cones / 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: A wide neighborhood infeasible-interior-point method with arc-search for linear programming / 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

Revision as of 19:45, 18 July 2024

scientific article
Language Label Description Also known as
English
An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
scientific article

    Statements

    An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (English)
    0 references
    0 references
    20 March 2019
    0 references
    symmetric optimization
    0 references
    ellipsoidal approximation
    0 references
    wide neighborhood
    0 references
    interior point methods
    0 references
    polynomial complexity
    0 references
    0 references
    0 references

    Identifiers