Pages that link to "Item:Q2784405"
From MaRDI portal
The following pages link to Incremental subgradient methods for nondifferentiable optimization (Q2784405):
Displaying 50 items.
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems (Q2230784) (← links)
- On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling (Q2235138) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\) (Q2249834) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Convergence of online mirror descent (Q2278461) (← links)
- Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- The incremental subgradient methods on distributed estimations in-network (Q2335919) (← links)
- A globally convergent incremental Newton method (Q2349125) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm (Q2397581) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Convergence of random sleep algorithms for optimal consensus (Q2437791) (← links)
- Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- A new step size rule for the superiorization method and its application in computerized tomography (Q2672729) (← links)
- Convergence rate of incremental subgradient algorithms (Q2752037) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Stochastic first-order methods with random constraint projection (Q2796796) (← links)
- Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- Hybrid deterministic-stochastic methods for data fitting (Q2909270) (← links)
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (Q2977631) (← links)
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
- Adaptive clustering based on element-wised distance for distributed estimation over multi-task networks (Q3303861) (← links)
- Network Synchronization with Convexity (Q3457101) (← links)
- Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems (Q3586129) (← links)
- A New Class of Incremental Gradient Methods for Least Squares Problems (Q4376150) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- A cyclic iterative approach and its modified version to solve coupled Sylvester-transpose matrix equations (Q4603777) (← links)
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step (Q4613984) (← links)
- An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming (Q4620422) (← links)
- String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
- Accelerating Stochastic Composition Optimization (Q4637024) (← links)
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures (Q4639125) (← links)
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
- Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666) (← links)
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications (Q4687241) (← links)
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions (Q4687243) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
