close menu
Bookswagon-24x7 online bookstore
close menu
My Account
50%
Nondifferentiable Optimization: (Translations Series in Mathematics and Engineering)

Nondifferentiable Optimization: (Translations Series in Mathematics and Engineering)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

Of recent coinage, the term "nondifferentiable optimization" (NDO) covers a spectrum of problems related to finding extremal values of nondifferentiable functions. Problems of minimizing nonsmooth functions arise in engineering applications as well as in mathematics proper. The Chebyshev approximation problem is an ample illustration of this. Without loss of generality, we shall consider only minimization problems. Among nonsmooth minimization problems, minimax problems and convex problems have been studied extensively ([31], [36], [57], [110], [120]). Interest in NDO has been constantly growing in recent years (monographs: [30], [81], [127] and articles and papers: [14], [20], [87]-[89], [98], [130], [135], [140]-[142], [152], [153], [160], all dealing with various aspects of non- smooth optimization). For solving an arbitrary minimization problem, it is neces- sary to: 1. Study properties of the objective function, in particular, its differentiability and directional differentiability. 2. Establish necessary (and, if possible, sufficient) condi- tions for a global or local minimum. 3. Find the direction of descent (steepest or, simply, feasible--in appropriate sense). 4. Construct methods of successive approximation. In this book, the minimization problems for nonsmooth func- tions of a finite number of variables are considered. Of fun- damental importance are necessary conditions for an extremum (for example, [24], [45], [57], [73], [74], [103], [159], [163], [167], [168].

Table of Contents:
1. Fundamentals of Convex Analysis and Related Problems.- 1. Convex sets. Convex hulls. Separation theorem.- 2. Point-to-set mappings.- 3. Convex cone. Cone of feasible directions. Conjugate cone.- 4. Convex functions. Continuity and directional differentiability.- 5. Subgradients and subdifferentials of convex functions.- 6. Distance from a set to a cone. Conditions for a minimum.- 7. ?-subdifferentials.- 8. Directional ?-derivatives. Continuity of the ?-subdifferential mapping.- 9. Some properties and inequalities for convex functions.- 10. Conditional ?-subdifferentials.- 11. Conditional directional derivatives. Continuity of the conditional ?-subdifferential mapping.- 12. Representation of a convex set by means of inequalities.- 13. Normal cones. Conical mappings.- 14. Directional differentiability of a supremum function.- 15. Differentiability of a convex function.- 16. Conjugate functions.- 17. Computation of ?-subgradients of some classes of convex function.- 2. Quasidifferentiable Functions.- 1. Definition and examples of quasidifferentiable functions.- 2. Basic properties of quasidifferentiable functions. Basic formulas of quasidifferential calculus.- 3. Calculating quasidifferentials: examples.- 4. Quasidifferentiability of convexo-concave functions.- 5. Necessary conditions for an extremum of a quasidifferentiable function on En.- 6. Quasidifferentiable sets.- 7. Necessary conditions for an extremum of a quasidifferentiable function on a quasidifferentiable set.- 8. The distance function from a point to a set.- 9. Implicit function.- 3. Minimization on the Entire Space.- 1. Necessary and sufficient conditions for a minimum of a convex function on En.- 2. Minimization of a smooth function.- 3. The method of steepest descent.- 4. The subgradient methodfor minimizing a convex function.- 5. The multistep subgradient method.- 6. The relaxation-subgradient method.- 7. The relaxation ?-subgradient method.- 8. The Kelley method.- 9. Minimization of a supremum-type function.- 10. Minimization of a convex maximum-type function and the extremum-basis method.- 11. A numerical method for minimizing quasidifferentiable functions.- 4. Constrained Minimization.- 1. Necessary and sufficient conditions for a minimum of a convex function on a convex set.- 2. ?-stationary points.- 3. The conditional gradient method.- 4. The method of steepest descent for the minimization of convex functions.- 5. The (?,µ)-subgradient method in the presence of constraints.- 6. The subgradient method with a constant step-size.- 7. The modified (?,µ)-subgradient method in the presence of constraints.- 8. The nonsmooth penalty-function method.- 9. The Kelley method for the minimization on a convex set.- 10. The relaxation-subgradient method in the presence of constraints.- Notes and Comments.- References.- Appendix 1. Bibliography and guide to publications on Quasidifferential Calculus.- Appendix 2. Bibliography on Quasidifferential Calculus as of January 1, 1985.- List of forthcoming publications.- Transliteration table.


Best Seller

| | See All

Product Details
  • ISBN-13: 9781461382706
  • Publisher: Springer-Verlag New York Inc.
  • Publisher Imprint: Springer-Verlag New York Inc.
  • Depth: 32
  • Height: 244 mm
  • No of Pages: 452
  • Series Title: Translations Series in Mathematics and Engineering
  • Weight: 757 gr
  • ISBN-10: 146138270X
  • Publisher Date: 28 Jan 2012
  • Binding: Paperback
  • Edition: Softcover reprint of the original 1st ed. 1985
  • Language: English
  • Returnable: N
  • Spine Width: 25 mm
  • Width: 170 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Be The First to Review
Nondifferentiable Optimization: (Translations Series in Mathematics and Engineering)
Springer-Verlag New York Inc. -
Nondifferentiable Optimization: (Translations Series in Mathematics and Engineering)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Nondifferentiable Optimization: (Translations Series in Mathematics and Engineering)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA