𝒱𝒰-smoothness and proximal point results for some nonconvex functions

DOI10.1080/10556780410001704902zbMATH Open1097.90059OpenAlexW1787101211MaRDI QIDQ4657702FDOQ4657702

Author name not available (Why is that?)

Publication date: 14 March 2005

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001704902

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

zbMATH Keywords

proximal pointsecond-order derivatives\(\mathcal {VU}\)-Decomposition

Mathematics Subject Classification ID

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)

Cites Work

• Variational Analysis
• Convergence of some algorithms for convex minimization
• Semismooth and Semiconvex Functions in Constrained Optimization
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Identifiable Surfaces in Constrained Optimization
• The 𝒰-Lagrangian of a convex function
• Active Sets, Nonsmoothness, and Sensitivity
• On a Class of Nonsmooth Composite Functions
• Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• 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
• On Eigenvalue Optimization
• Refinements of necessary optimality conditions in nondifferentiable programming II

Cited In (27)

• Composite proximal bundle method
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
• 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
• Active‐Set Newton Methods and Partial Smoothness
• 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
• Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
• A superlinear space decomposition algorithm for constrained nonsmooth convex program
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
• Partial Smoothness and Constant Rank
• 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
• 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
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems

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)