𝒱𝒰-smoothness and proximal point results for some nonconvex functions
From MaRDI portal
Publication:4657702
DOI10.1080/10556780410001704902zbMath1097.90059OpenAlexW1787101211MaRDI QIDQ4657702
No author found.
Publication date: 14 March 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001704902
Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (25)
The \(\mathcal{VU}\)-decomposition to the proper convex function ⋮ Partial Smoothness and Constant Rank ⋮ A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations ⋮ Composite proximal bundle method ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition ⋮ The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ Optimality, identifiability, and sensitivity ⋮ The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations ⋮ \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications ⋮ Derivative-free optimization via proximal point methods ⋮ Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ Computing proximal points of nonconvex functions ⋮ A superlinear space decomposition algorithm for constrained nonsmooth convex program ⋮ An approximate decomposition algorithm for convex minimization ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ A \(\mathcal{VU}\)-algorithm for convex minimization ⋮ Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
Cites Work
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Convergence of some algorithms for convex minimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Identifiable Surfaces in Constrained Optimization
- Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
- Semismooth and Semiconvex Functions in Constrained Optimization
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Variational Analysis
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- The 𝒰-Lagrangian of a convex function
- Refinements of necessary optimality conditions in nondifferentiable programming II
- Active Sets, Nonsmoothness, and Sensitivity
- On Eigenvalue Optimization
- On a Class of Nonsmooth Composite Functions
This page was built for publication: 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
