Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
From MaRDI portal
(Redirected from Publication:1372544)
Recommendations
- Nonsmooth invex functions and sufficient optimality conditions
- On optimality conditions in nonsmooth inequality constrained minimization
- Optimality conditions in nonconvex and nonsmooth optimization revisited
- scientific article; zbMATH DE number 4180188
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- scientific article; zbMATH DE number 1099081
- Sufficient Conditions for Nonsmoothr-Invexity
- scientific article; zbMATH DE number 1805987
- Optimality conditions and duality theorems for non-Lipschitz optimization problems
Cites work
- scientific article; zbMATH DE number 176973 (Why is no real title available?)
- scientific article; zbMATH DE number 3498613 (Why is no real title available?)
- scientific article; zbMATH DE number 753963 (Why is no real title available?)
- scientific article; zbMATH DE number 817396 (Why is no real title available?)
- A Note on The Zagrodny Mean Value Theorem
- Characterization of Lower Semicontinuous Convex Functions
- Convergence of diagonally stationary sequences in convex optimization
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- Lipschitzian properties of multifunctions
- Metric regularity, openness and Lipschitzian behavior of multifunctions
- Monotone Operators and the Proximal Point Algorithm
- On the variational principle
- On uniformly convex functions
- Open mapping theorem and inversion theorem for γ-paraconvex multivalued mappings and applications
- Regularity and Stability for Convex Multivalued Functions
- The perturbed proximal point algorithm and some of its applications
- Upper-Lipschitz multifunctions and inverse subdifferentials
- Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps
- Well-posedness, condition number, and good asymptotic behaviour
Cited in
(22)- Error bound results for convex inequality systems via conjugate duality
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- From error bounds to the complexity of first-order descent methods for convex functions
- Error bound characterizations of the conical constraint qualification in convex programming
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convexity and variational analysis
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- Bounded linear regularity of convex sets in Banach spaces and its applications
- Codifferential calculus
- Equivalent properties of global weak sharp minima with applications
- Error bounds: necessary and sufficient conditions
- Exact penalty and error bounds in DC programming
- Error bounds for convex differentiable inequality systems in Banach spaces
- Perturbation of error bounds
- The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
- Weakly upper Lipschitz multifunctions and applications in parametric optimization
- Nonlinear error bounds for lower semicontinuous functions on metric spaces
- Nonlinear metric subregularity
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Estimates of error bounds for some sets of efficient solutions of a set-valued optimization problem
- Multistage bilevel programming problems
- Error bounds for vector-valued functions: necessary and sufficient conditions
This page was built for publication: Conditioning and upper-Lipschitz inverse subdifferentials in nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372544)
