Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00245-007-9030-9 / 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/s00245-007-9030-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971164758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Schur-complement method for handling dense columns in interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient trust region method for unconstrained discrete-time optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product-form Cholesky factorization in interior point methods for second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing underlying sparsity in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Type Minimization via the Lanczos Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Quasidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00245-007-9030-9 / rank
 
Normal rank

Latest revision as of 13:32, 10 December 2024

scientific article
Language Label Description Also known as
English
Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
scientific article

    Statements

    Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    correlative sparsity
    0 references
    primal-dual interior-point method
    0 references
    linear program
    0 references
    semidefinite program
    0 references
    second-order cone program
    0 references
    partial separability
    0 references
    chordal graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers