A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ya-Guang Yang / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: LIPSOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SuitSparseQR / rank
 
Normal rank
Property / author
 
Property / author: Ya-Guang Yang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086397439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 915, SuiteSparseQR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple centrality corrections in a primal-dual method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / 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: On the Implementation of a Primal-Dual Interior Point Method / 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: Interior path following primal-dual algorithms. II: Convex quadratic 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: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOQO:an interior point code for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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 04:50, 5 July 2024

scientific article
Language Label Description Also known as
English
A polynomial arc-search interior-point algorithm for convex quadratic programming
scientific article

    Statements

    A polynomial arc-search interior-point algorithm for convex quadratic programming (English)
    0 references
    14 May 2012
    0 references
    arc-search
    0 references
    convex quadratic programming
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers