𝒱𝒰-smoothness and proximal point results for some nonconvex functions
From MaRDI portal
Publication:4657702
Recommendations
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Identifying structure of nonsmooth convex functions by the bundle technique
- On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function
Cites work
- Active Sets, Nonsmoothness, and Sensitivity
- Convergence of some algorithms for convex minimization
- Identifiable Surfaces in Constrained Optimization
- On Eigenvalue Optimization
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- On a Class of Nonsmooth Composite Functions
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Refinements of necessary optimality conditions in nondifferentiable programming II
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
- Semismooth and Semiconvex Functions in Constrained Optimization
- The 𝒰-Lagrangian of a convex function
- Variational Analysis
Cited in
(28)- Composite proximal bundle method
- Identifying structure of nonsmooth convex functions by the bundle technique
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- An approximate decomposition algorithm for convex minimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Computing proximal points of nonconvex functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- The chain rule for VU-decompositions of nonsmooth functions
- The space decomposition theory for a class of eigenvalue optimizations
- Optimality, identifiability, and sensitivity
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- A superlinear space decomposition algorithm for constrained nonsmooth convex program
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- The \(\mathcal{VU}\)-decomposition to the proper convex function
- A decomposition method with redistributed subroutine for constrained nonconvex optimization
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- Active-set Newton methods and partial smoothness
- Fast Moreau envelope computation I: Numerical algorithms
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function
- Derivative-free optimization via proximal point methods
- On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- Partial smoothness and constant rank
This page was built for publication: 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657702)
