Introductory Lectures on Convex Optimization: Basic Course Applied Optimization, 87
Ubuy works hard to protect your security and privacy. Our advanced payment security system ensures confidentiality by encrypting your information during transmission using AES (Advanced Encryption Standards) and SSL (Secure Socket Layer) protocols. Your payment details are 100% secure as we do not share your payment details with third party sellers.
Fast
Shipping
Free
Return*
Secure Packaging
100% Original Products
PCI DSS Compliance
ISO 27001 Certified
Product Details
- 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.
| Publisher | Kluwer Academic Pub |
| Publication date | December 1, 2003 |
| Edition | 2004th |
| Language | English |
| Print length | 254 pages |
| ISBN-10 | 1402075537 |
| ISBN-13 | 978-1402075537 |
| Item Weight | 567 g |
| Dimensions | 6.25 x 1 x 10 inches (15.9 x 2.5 x 25.4 cm) |
Product Description
Introductory Lectures on Convex Optimization: Basic Course Applied Optimization, 87
Important information
- Limitations : For products shipped internationally, please note that any manufacturer warranty may not be valid; manufacturer service options may not be available; product manuals, instructions, and safety warnings may not be in destination country languages; the products (and accompanying materials) may not be designed in accordance with destination country standards, specifications, and labeling requirements; and the products may not conform to destination country voltage and other electrical standards (requiring use of an adapter or converter if appropriate). The recipient is responsible for assuring that the product can be lawfully imported to the destination country. When ordering from Ubuy or its affiliates, the recipient is the importer of record and must comply with all laws and regulations of the destination country.
- Not all the products listed on Ubuy are for sale, as Ubuy is a global search engine. Products are subject to export/trade regulations.
Currently unavailable.
We don't know when or if this item will be back in stock.
This item is not restrict in my country.(Please click on above link if this item is not restrict in your country, So our team will review and allow.)
PCI DSS compliant and ISO 27001:2022 certified, with encrypted payments and full buyer protection on every order.
Ubuy Assurance
Experience worry-free shopping with 100% original products, PCI DSS-compliant payment security, ISO 27001-certified data protection, the fastest cross-border delivery, free returns *, and secure packaging on every order.
