New stopping criteria for detecting infeasibility in conic optimization (Q1024728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / 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: Characterization of the barrier parameter of homogeneous convex cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400648 / 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: Q4324980 / 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: Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming / rank
 
Normal rank

Latest revision as of 16:53, 1 July 2024

scientific article
Language Label Description Also known as
English
New stopping criteria for detecting infeasibility in conic optimization
scientific article

    Statements