Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58832847, #quickstatements; #temporary_batch_1711565664090
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-007-9264-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Numerical solution of saddle point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Scientific Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953319 / 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: Stopping criteria for inner iterations in inexact potential reduction methods: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential-reduction methods in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / 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 / DOI
 
Property / DOI: 10.1007/S10957-007-9264-3 / rank
 
Normal rank

Latest revision as of 22:35, 18 December 2024

scientific article
Language Label Description Also known as
English
Convergence analysis of an inexact potential reduction method for convex quadratic programming
scientific article

    Statements

    Convergence analysis of an inexact potential reduction method for convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2008
    0 references
    Quadratic programming
    0 references
    Potential reduction methods
    0 references
    Inexact search directions
    0 references
    Global convergence
    0 references

    Identifiers