scientific article; zbMATH DE number 1424528
From MaRDI portal
Publication:4945775
zbMath0944.65069MaRDI QIDQ4945775
No author found.
Publication date: 22 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsuperlinear convergenceconvex minimization problems\({\mathcal V}{\mathcal U}\)-decomposition derivativesconvex max-function
Related Items (16)
On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives ⋮ A bundle modification strategy for convex minimization ⋮ An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition ⋮ On the local convergence analysis of the gradient sampling method for finite max-functions ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems ⋮ A fast gradient and function sampling method for finite-max 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 ⋮ The 𝒰-Lagrangian of a convex function ⋮ 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:
