A condition number theorem in convex programming without uniqueness

zbMATH Open1360.90242MaRDI QIDQ3179429FDOQ3179429

Authors: Tullio Zolezzi 

Publication date: 21 December 2016

Full work available at URL: http://www.heldermann.de/JCA/JCA23/JCA234/jca23047.htm#jca224

Recommendations

• A condition number theorem in convex programming
• A partial condition number theorem in mathematical programming
• On condition number theorems in mathematical programming
• scientific article; zbMATH DE number 3934789
• Conditions of existence and uniqueness of a solution of problems of convex programming

zbMATH Keywords

convex programminggeneralized differentiationset-valued analysiscondition number theorem

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Cited In (7)

• On condition number theorems in mathematical programming
• Title not available (Why is that?)
• Condition numbers and error bounds in convex programming
• Title not available (Why is that?)
• On an Extension of Condition Number Theory to Nonconic Convex Optimization
• Some results on condition numbers in convex multiobjective optimization
• Conditioning of Convex Programs from a Primal-Dual Perspective

This page was built for publication: A condition number theorem in convex programming without uniqueness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179429)