Generic Optimality Conditions for Semialgebraic Convex Programs

References

• Alizadeh F., Haeberly J.-P. A., Overton M. L. Complementarity and nondegeneracy in semidefinite programming. Math. Programming (1997) 77:111–128Crossref, Google Scholar
• Basu S., Pollack R., Roy M.-F.Algorithms in Real Algebraic Geometry (2003) (Springer, Berlin) Crossref, Google Scholar
• Ben-Tal A., Nemirovski A.Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (2001) (SIAM, Philadelphia) Crossref, Google Scholar
• Bonnans J. F., Shapiro A.Perturbation Analysis of Optimization Problems (2000) (Springer, New York) Crossref, Google Scholar
• Burke J. V., Moré J. J. On the identification of active constraints. SIAM J. Numer. Anal. (1988) 25:1197–1211Crossref, Google Scholar
• Burke J. V., Lewis A.S., Overton M. L. Optimal stability and eigenvalue multiplicity. Foundations Comput. Math. (2001) 1:205–225Crossref, Google Scholar
• Clarke F. H., Ledyaev Y. S., Stern R. J., Wolenski P. R.Nonsmooth Analysis and Control Theory (1998) (Springer-Verlag, New York) Google Scholar
• Coste M. An Introduction to o-minimal geometry. (1999) . RAAG Notes, Institut de Recherche Mathématique de Rennes, Rennes, FranceGoogle Scholar
• Daniilidis A., Sagastizábal C., Solodov M. Identifying structure of nonsmooth convex functions by the bundle technique. SIAM J. Optim. (2009) 20:820–840Crossref, Google Scholar
• Dontchev A. L., Zolezzi T.Well-Posed Optimization Problems (1993) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Ewald G., Larman D. G., Rogers C. A. The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space. Mathematika (1970) 17:1–20Crossref, Google Scholar
• Ferris M. C. Finite termination of the proximal point algorithm. Math. Programming (1991) 50:359–366Crossref, Google Scholar
• Hare W. L., Lewis A. S. Identifying active constraints via partial smoothness and prox-regularity. J. Convex Anal. (2004) 11:251–266Google Scholar
• Helton J. W., Nie J. Semidefinite representation of convex sets. Math. Programming (2010) 122:21–64Crossref, Google Scholar
• Ioffe A. D. An invitation to tame optimization. SIAM J. Optim. (2009) 19:1894–1917Crossref, Google Scholar
• Ioffe A. D., Lucchetti R. Typical convex program is very well posed. Math. Programming (2005) 104:483–499Crossref, Google Scholar
• Larman D. G. On a conjecture of Klee and Martin for convex bodies. Proc. London Math. Soc. (1971) 23:668–682Corrigendum: Vol. 36, p. 86Crossref, Google Scholar
• Lee J. M.Introduction to Smooth Manifolds (2003) (Springer, New York) Crossref, Google Scholar
• Lemaréchal C., Sagastizábal C. Practical aspects of the Moreau-Yosida regularization: Theoretical preliminaries. SIAM J. Optim. (1997) 7:367–385Crossref, Google Scholar
• Lemaréchal C., Oustry F., Sagastizábal C. The 𝒰-Lagrangian of a convex function. Trans. Amer. Math. Soc. (2000) 352:711–729Crossref, Google Scholar
• Lewis A. S. Active sets, nonsmoothness and sensitivity. SIAM J. Optim. (2003) 13:702–725Crossref, Google Scholar
• Lewis A. S., Wright S. J. A proximal method for composite minimization. (2008) . arXiv:0812.0423v1Google Scholar
• Lewis A. S., Wright S. J. Identifying activity. SIAM J. Optim. (2010) . Forthcoming. arXiv:0901.2668v1Google Scholar
• Loi T. L. Thom stratifications for functions defined in o-minimal structures on (ℝ, +, ·). Comptes Rendus de l'Académie des Sciences de Paris, Série 1 (1997) 324:1391–1394Google Scholar
• Mifflin R., Sagastizábal C. Proximal points are on the fast track. J. Convex Anal. (2002) 9:563–579Google Scholar
• Mifflin R., Sagastizábal C. A VU algorithm for convex minimization. Math. Programming (2005) 104:583–608Crossref, Google Scholar
• Mordukhovich B. S.Variational Analysis and Generalized Differentiation, Vol. I, Basic Theory, and Vol. II, Applications (2006) (Springer, New York) Google Scholar
• Nocedal J., Wright S. J.Nonlinear Programming (1997) (Springer-Verlag, New York) Google Scholar
• Pataki G., Tunçel L. On the generic properties of convex optimization problems in conic form. Math. Programming (2001) 89:449–457Crossref, Google Scholar
• Phelps R. R.Convex Functions, Monotone Operators and Differentiability (1993) 13642nd ed.(Springer-Verlag, New York) Lecture Notes in MathematicsGoogle Scholar
• Robinson S. M. Constraint nondegeneracy in variational analysis. Math. Oper. Res. (2003) 28:201–232Link, Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Rockafellar R. T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. (1976) 14:877–898Crossref, Google Scholar
• Rockafellar R. T., Wets R. J.-B.Variational Analysis (1998) (Springer, Berlin) Crossref, Google Scholar
• Rogers C. A.Hausdorff Measures (1970) (Cambridge University Press, Cambridge, UK) Google Scholar
• Saigal R., Simon C. Generic properties of the complementarity problem. Math. Programming (1973) 4:324–335Crossref, Google Scholar
• Shapiro A. First and second order analysis of nonlinear semidefinite programs. Math. Programming (1997) 77:301–320Crossref, Google Scholar
• Shapiro A., Fan M. K. H. On eigenvalue optimization. SIAM J. Optim. (1995) 5:552–568Crossref, Google Scholar
• Spingarn J. E. On optimality conditions for structured families of nonlinear programming problems. Math. Programming (1982) 22:82–92Crossref, Google Scholar
• Spingarn J. E., Rockafellar R. T. The generic nature of optimality conditions in nonlinear programming. Math. Oper. Res. (1979) 4:425–430Link, Google Scholar
• Sun D. The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their consequences. Math. Oper. Res. (2006) 31:761–776Link, Google Scholar
• van den Dries L., Miller C. Geometric categories and o-minimal structures. Duke Math. J. (1996) 84:497–540Crossref, Google Scholar
• Wright S. J. Identifiable surfaces in constrained optimization. SIAM J. Control Optim. (1993) 31:1063–1079Crossref, Google Scholar