View Item 

Show simple item record

On minimax optimization problems
dc.contributor.authorDrezner, Zvien_US
dc.date.accessioned2006-09-11T19:32:25Z
dc.date.available2006-09-11T19:32:25Z
dc.date.issued1982-12en_US
dc.identifier.citationDrezner, Zvi; (1982). "On minimax optimization problems." Mathematical Programming 22(1): 227-230. <http://hdl.handle.net/2027.42/47909>en_US
dc.identifier.issn1436-4646en_US
dc.identifier.issn0025-5610en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47909
dc.description.abstractWe give a short proof that in a convex minimax optimization problem in k dimensions there exist a subset of k + 1 functions such that a solution to the minimax problem with those k + 1 functions is a solution to the minimax problem with all functions. We show that convexity is necessary, and prove a similar theorem for stationary points when the functions are not necessarily convex but the gradient exists for each function.en_US
dc.format.extent172472 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; The Mathematical Programming Society, Inc.en_US
dc.subject.otherMathematicsen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherMinimaxen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.subject.otherNumerical and Computational Methodsen_US
dc.subject.otherStationary Pointsen_US
dc.subject.otherNonconvex Optimizationen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherOptimizationen_US
dc.titleOn minimax optimization problemsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumSchool of Management, The University of Michigan-Dearborn, Dearborn, MI, USAen_US
dc.contributor.affiliationumcampusDearbornen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47909/1/10107_2005_Article_BF01581038.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01581038en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10107_2005_Article_BF01581038.pdf
Size:
168.4KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.