Weak infeasibility in second order cone programming (Q518144): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5852055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916398 / 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 Duality in Semidefinite Programming Based on Elementary Reformulations / 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: Applications of second-order cone programming / 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: Solving SDP completely with an interior point oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / 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: Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals / 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: Convex Analysis / 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: 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

Latest revision as of 13:52, 13 July 2024

scientific article
Language Label Description Also known as
English
Weak infeasibility in second order cone programming
scientific article

    Statements

    Weak infeasibility in second order cone programming (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2017
    0 references
    weak infeasibility
    0 references
    second-order cone programming
    0 references
    feasibility problem
    0 references

    Identifiers