An active set method for solving linearly constrained nonsmooth optimization problems (Q3783077)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An active set method for solving linearly constrained nonsmooth optimization problems |
scientific article; zbMATH DE number 4045484 |
Statements
An active set method for solving linearly constrained nonsmooth optimization problems (English)
0 references
1987
0 references
linear constraints
0 references
convex nonsmooth objective function
0 references
active set algorithm
0 references
bundle principle
0 references
0 references
0 references
0 references
0 references
0.8160930275917053
0 references
0.8032676577568054
0 references
An active set algorithm is proposed for a nonlinear programming problem consisting in minimizing a given function f(x) subject to Ax\(\leq b\), \(x\in R^ n\). In an active set algorithm, a typical iteration at a point \(x_ k\) can be described as follows: 1. Identify the constraints active at \(x_ k\). 2. Compute the descent direction. 3. Relax one or several constraints if a relaxing rule allows it and compute a new descent direction. 4. Perform a line search along the descent direction obtained to find a new feasible point. In the present paper, it is assumed that f(x) is convex but not necessarily differentiable. The search direction is computed by a bundle principle [see \textit{C. Lemarechal, J. J. Strodiot} and \textit{A. Bihain}, Nonlinear programming 4, Proc. Symp., Madison/Wis. 1980, 245-282 (1981; Zbl 0533.49023)]. Convergence is obtai. Tian.
0 references