Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
From MaRDI portal
Publication:1372544
DOI10.1023/A:1022687412779zbMath0890.90164OpenAlexW177396124MaRDI QIDQ1372544
Publication date: 22 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022687412779
Related Items (22)
Equivalent properties of global weak sharp minima with applications ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Perturbation of error bounds ⋮ Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming ⋮ Error bound results for convex inequality systems via conjugate duality ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Exact penalty and error bounds in DC programming ⋮ Error bounds for vector-valued functions: necessary and sufficient conditions ⋮ Nonlinear error bounds for lower semicontinuous functions on metric spaces ⋮ Nonlinear metric subregularity ⋮ The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs ⋮ Bounded linear regularity of convex sets in Banach spaces and its applications ⋮ Weakly upper Lipschitz multifunctions and applications in parametric optimization ⋮ Convexity and Variational Analysis ⋮ Error bounds: necessary and sufficient conditions ⋮ Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem ⋮ Characterizations of error bounds for lower semicontinuous functions on metric spaces ⋮ Codifferential calculus ⋮ Multistage bilevel programming problems ⋮ Error bounds for convex differentiable inequality systems in Banach spaces ⋮ Error bounds for eigenvalue and semidefinite matrix inequality systems ⋮ Convergence of Prox-Regularization Methods for Generalized Fractional Programming
Cites Work
- Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps
- The perturbed proximal point algorithm and some of its applications
- Convergence of diagonally stationary sequences in convex optimization
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- On the variational principle
- Lipschitzian properties of multifunctions
- Regularity and Stability for Convex Multivalued Functions
- Characterization of Lower Semicontinuous Convex Functions
- Monotone Operators and the Proximal Point Algorithm
- Metric regularity, openness and Lipschitzian behavior of multifunctions
- Upper-Lipschitz multifunctions and inverse subdifferentials
- A Note on The Zagrodny Mean Value Theorem
- Open mapping theorem and inversion theorem for γ-paraconvex multivalued mappings and applications
- On uniformly convex functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
