A direct method of linearization for continuous minimax problems (Q1821697)
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 3999681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A direct method of linearization for continuous minimax problems |
scientific article; zbMATH DE number 3999681 |
Statements
A direct method of linearization for continuous minimax problems (English)
0 references
1987
0 references
We consider the problem of minimizing a nondifferentiable function that is the pointwise maximum over a compact family of continuously differentiable functions. We suppose that a certain convex approximation to the objective function can be evaluated. An iterative method is given which uses as successive search directions approximate solutions of semi- infinite quadratic programming problems calculated via a new generalized proximity algorithm. Inexact line searches ensure global convergence of the method to stationary points.
0 references
nondifferentiable function
0 references
convex approximation
0 references
semi-infinite quadratic programming
0 references
generalized proximity algorithm
0 references
inexact line searches
0 references
global convergence
0 references
stationary points
0 references
0 references
0 references
0 references
0.8366959691047668
0 references
0.8235511779785156
0 references
0.8109625577926636
0 references
0.8091992139816284
0 references
