A method for minimizing convex functions based on continuous approximations to the subdifferential
type: Item
instance of: scholarly article
title: A method for minimizing convex functions based on continuous approximations to the subdifferential
zbMATH Open document ID: 0904.90128
DOI: 10.1080/10556789808805683
publication date: 1998-06-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 1158147
zbMATH Keywords: unconstrained minimization of nondifferentiable convex functions
zbMATH Keywords: continuous approximation
zbMATH Keywords: subdifferential
author: A. M. Bagirov
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/10556789808805683
OpenAlex ID: W2014786863
cites work: Q4051509
cites work: Q4744875
cites work: Algorithm Models for Nondifferentiable Optimization
cites work: Q5187067
cites work: Finding the nearest point in A polytope
published in: Optimization Methods \& Software
Recommended article: Subgradient method for minimization of convex functionals and some efficiency bounds
Recommended article: Q5187769
Recommended article: A method for minimizing the sum of a convex function and a continuously differentiable function
Recommended article: A method of conjugate subgradients for the minimization of functionals
Recommended article: Q3758565
Recommended article: Q4881441
Recommended article: On the minimization problem of sub-linear convex functionals
Recommended article: Convergence of subgradient methods of minimizing convex functions
Recommended article: A continuous method for constrained minimization problems
Recommended article: Determination of convex functions via subgradients of minimal norm
description: scientific article; zbMATH DE number 1158147