Incremental subgradient methods for nondifferentiable optimization
From MaRDI portal
Recommendations
- Convergence rate of incremental subgradient algorithms
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Incremental proximal methods for large scale convex optimization
- Incremental stochastic subgradient algorithms for convex optimization
Cited in
(only showing first 100 items - show all)- The stochastic trim-loss problem
- Subgradient methods for saddle-point problems
- An improved subgradient method for constrained nondifferentiable optimization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- An incremental subgradient method on Riemannian manifolds
- An effective line search for the subgradient method
- An optimal randomized incremental gradient method
- Modified Fejér sequences and applications
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Steered sequential projections for the inconsistent convex feasibility problem
- The effect of deterministic noise in subgradient methods
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Gradient-free method for nonsmooth distributed optimization
- A decentralized multi-objective optimization algorithm
- Incremental without replacement sampling in nonconvex optimization
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
- Accelerating incremental gradient optimization with curvature information
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems
- On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
- Asynchronous Lagrangian scenario decomposition
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\)
- Convergence of the surrogate Lagrangian relaxation method
- An inexact modified subgradient algorithm for nonconvex optimization
- Convergence of online mirror descent
- Decentralized hierarchical constrained convex optimization
- A proximal-projection partial bundle method for convex constrained minimax problems
- The incremental subgradient methods on distributed estimations in-network
- A globally convergent incremental Newton method
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- Incremental gradient-free method for nonsmooth distributed optimization
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
- Convergence of random sleep algorithms for optimal consensus
- Approximate subgradient methods for nonlinearly constrained network flow problems
- Inexact subgradient methods for quasi-convex optimization problems
- A new step size rule for the superiorization method and its application in computerized tomography
- An incremental decomposition method for unconstrained optimization
- Convergence rate of incremental subgradient algorithms
- A subgradient method based on gradient sampling for solving convex optimization problems
- Stochastic first-order methods with random constraint projection
- Scaling techniques for -subgradient methods
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- On the convergence of the forward-backward splitting method with linesearches
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Hybrid deterministic-stochastic methods for data fitting
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Adaptive clustering based on element-wised distance for distributed estimation over multi-task networks
- Incremental subgradient methods for nondifferentiable optimization in a Hilbert space
- Network synchronization with convexity
- Approximate subgradient methods for Lagrangian relaxations on networks
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A subgradient method for multiobjective optimization on Riemannian manifolds
- A direct splitting method for nonsmooth variational inequalities
- Subgradient methods for huge-scale optimization problems
- Subgradient method for convex feasibility on Riemannian manifolds
- A New Class of Incremental Gradient Methods for Least Squares Problems
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- A cyclic iterative approach and its modified version to solve coupled Sylvester-transpose matrix equations
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- An infeasible-point subgradient method using adaptive approximate projections
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- String-averaging incremental stochastic subgradient algorithms
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
- Accelerating Stochastic Composition Optimization
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Global convergence rate of proximal incremental aggregated gradient methods
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Nesterov perturbations and projection methods applied to IMRT
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- scientific article; zbMATH DE number 7626722 (Why is no real title available?)
- An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- Distributed event-triggered adaptive partial diffusion strategy under dynamic network topology
- Accelerating Sparse Recovery by Reducing Chatter
- A smooth inexact penalty reformulation of convex problems with linear constraints
- A scaled incremental gradient method
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Convergence analysis of deflected conditional approximate subgradient methods
- Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
This page was built for publication: Incremental subgradient methods for nondifferentiable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784405)
