Generic nondegeneracy in convex optimization

DOI10.1090/S0002-9939-2010-10692-5zbMath1220.49011arXiv1005.1082MaRDI QIDQ5200177

Adrian S. Lewis, Dmitriy Drusvyatskiy

Publication date: 1 August 2011

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1082

zbMATH Keywords

normal conesubdifferentialconvex functionsHausdorff measurelower-\(\mathbb C^2\) functions

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Set-valued and variational analysis (49J53) Analytical consequences of geometric convexity (vanishing theorems, etc.) (32F32)

Related Items

Semi-algebraic functions have small subdifferentials ⋮ The degrees of freedom of partly smooth regularizers ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP

Cites Work

• Unnamed Item
• Monotone (nonlinear) operators in Hilbert space
• Chebyshev Sets, Klee Sets, and Chebyshev Centers with Respect to Bregman Distances: Recent Results and Open Problems
• Generic Optimality Conditions for Semialgebraic Convex Programs
• Optimization and nonsmooth analysis
• Lipschitz functions with prescribed derivatives and subderivatives
• Variational Analysis
• Prox-regular functions in variational analysis
• On a Conjecture of Klee and Martin for Convex Bodies
• On the generic properties of convex optimization problems in conic form

This page was built for publication: Generic nondegeneracy in convex optimization