Generic Minimizing Behavior in Semialgebraic Optimization

We present a theorem of Sard type for semialgebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the graph, for a generic value parameter. This simple result yields a transparent and unified treatment of generic properties of semialgebraic optimization problems: “typical” semialgebraic problems have finitely many critical points, around each of which they admit a unique “active manifold” (analogue of an active set in nonlinear optimization); moreover, such critical points satisfy strict complementarity and second-order sufficient conditions for optimality are indeed necessary.

[1]  S. Łojasiewicz.  Ensembles semi-analytiques , 1965 .

[2]  A. Ioffe.  Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems , 2008 .

[3]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[4]  A. Ioffe.  Metric regularity and subdifferential calculus , 2000 .

[5]  Lajos Takács,et al.  An Increasing Continuous Singular Function , 1978 .

[6]  R. Rockafellar,et al.  Implicit Functions and Solution Mappings , 2009 .

[7]  Adrian S. Lewis,et al.  Generic Optimality Conditions for Semialgebraic Convex Programs , 2011, Math. Oper. Res..

[8]  Alexander Shapiro,et al.  First and second order analysis of nonlinear semidefinite programs , 1997, Math. Program..

[9]  Dmitriy Drusvyatskiy,et al.  Generic nondegeneracy in convex optimization , 2010 .

[10]  Adrian S. Lewis,et al.  Partial Smoothness, Tilt Stability, and Generalized Hessians , 2013, SIAM J. Optim..

[11]  D. Drusvyatskiy,et al.  Second-order growth, tilt stability, and metric regularity of the subdifferential , 2013, 1304.7385.

[12]  J. Dunn.  On the convergence of projected gradient processes to singular critical points , 1987 .

[13]  Dmitriy Drusvyatskiy,et al.  Quadratic growth and critical point stability of semi-algebraic functions , 2013, Math. Program..

[14]  Gábor Pataki,et al.  On the generic properties of convex optimization problems in conic form , 2001, Math. Program..

[15]  A. Lewis,et al.  Identifying active constraints via partial smoothness and prox-regularity , 2003 .

[16]  A. Ioffe.  Variational analysis and mathematical economics 2: Nonsmooth regular economies , 2011 .

[17]  R. Thom.  Propriétés différentielles locales des ensembles analytiques , 1966 .

[18]  M. Coste.  AN INTRODUCTION TO SEMIALGEBRAIC GEOMETRY , 2002 .

[19]  R. Rockafellar,et al.  Prox-regular functions in variational analysis , 1996 .

[20]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[21]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[22]  G. Minty.  Monotone (nonlinear) operators in Hilbert space , 1962 .

[23]  Michael L. Overton,et al.  Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..

[24]  A. Lewis,et al.  The dimension of semialgebraic subdifferential graphs , 2011, 1102.4050.

[25]  Jonathan E. Spingarn.  On optimality conditions for structured families of nonlinear programming problems , 1982, Math. Program..

[26]  J. Burke.  On identification of active constraints II: the nonconvex case , 1990 .

[27]  A. D. Ioffe,et al.  An Invitation to Tame Optimization , 2008, SIAM J. Optim..

[28]  Adrian S. Lewis,et al.  Clarke Subgradients of Stratifiable Functions , 2006, SIAM J. Optim..

[29]  Dmitriy Drusvyatskiy,et al.  Semi-algebraic functions have small subdifferentials , 2010, Math. Program..

[30]  Stephen M. Robinson,et al.  Equations on monotone graphs , 2013, Math. Program..

[31]  Dmitriy Drusvyatskiy,et al.  Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential , 2012, SIAM J. Optim..

[32]  R. Tyrrell Rockafellar,et al.  Lagrange Multipliers and Optimality , 1993, SIAM Rev..

[33]  Romesh Saigal,et al.  Generic properties of the complementarity problem , 1973, Math. Program..

[34]  John M. Lee.  Introduction to Smooth Manifolds , 2002 .

[35]  Benjamin Pfaff,et al.  Perturbation Analysis Of Optimization Problems , 2016 .

[36]  Stephen M. Robinson,et al.  A point-of-attraction result for Newton's method with point-based approximations , 2011 .

[37]  R. T. Rockafellar,et al.  The Generic Nature of Optimality Conditions in Nonlinear Programming , 1979, Math. Oper. Res..

[38]  Robert Mifflin,et al.  A -algorithm for convex minimization , 2005, Math. Program..

[39]  H. Whitney.  Tangents to an Analytic Variety , 1965 .

[40]  L. Dries,et al.  Geometric categories and o-minimal structures , 1996 .

[41]  Adrian S. Lewis,et al.  Active Sets, Nonsmoothness, and Sensitivity , 2002, SIAM J. Optim..

[42]  Michael C. Ferris,et al.  Finite termination of the proximal point algorithm , 1991, Math. Program..

[43]  Dmitriy Drusvyatskiy,et al.  Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions , 2012, Math. Oper. Res..

[44]  Adrian S. Lewis,et al.  Identifying Active Manifolds , 2007, Algorithmic Oper. Res..

[45]  Sjur Didrik Flåm,et al.  On finite convergence and constraint identification of subgradient projection methods , 1992, Math. Program..

[46]  Dmitriy Drusvyatskiy,et al.  The dimension of semialgebraic subdifferential graphs , 2012 .

[47]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[48]  Stephen J. Wright,et al.  Manifold Identification in Dual Averaging for Regularized Stochastic Online Learning , 2012, J. Mach. Learn. Res..

[49]  J. Kyparisis,et al.  Finite convergence of algorithms for nonlinear programs and variational inequalities , 1991 .

[50]  Dmitriy Drusvyatskiy,et al.  Optimality, identifiability, and sensitivity , 2012, Math. Program..

[51]  Stephen J. Wright.  Identifiable Surfaces in Constrained Optimization , 1993 .