Finding approximate solutions to minimax problems

Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35) Numerical methods in optimal control (49M99) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

The paper is devoted to minimax problems. Solution of these problems is reduced to minimization of specially constructed functions with penalty coefficients. It is shown that the directions along which these functions decrease can be determined to a given accuracy without using penalty coefficients. The functions proposed are shown to be more suitable for finding all approximate solutions to the original problem than the functions derived in earlier studies. Application to the problem of packing identical two-dimensional spheres on a three-dimensional sphere is considered.

Recommendations

Cited in

(4)

This page was built for publication: Finding approximate solutions to minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569265)