Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1061.90116
Polak, E.; Royset, J.O.
Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques. (English)
[J] J. Optimization Theory Appl. 119, No. 3, 421-457 (2003). ISSN 0022-3239; ISSN 1573-2878/e

Summary: We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.

MSC 2000:: *90C47 Minimax problems
49J35 Minimax problems (existence)
90C34 Semi-infinite programming

Keywords: Min-max-min problems; nonsmooth optimization algorithms; smoothing techniques; feedback precision-adjustment rule

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]