Convergence of a generalized subgradient method for nondifferentiable convex optimization

DOI10.1007/BF01594925zbMATH Open0722.90054OpenAlexW2038295970MaRDI QIDQ757242FDOQ757242

Hyunsil Ahn, Sehun Kim

Publication date: 1991

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01594925

Recommendations

• scientific article; zbMATH DE number 429229
• An interior-point based subgradient method for nondifferentiable convex optimization
• A note on the convergence of subgradient optimization methods
• scientific article; zbMATH DE number 3894844
• Convergence properties of the modified subgradient method of camerini et al

zbMATH Keywords

convergence conditionsnondifferentiable optimization\(\epsilon \) -subgradientgeneralized subgradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An aggregate subgradient method for nonsmooth convex minimization
• Minimization of unsmooth functionals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two-direction subgradient method for non-differentiable optimization problems
• On Poljak's improved subgradient method
• Title not available (Why is that?)

Cited In (35)

• Title not available (Why is that?)
• Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
• An improved subgradient method for constrained nondifferentiable optimization
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs
• A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
• A modified subgradient algorithm for Lagrangean relaxation
• Optimal prioritized channel allocation in cellular mobile systems
• An interior-point based subgradient method for nondifferentiable convex optimization
• Subgradient method for minimization of convex functionals and some efficiency bounds
• Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
• Title not available (Why is that?)
• Two-direction subgradient method for non-differentiable optimization problems
• Subgradient algorithm on Riemannian manifolds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• Channel allocation in cellular radio networks
• On Convergence Properties of a Subgradient Method
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
• Algorithms for quasiconvex minimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence properties of the modified subgradient method of camerini et al
• Ergodic convergence in subgradient optimization
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
• A descent method with linear programming subproblems for nondifferentiable convex optimization
• Title not available (Why is that?)
• A generalized subgradient method with relaxation step
• A note on the convergence of subgradient optimization methods

This page was built for publication: Convergence of a generalized subgradient method for nondifferentiable convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757242)