An efficient algorithm for solving the discrete minisum problem

DOI10.1016/0167-6377(83)90018-4zbMath0517.49021OpenAlexW2130393191MaRDI QIDQ1053269

Roland Hornung

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90018-4

zbMATH Keywords

hybrid methodnonsmooth minimizationminisum optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Methods of reduced gradient type (90C52) Optimality conditions for free problems in two or more independent variables (49K10)

Cites Work

• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• An Algorithm for Constrained Optimization with Semismooth Functions
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for solving the discrete minisum problem