Variational Analysis of Circular Cone Programs

This paper conducts variational analysis of circular programs, which form a new class of optimization problems in nonsymmetric conic programming important for optimization theory and its applications. First we derive explicit formulas in terms of the initial problem data to calculate various generalized derivatives/coderivatives of the projection operator associated with the circular cone. Then we apply generalized di erentiation and other tools of variational analysis to establish complete characterizations of full and tilt stability of locally optimal solutions to parameterized circular programs.



View Variational Analysis of Circular Cone Programs