Convergence of a simple subgradient level method
From MaRDI portal
Recommendations
- The efficiency of ballstep subgradient level methods for convex optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
Cited in
(27)- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- The effect of deterministic noise in subgradient methods
- Convergence of the surrogate Lagrangian relaxation method
- An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
- Approximate subgradient methods for nonlinearly constrained network flow problems
- A subgradient method with non-monotone line search
- The efficiency of ballstep subgradient level methods for convex optimization
- A subgradient method based on gradient sampling for solving convex optimization problems
- Scaling techniques for -subgradient methods
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem
- An infeasible-point subgradient method using adaptive approximate projections
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Path-based incremental target level algorithm on Riemannian manifolds
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Superiorization with level control
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
- Accelerating level-value adjustment for the Polyak stepsize
- A generalized projection-based scheme for solving convex constrained optimization problems
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
This page was built for publication: Convergence of a simple subgradient level method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295965)
