Generating and measuring instances of hard semidefinite programs (Q1960189): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / 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/s10107-008-0256-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035164723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initialization in semidefinite programming via a self-dual skew-symmetric embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Trajectories in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Central Path in Semidefinite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Symmetric Rank-Revealing Decompositions via Triangular Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perturbation theory for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, complexity theory and elementary functional analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating a Rank-Revealing ULV Decomposition / 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: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite programs using preconditioned conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank

Latest revision as of 07:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Generating and measuring instances of hard semidefinite programs
scientific article

    Statements

    Generating and measuring instances of hard semidefinite programs (English)
    0 references
    0 references
    0 references
    13 October 2010
    0 references
    strict complementarity
    0 references
    primal-dual interior-point methods
    0 references
    hard numerical instances
    0 references
    complementarity nullity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers