Recent Advances in Global Optimization
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Recent Advances in Global Optimization: (Princeton Legacy Library)
Recent Advances in Global Optimization: (Princeton Legacy Library)

Recent Advances in Global Optimization: (Princeton Legacy Library)


     0     
5
4
3
2
1



International Edition


X
About the Book

This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems. Originally published in 1991. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Table of Contents:
PrefaceOn Approximation Algorithms for Concave Quadratic Programming3A New Complexity Result on Minimization of a Quadratic Function with a Sphere Constraint19Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points32Performance of Local Search in Minimum Concave-Cost Network Flow Problems50Solution of the Concave Linear Complementary Problem76Global Solvability of Generalized Linear Complementarity Problems and a Related Class of Polynomial Complementarity Problems102A Continuous Approach to Compute Upper Bounds in Quadratic Maximization Problems with Integer Constraints125A Class of Global Optimization Problems Solvable by Sequential Unconstrained Convex Minimization141A New Cutting Plane Algorithm for a Class of Reverse Convex 0-1 Integer Programs152Global Optimization of Problems with Polynomial Functions in One Variable165One Dimensional Global Optimization Using Linear Lower Bounds200Optimizing the Sum of Linear Fractional Functions221Minimizing and Maximizing the Product of Linear Fractional Functions259Numerical Methods for Global Optimization274Integral Global Optimization of Constrained Problems in Functional Spaces with Discontinuous Penalty Functions298Rigorous Methods for Global Optimization321Global Optimization of Composite Laminates Using Improving Hit and Run343Stochastic Minimization of Lipschitz Functions369Topographical Global Optimization384Lipschitzian Global Optimization: Some Prospective Applications399Packet Annealing: A Deterministic Method for Global Minimization, Application to Molecular Conformation433Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems478Mixed-Integer Nonlinear Programming on Generalized Networks513Global Minima in Root Finding543Homotopy-Continuation Algorithm for Global Optimization561Space-Covering Approach and Modified Frank-Wolfe Algorithm for Optimal Nuclear Reactor Reload Design593A Global Optimization Approach to Software Testing616

Review :
"This excellent book covers a broad range of topics (all in the area of global optimization)... This volume would be a valuable addition to the library of all those doing active research in global optimization and its applications. In addition, the book is well suited as a reference for scientists working in related disciplines."--Journal of Global Optimization


Best Sellers


Product Details
  • ISBN-13: 9780691602370
  • Publisher: Princeton University Press
  • Publisher Imprint: Princeton University Press
  • Height: 229 mm
  • No of Pages: 644
  • Series Title: Princeton Legacy Library
  • Weight: 879 gr
  • ISBN-10: 0691602379
  • Publisher Date: 14 Jul 2014
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: Princeton Legacy Library
  • Width: 152 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Recent Advances in Global Optimization: (Princeton Legacy Library)
Princeton University Press -
Recent Advances in Global Optimization: (Princeton Legacy Library)
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.

Recent Advances in Global Optimization: (Princeton Legacy Library)

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!