Improving feasible directions for a class of nondifferentiable functions

DOI10.1016/0377-2217(88)90460-2zbMath0637.90080OpenAlexW1980242960MaRDI QIDQ1099079

José Manuel Tamarit Goerlich

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90460-2

zbMATH Keywords

subgradientpiecewise linear functionsconvex, nondifferentiable functionimproving feasible directionslinear constrainsprojection on the null space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Conditional subgradient optimization -- theory and applications

Cites Work

• Algorithms for some minimax problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Finding the nearest point in A polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item