A primal-dual regularized interior-point method for convex quadratic programs (Q1762462): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / 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/s12532-012-0035-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033477411 / 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: HOPDM - a higher order primal-dual method for large scale linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Regularization of Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object-oriented software for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On free variables in interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / 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: Nonlinear Perturbation of Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repository of convex quadratic programming problems / 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: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Preconditioned Iterative Method for Saddlepoint Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of sparse rectangular systems using LSQR and Craig / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior proximal point algorithm for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior dual proximal point algorithm for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commentary—Interior-Point Methods: Algorithms and Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Quasidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing proximal point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank

Latest revision as of 22:49, 5 July 2024

scientific article
Language Label Description Also known as
English
A primal-dual regularized interior-point method for convex quadratic programs
scientific article

    Statements

    A primal-dual regularized interior-point method for convex quadratic programs (English)
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    symmetric indefinite linear systems
    0 references
    simultaneous proximal-point regularization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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