Decomposition into functions in the minimization problem

zbMath0428.49026MaRDI QIDQ1137249

V. M. Kibardin

Publication date: 1979

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40) Decomposition methods (49M27)

Related Items (15)

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Parallel Uzawa method for large-scale minimization of partially separable functions ⋮ Random algorithms for convex minimization problems ⋮ Incremental proximal methods for large scale convex optimization ⋮ The effect of deterministic noise in subgradient methods ⋮ Space-decomposition minimization method for large-scale minimization problems ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ An incremental subgradient method on Riemannian manifolds ⋮ Space-decomposition multiplier method for constrained minimization problems ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems ⋮ Path-based incremental target level algorithm on Riemannian manifolds ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle

This page was built for publication: Decomposition into functions in the minimization problem