首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Smooth Transformation of the Generalized Minimax Problem
Authors:G Di Pillo  L Grippo  S Lucidi
Institution:(1) Dipartimento di Informatica e Sistemistica, Università di Roma ldquoLa Sapienza,rdquo, Roma, Italy;(2) Dipartimento di Informatica e Sistemistica, Università di Roma ldquoLa Sapienza,rdquo, Roma, Italy
Abstract:We consider the generalized minimax problem, that is, the problem of minimizing a function phgr(x)=F(g 1(x),...,g m(x)), where F is a smooth function and each g i is the maximum of a finite number of smooth functions. We prove that, under suitable assumptions, it is possible to construct a continuously differentiable exact barrier function, whose minimizers yield the minimizers of the function phgr. In this way, the nonsmooth original problem can be solved by usual minimization techniques for unconstrained differentiable functions.
Keywords:Nonlinear programming  unconstrained optimization  nondifferentiable optimization  generalized minimax problems  minimax problems
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号