A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-011-9421-3 / 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.1007/s10589-011-9421-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056573259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of the homogeneous algorithm for large-scale convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point solver for large-scale quadratic programming problems with bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further development of multiple centrality correctors for interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior-point algorithm for quadratic programming / 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: 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: An infeasible interior-point algorithm with full-Newton step for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps / 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. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-011-9421-3 / rank
 
Normal rank

Latest revision as of 19:03, 9 December 2024

scientific article
Language Label Description Also known as
English
A predictor-corrector algorithm with multiple corrections for convex quadratic programming
scientific article

    Statements

    A predictor-corrector algorithm with multiple corrections for convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    convex quadratic programming
    0 references
    primal-dual interior-point method
    0 references
    predictor-corrector
    0 references
    polynomial complexity
    0 references
    0 references

    Identifiers