An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for linearly constrained convex nondifferentiable minimization problems |
scientific article |
Statements
An algorithm for linearly constrained convex nondifferentiable minimization problems (English)
0 references
1985
0 references
A readily implementable algorithm is proposed for minimizing any convex, not necessarily differentiable, function f of several variables subject to a finite number of linear constraints. The algorithm requires only the calculation of f at designated feasible points. At each iteration a lower polyhedral approximation to f is constructed from a few previously calculated subgradients and an aggregate subgradient. The recursively updated aggregate subgradient accumulates the subgradient information to deal with nondifferentiability of f. The polyhedral approximation and the linear constraints generate constraints in the search direction finding subproblem that is a quadratic programming problem. Then a step length is found by approximate line search. It is shown that the algorithm converges to a solution, if any.
0 references
convex nondifferentiable minimization
0 references
linear constraints
0 references
algorithm
0 references
lower polyhedral approximation
0 references
subgradient
0 references