Links to LaTeX style guides are needed, as I doubt this is the only such Wikipedia entry with LaTeX discussion.
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||
| |||||||||||
Links to LaTeX style guides are needed, as I doubt this is the only such Wikipedia entry with LaTeX discussion.
The LaTeX in this article needs to be improved (as noted in the second section of the article itself). Currently it seems that the MediaWiki software doesn't support enough LaTeX or TeX to be able to improve it, though. The TeX way doesn't work:
\mathop{\rm argmax}\limits_x f(x)The LaTeX solution given in the article doesn't work, either:
\operatornamewithlimits{argmax}_x f(x)—Bkell (talk) 00:08, 29 November 2006 (UTC)
I don't agree that the space between arg and max is undesirable. I'd just leave "centering below argmax rather than just max" as motivation, but with two variants in the definition, one with space and one without. Furthermore using \operatornamewithlimits seems inferior to \DeclareMathOperator. I'm voting for only using that. 128.208.3.75 02:58, 28 December 2006 (UTC)
I vote for deleting the "centering below max" paragraph, because it is mathmatically plainly nonsense. This implies arg(max_x f(x)), and in that case the arg function is undefined. Furthermore wasn't that the default behavior of \arg\max_x? So no need for this, we're not explaining how to use \newcommand on this page!! 128.208.3.75 03:01, 28 December 2006 (UTC)
We need to remove the section on how to use argmax in LaTeX from the enrty. OliAtlason (talk) 23:31, 7 May 2008 (UTC)
Removed reference material for the typesetting language LaTeX, it is not appropriate for an encyclopedia. OliAtlason (talk) 15:25, 21 May 2008 (UTC)
There should be an "=" symbol not an \in one in equation one. —Preceding unsigned comment added by 24.223.134.177 (talk) 16:10, 18 June 2008 (UTC)
I think this article should be merged with Mathematical optimization#Notation. Any opposite views? Isheden (talk) 17:00, 22 May 2011 (UTC)
How about merging with argument of a function? Isheden (talk) 22:16, 12 October 2011 (UTC)
A discussion of the empty set (and conventions about positive or negative infinity for unattained values) is needed.
The article overloads arg max. An explicit type conversion from singletons to points is needed. Kiefer.Wolfowitz 17:32, 22 May 2011 (UTC)
Paolo.dL asked me about the difference between arg sup/inf and arg max/min, but I was not able to give a complete answer. Help appreciated! Rinconsoleao (talk) 11:10, 19 July 2011 (UTC)
The min is the smallest value in a set. The inf is the greatest lower bound on the set. Frequently the two are the same, but in tricky cases there is an inf even if the min fails to exist. The relation between max and sup is analogous. Examples:
Summarizing: arg inf and arg sup are not synonyms for arg min and arg max, but in the cases when they fail to be equivalent I am not sure whether arg inf and arg sup are well-defined. Help appreciated. Rinconsoleao (talk) 11:07, 19 July 2011 (UTC)
I left another question about this here: Talk:Supremum#arg?. Rinconsoleao (talk) 12:05, 20 July 2011 (UTC)
The two expressions:
cannot both work. In the first, the subexpression ocurring as parameter to argmax is a variable. In the second, the parameter is the predicate , something completely different. Moreover, the second expression is unclear as to what is to be optimised, it could as well be or the membership of in .
I would suggest a clearer definition for instance: with the intended meaning that is the parameter for optimisation, and a predicate that must be satisfied for any considered value of . — Preceding unsigned comment added by 188.107.64.31 (talk) 11:31, 9 October 2011 (UTC)
I find that the current expression is misleading to the reader and is inconsistent with the conventional notation y = f(x).
Instead, I suggest the definition be re-expressed as:
or in LaTeX...
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.