Optimization with nonsmooth data

DOI10.1007/BF01719827zbMath0635.90077MaRDI QIDQ1097840

Jochem Zowe

Publication date: 1987

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

Bundle methodsSubgradient methodsnonsmooth problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

Matching problems with generalized upper bound side constraints ⋮ A non‐smooth lower bound on ν ⋮ A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints ⋮ On parametric nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the construction of higher order algorithms in convex optimization
• Approximation to a set-valued mapping. I: A proposal
• Methods of descent for nondifferentiable optimization
• An introduction to the theory of nonsmooth optimization
• A Simplex Method for Function Minimization

This page was built for publication: Optimization with nonsmooth data