A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guo-Qiang Wang / rank
 
Normal rank
Property / author
 
Property / author: Yan-Qin Bai / 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/s11741-008-0301-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W75577628 / 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: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and convergence of the central path for convex programming and some duality results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial predictor-corrector interior-point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of polynomial primal-dual interior-point algorithms for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a homogeneous algorithm for the monotone complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal‐dual interior-point method for linear optimization based on a new proximity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point techniques in optimization. Complementarity, sensitivity and algorithms / rank
 
Normal rank

Latest revision as of 19:14, 1 July 2024

scientific article; zbMATH DE number 5584618
Language Label Description Also known as
English
A new primal-dual interior-point algorithm for convex quadratic optimization
scientific article; zbMATH DE number 5584618

    Statements

    A new primal-dual interior-point algorithm for convex quadratic optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2009
    0 references
    convex quadratic optimization
    0 references
    interior-point methods
    0 references
    large-update method
    0 references
    polynomial complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references