An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Karmarkar's linear programming algorithm and Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor-corrector Methods for a Class of Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear 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: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path following method for LCP with superlinearly convergent iteration sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank

Latest revision as of 19:36, 25 June 2024

scientific article
Language Label Description Also known as
English
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
scientific article

    Statements

    An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (English)
    0 references
    0 references
    0 references
    4 June 2007
    0 references
    convex quadratic programming
    0 references
    infeasible interior point algorithm
    0 references
    Mizuno-Todd-Ye type algorithm
    0 references
    polynomial time complexity
    0 references
    convergence
    0 references

    Identifiers

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