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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Marco D'apuzzo / rank
Normal rank
 
Property / author
 
Property / author: Marco D'apuzzo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDNET / 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/s10957-007-9264-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994720245 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58832847 / 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
links / mardi / namelinks / mardi / name
 

Revision as of 21:35, 27 June 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