On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
From MaRDI portal
Publication:2706342
DOI10.1137/S1052623499350967zbMath1015.90084MaRDI QIDQ2706342
No author found.
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
eigenvalue optimizationconvex minimizationsecond-order derivatives\(\mathcal{VU}\)-decompositionmax-functions
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions for minimax problems (49K35)
Related Items (24)
On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives ⋮ 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 ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems ⋮ 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 ⋮ 𝒱𝒰-smoothness and proximal point results for some nonconvex functions ⋮ A superlinear space decomposition algorithm for constrained nonsmooth convex program ⋮ An approximate decomposition algorithm for convex minimization ⋮ 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 ⋮ An approximate Newton method for solving non-smooth equations with infinite max functions ⋮ Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems ⋮ 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: On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
