Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
From MaRDI portal
Publication:4441943
DOI10.1137/S1052623402412441zbMath1036.90067OpenAlexW1997928346MaRDI QIDQ4441943
No author found.
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623402412441
Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items (25)
On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives ⋮ The \(\mathcal{VU}\)-decomposition to the proper convex function ⋮ Partial Smoothness and Constant Rank ⋮ 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 ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ 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 ⋮ Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems ⋮ Optimality, identifiability, and sensitivity ⋮ Computing proximal points of nonconvex functions ⋮ 𝒱𝒰-smoothness and proximal point results for some nonconvex functions ⋮ A superlinear space decomposition algorithm for constrained nonsmooth convex program ⋮ A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ Functions and sets of smooth substructure: relationships and examples ⋮ First- and second-order optimality conditions for piecewise smooth objective functions ⋮ Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization ⋮ 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 ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
This page was built for publication: Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
