Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Home > Science & Mathematics > Mathematics > Optimization > Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

Black Box Optimization, Machine Learning, and No-Free Lunch Theorems


     0     
5
4
3
2
1



Available


About the Book

Learning enabled constrained black box optimization (Archetti).- Black-box optimization: Methods and applications (Hasan).- Tuning algorithms for stochastic black-box optimization: State of the art and future perspectives (Bartz-Beielstein).- Quality diversity optimization: A novel branch of stochastic optimization (Chatzilygeroudis).- Multi-objective evolutionary algorithms: Past, present and future (Coello C.A).- Black-box and data driven computation (Du).- Mathematically rigorous global optimization and fuzzy optimization: A brief comparison of paradigms, methods, similarities and differences (Kearfott).- Optimization under Uncertainty Explains Empirical Success of Deep Learning Heuristics (Kreinovich).- Variable neighborhood programming as a tool of machine learning (Mladenovic).- Non-lattice covering and quanitization of high dimensional sets (Zhigljavsky).- Finding effective SAT partitionings via black-box optimization (Semenov).- The No Free Lunch Theorem: What are its main implications for the optimization practice? ( Serafino).- What is important about the No Free Lunch theorems? (Wolpert).


About the Author: ​Panos M. Pardalos serves as distinguished professor of industrial and systems engineering at the University of Florida. Additionally, he is the Paul and Heidi Brown Preeminent Professor of industrial and systems engineering. Professor Pardalos is also an affiliated faculty member of the computer and information science department, the Hellenic Studies Center, and the biomedical engineering program. Additionally, he serves as the director of the Center for Applied Optimization. Professor Pardalos is a world leading expert in global and combinatorial optimization. His recent research interests include network design problems, optimization in telecommunications, ecommerce, data mining, biomedical applications, and massive computing. Panos Pardalos is a prolific author who lectures all over the world. He is the recipient of a multitude of fellowships and awards, the most recent of which is the Humboldt Research Award (2018).
Varvara A. Rasskazova is a Researcher and Senior Lecture in Moscow Aviation Institute. The area of scientific interests is discrete optimization and guaranteed approximation algorithms for solving transportation and assignment problems on Railway and Metallurgical Production. She is an active participant of regular international conferences on Operations Research and Mathematical Programming, and author of more than 40 publications.

Michael N. Vrahatis focuses on mathematics, natural computing and computational intelligence, global optimization, reliable computing and imprecise data, artificial neural networks and machine learning. He has participated in the organization of over 300 conferences serving at several positions, and participated in more than 240 conferences, congresses and advanced schools as active participant, speaker or keynote speaker. He has been a visiting research fellow in many different institutions including Cornell, MIT, CERN, and INRIA. He is a professor in the Department of Mathematics at the University of Patras since 2000. He is also serving as the director of the newly founded Institute of Artificial Intelligence of University of Patras. The corpus of his work consists of over 400 publications. According to Google Scholar his work has been cited more than 16000 times (h-index 56).


Best Sellers



Product Details
  • ISBN-13: 9783030665142
  • Publisher: Springer International Publishing
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 388
  • Series Title: Springer Optimization and Its Applications
  • Weight: 784 gr
  • ISBN-10: 3030665143
  • Publisher Date: 11 May 2021
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Spine Width: 22 mm
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Springer International Publishing -
Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
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.

Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

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



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!