User talk:Johngcarlsson

From Wikipedia, the free encyclopedia

Welcome!

Hello, Johngcarlsson, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~~~); this will automatically produce your name and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or place {{helpme}} on your talk page and ask your question there. Again, welcome! 

And a few style notes. One is that one should use lower case in section names, so

 ==Standard form==

instead of

 ==Standard Form==

and second that using an edit summary is helpful for others reviewing your work. Enjoy the wiki. – Oleg Alexandrov (talk) 16:06, 15 February 2007 (UTC)

Contents

[edit] Many optimization problems are hard to solve

Hi John. Also a warm welcome from me. I have been enjoying your efforts to get our optimization articles in better shape. However, I'm a bit unsure about your latest change to Optimization (mathematics). You say that there are several classes of optimization problems, like LP, and that most classes are hard, but convex is not. I'm a bit worried that the way you formulate and combine these statements leads the reader to conclude that linear programming must be hard and thus not convex optimization. I'm having problems formulating quite what my issue is, so perhaps I'm just chasing some fleeting illusion, but could you please have another look at the paragraph you added?

By the way, have you already found Wikipedia:WikiProject Mathematics, the meeting place for people interested in working on the maths articles? We have a list of participants; feel free to introduce yourself there. The associated talk page is a good place if you want to contact mathematicians.

I hope that you are enjoying yourself here and that I will see more of your contributions soon! Cheers, Jitse Niesen (talk) 11:37, 1 March 2007 (UTC)

[edit] Quasiconvex function

Hi. Why do you think it is false for a quasiconvex function that

You can reply here, thanks. Oleg Alexandrov (talk) 16:04, 1 March 2007 (UTC)

Hi Oleg, consider the function

f(x) = |x| for x < 1

f(x) = 1 for x >= 1

This has a local minimumn wherever x>= 1, but it's not a global minimum.Johngcarlsson 20:16, 1 March 2007 (UTC)

You are right. To my credit, it was not me who added in that statement, but I was nevertheless sure it was true. Thanks. Oleg Alexandrov (talk) 04:35, 2 March 2007 (UTC)

[edit] License tagging for Image:Ellipsoid 1.png

Thanks for uploading Image:Ellipsoid 1.png. Wikipedia gets thousands of images uploaded every day, and in order to verify that the images can be legally used on Wikipedia, the source and copyright status must be indicated. Images need to have an image tag applied to the image description page indicating the copyright status of the image. This uniform and easy-to-understand method of indicating the license status allows potential re-users of the images to know what they are allowed to do with the images.

For more information on using images, see the following pages:

This is an automated notice by OrphanBot. If you need help on selecting a tag to use, or in adding the tag to the image description, feel free to post a message at Wikipedia:Media copyright questions. 07:05, 6 March 2007 (UTC)

[edit] Edit summary

Hi. It would be nice if you could use an edit summary explaining your changes. Thanks for your work, particularly the new Subgradient method article. Oleg Alexandrov (talk) 03:14, 7 March 2007 (UTC)

[edit] Linear matrix inequality

After this edit of yours to linear matrix inequality, the article says that "the A \leq 0 inequality means that A is a negative-definite matrix". I assume that you mean negative semi-definite? If so, could you please fix that? If not, sorry for bothering you. Cheers, Jitse Niesen (talk) 06:12, 15 March 2007 (UTC)

[edit] Re:Posynomial

I replied on my talk page. Oleg Alexandrov (talk) 15:03, 5 April 2007 (UTC)