Submonotone Subdifferentials of Lipschitz Functions
From MaRDI portal
Cites work
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Generalized Gradients and Applications
- Generalized gradients of Lipschitz functionals
- scientific article; zbMATH DE number 3496814 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Monotone (nonlinear) operators in Hilbert space
- Semismooth and Semiconvex Functions in Constrained Optimization
- Sufficient conditions for extremum, penalty functions and regularity
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(64)- On the subdifferentiability of the difference of two functions and local minimization
- Tangencially continuous directional derivatives in nonsmooth analysis
- Approximation and decomposition properties of some classes of locally d.c. functions
- Weak directional closedness and generalized subdifferentials
- A trust region algorithm for minimization of locally Lipschitzian functions
- Iteration functions in some nonsmooth optimization algorithms
- Approximate convexity and submonotonicity.
- Links between functions and subdifferentials
- Non-smooth optimization for robust control of infinite-dimensional systems
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Subgradient projectors: extensions, theory, and characterizations
- Upper semismooth functions and the subdifferential determination property
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- On the positive definiteness of limiting coderivative for set-valued mappings
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- Generalized submonotonicity and approximately convexity in Riemannian manifolds
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Variational analysis of paraconvex multifunctions
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Minimizing memory effects of a system
- A nonsmooth version of Newton's method
- Subdifferential representation formula and subdifferential criteria for the behavior of nonsmooth functions
- Scalar derivatives in Hilbert spaces
- Weak regularity of functions and sets in Asplund spaces
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Subdifferentiation of regularized functions
- Integration of multivalued operators and cyclic submonotonicity
- Subsmooth sets: Functional characterizations and related concepts
- Nonconvex bundle method with application to a delamination problem
- Directional derivative of a minimax function
- Design of a flight control architecture using a non-convex bundle method
- On second derivatives for nonsmooth functions
- Jets, generalised convexity, proximal normality and differences of functions
- A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
- scientific article; zbMATH DE number 7632134 (Why is no real title available?)
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Local linear convergence of alternating projections in metric spaces with bounded curvature
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Characterizations of quasiconvex and pseudoconvex functions by their second-order regular subdifferentials
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Worst-case stability and performance with mixed parametric and dynamic uncertainties
- Bundle method for non-convex minimization with inexact subgradients and function values
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- On e-convex functions and e-subdifferentials in locally convex spaces
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds
- 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
- Cutting plane oracles to minimize non-smooth non-convex functions
- The directional subdifferential of the difference of two convex functions
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
- Bundle trust region algorithm based on linear subproblem
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- Stochastic algorithms for large-scale composite optimization: the case of likelihood maximization for X-FEL imaging
- Cyclic hypomonotonicity, cyclic submonotonicity, and integration
- Approximately convex functions and approximately monotonic operators
- Subdifferential characterization of approximate convexity: The lower semicontinuous case
This page was built for publication: Submonotone Subdifferentials of Lipschitz Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916771)
