A constrained min-max algorithm for rival models (Q1104224): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0165-1889(88)90021-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1966772937 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A general saddle point result for constrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002322 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A superlinearly convergent constrained min-max algorithm for rival models of the same system / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:41, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A constrained min-max algorithm for rival models |
scientific article |
Statements
A constrained min-max algorithm for rival models (English)
0 references
1988
0 references
In the presence of rival models of the same system, a robust optimal policy can be computed that takes account of the existence of the rival models. A min-max, worst case design method is discussed. The latter is an extreme case of ordinary pooling of the models for policy optimization. In fact, it can be shown that the min-max strategy is the pooling that corresponds to the robust policy. If such a robust policy happens to have too high a political cost to be implemented, an alternative pooling can be formulated using the robust pooling as a guide. An algorithm is proposed for solving the min-max problem. This is based on the convexification of the minimization problem by means of the constraints. The algorithm essentially consists of a quadratic programming subproblem with equality and simple inequality constraints. The subproblem defines the direction of progress along which a step has to be taken. The stepsize is determined using an Armijo-type stepsize strategy that ensures sufficient progress towards the satisfaction of the first-order conditions. The latter also happens to be sufficient for optimality due to the convexification of the problem. The formulation of the problem, the robust policy formulation of the min- max approach and the convergence properties of the algorithm are discussed in another paper of the author [``A superlinearly convergent constrained min-max algorithm for rival models of the same system'', PROPE discussion paper No.96, Imperial Coll., London (1987)].
0 references
robust optimal policy
0 references
worst case design method
0 references
min-max strategy
0 references
convexification
0 references
Armijo-type stepsize strategy
0 references
0 references