Skip to main content
SpringerLink
Log in

Constrained Global Optimization: Algorithms and Applications

  • Book
  • © 1987

Overview

Editors:
  1. Panos M. Pardalos
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. Ben Rosen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 268)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Download chapter PDF

  2. Convex sets and functions

    Pages 1-12

  3. Optimality conditions in nonlinear programming

    Pages 13-23

  4. Combinatorial optimization problems that can be formulated as nonconvex quadratic problems

    Pages 24-33

  5. Enumerative methods in nonconvex programming

    Pages 34-48

  6. Cutting plane methods

    Pages 49-57

  7. Branch and bound methods

    Pages 58-74

  8. Bilinear programming methods for nonconvex quadratic problems

    Pages 75-83

  9. Large scale problems

    Pages 84-100

  10. Global minimization of indefinite quadratic problems

    Pages 101-117

  11. Test problems for global nonconvex quadratic programming algorithms

    Pages 118-122

  12. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

Global optimization is concerned with the characterization and computation of global minima or maxima of nonlinear functions. Such problems are widespread in mathematical modeling of real world systems for a very broad range of applications. The applications include economies of scale, fixed charges, allocation and location problems, quadratic assignment and a number of other combinatorial optimization problems. More recently it has been shown that certain aspects of VLSI chip design and database problems can be formulated as constrained global optimization problems with a quadratic objective function. Although standard nonlinear programming algorithms will usually obtain a local minimum to the problem , such a local minimum will only be global when certain conditions are satisfied (such as f and K being convex).

Bibliographic Information

  • Book Title: Constrained Global Optimization: Algorithms and Applications

  • Editors: Panos M. Pardalos, J. Ben Rosen

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0000035

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1987

  • Softcover ISBN: 978-3-540-18095-1Published: 15 July 1987

  • eBook ISBN: 978-3-540-47755-6Published: 05 October 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: IX, 143

  • Topics: Numerical Analysis

Publish with us

Policies and ethics

Back to top

Search

Navigation