Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient approach to nonlinear minimax problems

From MaRDI portal
Publication:1203873
Jump to:navigation, search

zbMath0765.90085MaRDI QIDQ1203873

Xing-Si Li

Publication date: 18 February 1993

Published in: Chinese Science Bulletin (Search for Journal in Brave)


zbMATH Keywords

non-smooth optimizationnonlinear minimax problemsdiscontinuous first derivativesShannon's entropy function


Mathematics Subject Classification ID

Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Measures of information, entropy (94A17) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (3)

Maximum-entropy clustering algorithm and its global convergence analysis ⋮ Variable programming: a generalized minimax problem. II: Algorithms ⋮ Entropy binomial tree method and calibration for the volatility smile




This page was built for publication: An efficient approach to nonlinear minimax problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1203873&oldid=13268551"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki