Solving SDP completely with an interior point oracle (Q4999336): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DDS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sieve-SDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: frlib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3128670379 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.08065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projections of Convex Programs with Unattained Infima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of diagonally dominant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Regularization for Degenerate Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed-certificate facial reduction algorithm based on subspace intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the Carathéodory number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Domain-Driven Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Duality in Semidefinite Programming Based on Elementary Reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenable cones: error bounds without constraint qualifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial Reduction and Partial Polyhedrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak infeasibility in second order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic convex programming and self-dual embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified class of directly solvable semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bad Semidefinite Programs: They All Look the Same / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: New stopping criteria for detecting infeasibility in conic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous interrior-point algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Matrix Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the duality operator of a convex cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality and minimal representations for cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplest Semidefinite Programs are Trivial / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial reduction algorithms for conic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit solutions for interval semidefinite linear programs / rank
 
Normal rank

Latest revision as of 03:21, 26 July 2024

scientific article; zbMATH DE number 7368770
Language Label Description Also known as
English
Solving SDP completely with an interior point oracle
scientific article; zbMATH DE number 7368770

    Statements

    Solving SDP completely with an interior point oracle (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2021
    0 references
    double facial reduction
    0 references
    facial reduction
    0 references
    conic linear programming
    0 references
    semidefinite programming
    0 references
    feasibility problem
    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