A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/01630563.2010.520217 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040781450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / 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 primal-dual infeasible-interior-point algorithm for linear programming / 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point 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: Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point potential-reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:33, 3 July 2024

scientific article
Language Label Description Also known as
English
A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming
scientific article

    Statements

    A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (English)
    0 references
    0 references
    17 January 2011
    0 references
    convex quadratic programming
    0 references
    infeasible interior point algorithm
    0 references
    polynomial complexity
    0 references

    Identifiers