Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving Euclidean distance matrix completion problems via semidefinite progrmming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and asymptotic solvability over cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923971 / 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: Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust algorithm for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of convex optimization using geometry-based measures and a reference point / 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: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical angles in polyhedral convex cones: Numerical and statistical considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with ill-posed problems in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for critical angles in a convex cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical decomposition of a convex function / 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: Regularization Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced preprocessing techniques for linear and quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517105 / 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: On the Closedness of the Linear Image of a Closed Convex Cone / 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: Computing approximate solutions for convex conic systems of constraints / 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: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Order Conditions for General Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5666398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank Degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327443 / 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: The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Slater condition for the SDP relaxations of nonconvex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / 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: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / 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 / cites work
 
Property / cites work: Generating and measuring instances of hard semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the cone of directions of constancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of optimization in matrix theory / 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: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Zero Duality Gap and the Farkas Lemma for Conic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in linear conic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 08:20, 7 July 2024

scientific article; zbMATH DE number 6259007
Language Label Description Also known as
English
Preprocessing and Regularization for Degenerate Semidefinite Programs
scientific article; zbMATH DE number 6259007

    Statements

    Preprocessing and Regularization for Degenerate Semidefinite Programs (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2014
    0 references
    semidefinite programming
    0 references
    degeneracy
    0 references
    backward stability
    0 references
    preprocessing
    0 references
    strong duality
    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
    0 references

    Identifiers

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