Pages that link to "Item:Q4657702"

The following pages link to 𝒱𝒰-smoothness and proximal point results for some nonconvex functions (Q4657702):

Displaying 22 items.

• Composite proximal bundle method (Q359623) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• Optimality, identifiability, and sensitivity (Q463741) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
• Computing proximal points of nonconvex functions (Q959941) (← links)
• A superlinear space decomposition algorithm for constrained nonsmooth convex program (Q964944) (← links)
• An approximate decomposition algorithm for convex minimization (Q966076) (← links)
• The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations (Q1725116) (← links)
• A decomposition method with redistributed subroutine for constrained nonconvex optimization (Q1949452) (← links)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
• The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function (Q2190753) (← links)
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• The \(\mathcal{VU}\)-decomposition to the proper convex function (Q2379901) (← links)
• On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition (Q2414903) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods (Q2576738) (← links)
• Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)