A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / 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: Q4040931 / 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: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N∞−</b> neighbourhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension of an arc-search interior-point algorithm for semidefinite optimization / 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: Q4716820 / 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: First- and second-order methods 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: 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: Q4791754 / 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: Handbook of semidefinite programming. Theory, algorithms, and applications / 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 linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Search Techniques for Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An arc-search \({\mathcal {O}}(nL)\) infeasible-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: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path / 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
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 13:00, 26 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
scientific article

    Statements

    A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (English)
    0 references
    0 references
    31 August 2021
    0 references
    semidefinite optimization
    0 references
    infeasible interior-point method
    0 references
    arc-search strategy
    0 references
    wide neighborhood
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers