Incremental subgradients for constrained convex optimization: A unified framework and new methods
From MaRDI portal
Publication:3586148
Recommendations
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- \(\epsilon\)-subgradient algorithms for bilevel convex optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- Incremental subgradient methods for nondifferentiable optimization
Cited in
(33)- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Decentralized hierarchical constrained convex optimization
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- Projected subgradient minimization versus superiorization
- A sequential ascending parameter method for solving constrained minimization problems
- Derivative-free superiorization with component-wise perturbations
- \(\epsilon\)-subgradient algorithms for bilevel convex optimization
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- scientific article; zbMATH DE number 2196506 (Why is no real title available?)
- String-averaging incremental stochastic subgradient algorithms
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A smooth inexact penalty reformulation of convex problems with linear constraints
- Distributed multi-task classification: a decentralized online learning approach
- Incremental proximal methods for large scale convex optimization
- String-averaging projected subgradient methods for constrained minimization
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- The incremental subgradient methods on distributed estimations in-network
- 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
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems
- Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation
- Abstract convergence theorem for quasi-convex optimization problems with applications
- A new step size rule for the superiorization method and its application in computerized tomography
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Bounded perturbation resilience of projected scaled gradient methods
- Scaling techniques for \(\epsilon\)-subgradient methods
- Incremental subgradient methods for nondifferentiable optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
This page was built for publication: Incremental subgradients for constrained convex optimization: A unified framework and new methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586148)
