Submonotone Subdifferentials of Lipschitz Functions
From MaRDI portal
Publication:3916771
DOI10.2307/1998411zbMath0465.26008OpenAlexW4247727674MaRDI QIDQ3916771
Publication date: 1981
Full work available at URL: https://doi.org/10.2307/1998411
nondifferentiable optimizationClarke derivativeLipschitz functionsgeneralized gradientsubmonotone mappinglower-C1 function
Variational inequalities (49J40) Monotone operators and generalizations (47H05) Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Generalized submonotonicity and approximately convexity in Riemannian manifolds ⋮ Subsmooth sets: Functional characterizations and related concepts ⋮ Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ Jets, generalised convexity, proximal normality and differences of functions ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ A nonsmooth version of Newton's method ⋮ A trust region algorithm for minimization of locally Lipschitzian functions ⋮ Links between functions and subdifferentials ⋮ Variational analysis of paraconvex multifunctions ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ Nonconvex bundle method with application to a delamination problem ⋮ Cyclic hypomonotonicity, cyclic submonotonicity, and integration ⋮ Tangencially continuous directional derivatives in nonsmooth analysis ⋮ Approximately convex functions and approximately monotonic operators ⋮ Non-smooth optimization for robust control of infinite-dimensional systems ⋮ Iteration functions in some nonsmooth optimization algorithms ⋮ Approximation and decomposition properties of some classes of locally d.c. functions ⋮ Design of a flight control architecture using a non-convex bundle method ⋮ Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature ⋮ A General Sufficiency Theorem for Nonsmooth Nonlinear Programming ⋮ Directional derivative of a minimax function ⋮ On e-convex functions and e-subdifferentials in locally convex spaces ⋮ Cutting plane oracles to minimize non-smooth non-convex functions ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ Second-order characterization of convex mappings in Banach spaces and its applications ⋮ Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems ⋮ The directional subdifferential of the difference of two convex functions ⋮ CHARACTERIZATIONS OF QUASICONVEX AND PSEUDOCONVEX FUNCTIONS BY THEIR SECOND-ORDER REGULAR SUBDIFFERENTIALS ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Approximate convexity and submonotonicity. ⋮ Weak directional closedness and generalized subdifferentials ⋮ Upper semismooth functions and the subdifferential determination property ⋮ Unnamed Item ⋮ Subdifferential characterization of approximate convexity: The lower semicontinuous case ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ Worst‐case stability and performance with mixed parametric and dynamic uncertainties ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ Minimizing memory effects of a system ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ Subdifferential representation formula and subdifferential criteria for the behavior of nonsmooth functions ⋮ Scalar derivatives in Hilbert spaces ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Weak regularity of functions and sets in Asplund spaces ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ On the positive definiteness of limiting coderivative for set-valued mappings ⋮ An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability ⋮ Subdifferentiation of regularized functions ⋮ Integration of multivalued operators and cyclic submonotonicity ⋮ On second derivatives for nonsmooth functions
Cites Work
- Unnamed Item
- Unnamed Item
- Monotone (nonlinear) operators in Hilbert space
- Generalized gradients of Lipschitz functionals
- The multiplier method of Hestenes and Powell applied to convex programming
- Generalized Gradients and Applications
- Semismooth and Semiconvex Functions in Constrained Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Sufficient conditions for extremum, penalty functions and regularity
