Picture 1 of 1

Gallery
Picture 1 of 1

Have one to sell?
Introductory Lectures on Convex Optimization: A Basic Course by Y Nesterov: New
US $220.54
as low as $38.27/mo with
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages. See the seller’s listing for full details.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free Standard Shipping.
Located in: Sparks, Nevada, United States
Delivery:
Estimated between Fri, Oct 24 and Wed, Oct 29 to 94104
Returns:
30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Payments:
.
*No Interest if paid in full in 6 months on $149+. See terms and apply now- for PayPal Credit, opens in a new window or tab
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:284357521774
Item specifics
- Condition
- Book Title
- Introductory Lectures on Convex Optimization: A Basic Course
- Publication Date
- 2003-12-31
- Pages
- 236
- ISBN
- 9781402075537
- Subject Area
- Mathematics, Computers
- Publication Name
- Introductory Lectures on Convex Optimization : a Basic Course
- Publisher
- Springer
- Item Length
- 9.3 in
- Subject
- Computer Science, Optimization
- Publication Year
- 2003
- Series
- Applied Optimization Ser.
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Weight
- 42.3 Oz
- Item Width
- 6.1 in
- Number of Pages
- Xviii, 236 Pages
About this product
Product Identifiers
Publisher
Springer
ISBN-10
1402075537
ISBN-13
9781402075537
eBay Product ID (ePID)
30438878
Product Key Features
Number of Pages
Xviii, 236 Pages
Publication Name
Introductory Lectures on Convex Optimization : a Basic Course
Language
English
Publication Year
2003
Subject
Computer Science, Optimization
Type
Textbook
Subject Area
Mathematics, Computers
Series
Applied Optimization Ser.
Format
Hardcover
Dimensions
Item Weight
42.3 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2003-061994
Dewey Edition
22
Series Volume Number
87
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
519.6
Synopsis
It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12]., It was in the middle of the 1980s, when the seminal paper by Kar- markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op- timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre- diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc- tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop- ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs[12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12]., It was in the middle of the 1980s, when the seminal paper by Kar- markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op- timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre- diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc- tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop- ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs 12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph 12]., It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs[12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12]., The first elementary exposition of core ideas of complexity theory for convex optimization, this book explores optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. Also covers polynomial-time interior-point methods.
LC Classification Number
QA402.5-402.6
Item description from the seller
Seller feedback (537,827)
- e***n (392)- Feedback left by buyer.Past 6 monthsVerified purchaseGreat transaction, exactly as described, packed well, and promptly shipped on August 6th. Unfortunately the U.S. Postal Service took 23 calendar days to deliver the book. It was shipped from Pennsylvania, to Atlanta, past Alabama to Texas, enjoyed several days in Texas, then to Minneapolis, Jacksonville, Florida, back to Atlanta, finally to Birmingham, and Huntsville. The seller was very responsive and I decided it was interesting to see if/how the book would arrive. Thanks, Joe
- 0***g (380)- Feedback left by buyer.Past monthVerified purchaseExcellent purchase. Was able to get all three items from the one seller. Seller was able to bundle all three items together into one package. Items as described and arrived in perfect condition. Good communication around shipping and tracking as items delayed and not able to be delivered by original estimate. Thanks to shipping updates I was able to track the items arriving before the extended delivery time. Thank you for making these items available on EBay.
- _***b (63)- Feedback left by buyer.Past 6 monthsVerified purchaseI gave 5 stars on shipping because i sent 2 separate emails + they responded with helpful info, even though it arrived late. This was a great value with free shipping + the condition is very good, better than advertised 🙂! The overall quality and appearance is excellent! I highly recommend this seller and give them 👍👍👍👍