Improving feasible directions for a class of nondifferentiable functions

DOI10.1016/0377-2217(88)90460-2zbMATH Open0637.90080OpenAlexW1980242960MaRDI QIDQ1099079FDOQ1099079

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

Recommendations

• scientific article
• scientific article
• An algorithm for linearly constrained convex nondifferentiable minimization problems
• scientific article
• scientific article

zbMATH Keywords

piecewise linear functionssubgradientconvex, 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)

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding the nearest point in A polytope
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for some minimax problems
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Conditional subgradient optimization -- theory and applications
• Title not available (Why is that?)

This page was built for publication: Improving feasible directions for a class of nondifferentiable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099079)