A method for minimizing convex functions based on continuous approximations to the subdifferential

DOI10.1080/10556789808805683zbMath0904.90128OpenAlexW2014786863MaRDI QIDQ4391285

Adil M. Bagirov

Publication date: 2 June 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805683

zbMATH Keywords

subdifferentialcontinuous approximationunconstrained minimization of nondifferentiable convex functions

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Related Items (3)

A Method for Minimization of Quasidifferentiable Functions ⋮ Approximating Clarke's subgradients of semismooth functions by divided differences ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems

Cites Work

• Algorithm Models for Nondifferentiable Optimization
• Finding the nearest point in A polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method for minimizing convex functions based on continuous approximations to the subdifferential