Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
From MaRDI portal
Recommendations
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Convergence rate of incremental subgradient algorithms
- The effect of deterministic noise in subgradient methods
- Incremental subgradient methods for nondifferentiable optimization
- Parallel subgradient methods for convex optimization.
Cited in
(84)- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Path-based incremental target level algorithm on Riemannian manifolds
- An inexact modified subgradient algorithm for nonconvex optimization
- Convergence analysis of the fast subspace descent method for convex optimization problems
- Essentials of numerical nonsmooth optimization
- Convergence of first-order methods via the convex conjugate
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- Properties of subgradient projection iteration when applying to linear imaging system
- Convergence analysis of deflected conditional approximate subgradient methods
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- New approaches for optimizing over the semimetric polytope
- The efficiency of ballstep subgradient level methods for convex optimization
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Essentials of numerical nonsmooth optimization
- A merit function approach to the subgradient method with averaging
- scientific article; zbMATH DE number 5221408 (Why is no real title available?)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- The extragradient method for solving variational inequalities in the presence of computational errors
- Inexact quantized quasi-subgradient method for quasi-convex optimization problems
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Convergence of a subgradient method for computing the bound norm of matrices
- A subgradient method with non-monotone line search
- Distributed optimization with inexact oracle
- Distributed stochastic subgradient projection algorithms for convex optimization
- A smooth inexact penalty reformulation of convex problems with linear constraints
- Convergence rate of incremental subgradient algorithms
- Incremental proximal methods for large scale convex optimization
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Incremental-like bundle methods with application to energy planning
- String-averaging projected subgradient methods for constrained minimization
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
- Incremental quasi-subgradient method for minimizing sum of geodesic quasi-convex functions on Riemannian manifolds with applications
- An infeasible-point subgradient method using adaptive approximate projections
- Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Random algorithms for convex minimization problems
- Ergodic convergence in subgradient optimization with application to simplical decomposition of convex programs
- The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Incremental stochastic subgradient algorithms for convex optimization
- Simultaneous incremental gradient method for inconsistent convex optimization problem
- Modified Fejér sequences and applications
- Approximate subgradient methods for Lagrangian relaxations on networks
- The extragradient method for convex optimization in the presence of computational errors
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- The effect of deterministic noise in subgradient methods
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Convergence properties of the modified subgradient method of camerini et al
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Bounded perturbation resilience of projected scaled gradient methods
- Bundle method for non-convex minimization with inexact subgradients and function values
- Generalised gossip-based subgradient method for distributed optimisation
- Incremental gradient-free method for nonsmooth distributed optimization
- Primal-dual \(\varepsilon\)-subgradient method for distributed optimization
- Scaling techniques for -subgradient methods
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Incremental subgradient methods for nondifferentiable optimization
- Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
- The convergence rate of the sandwich algorithm for approximating convex functions
- A subgradient method based on gradient sampling for solving convex optimization problems
- Approximate subgradients and coderivatives in \(R^ n\)
- Convergence analysis of incremental and parallel line search subgradient methods in Hilbert space
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Inexact subgradient methods for quasi-convex optimization problems
This page was built for publication: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651971)
