Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
From MaRDI portal
Publication:4651971
DOI10.1137/S1052623400376366zbMath1063.90039WikidataQ56475187 ScholiaQ56475187MaRDI QIDQ4651971
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
convergenceconvex programmingnondifferentiable optimizationapproximate subgradientefficiency estimate
Related Items
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis, Inexact subgradient methods for quasi-convex optimization problems, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Incremental gradient-free method for nonsmooth distributed optimization, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, Distributed stochastic subgradient projection algorithms for convex optimization, Primal-dual \(\varepsilon\)-subgradient method for distributed optimization, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Stochastic approximation with discontinuous dynamics, differential inclusions, and applications, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, A subgradient method with non-monotone line search, The extragradient method for solving variational inequalities in the presence of computational errors, Random algorithms for convex minimization problems, Incremental proximal methods for large scale convex optimization, The effect of deterministic noise in subgradient methods, An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming, An infeasible-point subgradient method using adaptive approximate projections, Generalised gossip-based subgradient method for distributed optimisation, The Extragradient Method for Convex Optimization in the Presence of Computational Errors, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints, Approximate Subgradient Methods for Lagrangian Relaxations on Networks, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Incremental-like bundle methods with application to energy planning, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors, String-averaging projected subgradient methods for constrained minimization, An inexact modified subgradient algorithm for nonconvex optimization, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, Modified Fejér sequences and applications, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Bounded perturbation resilience of projected scaled gradient methods, A merit function approach to the subgradient method with averaging, Essentials of numerical nonsmooth optimization, Scaling Techniques for $\epsilon$-Subgradient Methods, Path-based incremental target level algorithm on Riemannian manifolds, Projection algorithms with dynamic stepsize for constrained composite minimization, Abstract convergence theorem for quasi-convex optimization problems with applications, Incremental subgradient method for nonsmooth convex optimization with fixed point constraints, On perturbed steepest descent methods with inexact line search for bilevel convex optimization, Convergence rates of subgradient methods for quasi-convex optimization problems, Properties of subgradient projection iteration when applying to linear imaging system, Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems, Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm, Weak subgradient method for solving nonsmooth nonconvex optimization problems, New approaches for optimizing over the semimetric polytope, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications, Essentials of numerical nonsmooth optimization, On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle, Primal recovery from consensus-based dual decomposition for distributed convex optimization, Distributed optimization with inexact oracle
