Geometric characterizations of Lipschitz stability for convex optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 176973 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A Generalized Newton Method for Subgradient Systems
- A unified approach to error bounds for structured convex optimization problems
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Characterization of metric regularity of subdifferentials
- Characterization of the subdifferential of some matrix norms
- Characterization of tilt stability via subgradient graphical derivative with applications to nonlinear programming
- Characterizations of tilt-stable minimizers in second-order cone programming
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Convex Analysis
- Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems
- Exact matrix completion via convex optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Full stability in finite-dimensional optimization
- Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization
- High-dimensional statistics. A non-asymptotic viewpoint
- Implicit Functions and Solution Mappings
- Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
- LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
- Model Selection and Estimation in Regression with Grouped Variables
- On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
- On Lipschitzian properties of implicit multifunctions
- On a Semismooth* Newton Method for Solving Generalized Equations
- On a globally convergent semismooth^* Newton method in nonsmooth nonconvex optimization
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Quadratic Growth and Strong Metric Subregularity of the Subdifferential via Subgradient Graphical Derivative
- Quadratic growth and critical point stability of semi-algebraic functions
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Regularization and Variable Selection Via the Elastic Net
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Second-order characterizations of tilt stability with applications to nonlinear programming
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Sharp, strong and unique minimizers for low complexity robust recovery
- Simple bounds for recovering low-complexity models
- Solution uniqueness of convex optimization problems via the radial cone
- Some continuity properties of polyhedral multifunctions
- Strongly Regular Generalized Equations
- The Lasso problem and uniqueness
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- The convex geometry of linear inverse problems
- The degrees of freedom of partly smooth regularizers
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- Tilt Stability of a Local Minimum
- Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
- Upper-Lipschitz multifunctions and inverse subdifferentials
- Variational Analysis
This page was built for publication: Geometric characterizations of Lipschitz stability for convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974659)
