Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Optimization: Algorithms and Consistent Approximations
.
Bookmark this Record
Catalogue Record 42088
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 42088
.
Reviews
Catalogue Record 42088
.
British Library
Resolver for RSN-42088
Google Scholar
Resolver for RSN-42088
WorldCat
Resolver for RSN-42088
Catalogo Nazionale SBN
Resolver for RSN-42088
GoogleBooks
Resolver for RSN-42088
ICTP Library
Resolver for RSN-42088
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
515.64
Title
Optimization ([EBook]) : Algorithms and Consistent Approximations / by Elijah Polak.
Author
Polak, Elijah , 1931-
Other name(s)
SpringerLink (Online service)
Publication
New York, NY : Springer , 1997.
Physical Details
XX, 782 pages : online resource.
Series
Applied mathematical sciences
0066-5452 ; ; 124
ISBN
9781461206637
Summary Note
This book deals with optimality conditions, algorithms, and discretization tech niques for nonlinear programming, semi-infinite optimization, and optimal con trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo rithms. Second, many optimization algorithms can be shown to use search directions that are obtained in evaluating optimality functions, thus establishing a clear relationship between optimality conditions and algorithms. Third, estab lishing optimality conditions for highly complex problems, such as optimal con trol problems with control and trajectory constraints, is much easier in terms of optimality functions than in the classical manner. In addition, the relationship between optimality conditions for finite-dimensional problems and semi-infinite optimization and optimal control problems becomes transparent.:
Contents note
Contents: Unconstrained Optimization -- Optimality Conditions -- Algorithm Models and Convergence Conditions I -- Gradient Methods -- Newton's Method -- Methods of Conjugate Directions -- Quasi-Newton Methods -- One Dimensional Optimization -- Newton's Method for Equations and Inequalities -- Finite Minimax and Constrained Optimization -- Optimality Conditions for Minimax -- Optimality Conditions for Constrained Optimization -- Algorithm Models and Convergence Conditions II -- First-Order Minimax Algorithms -- Newton's Method for Minimax Problems -- Phase I. Phase II Methods of Centers -- Penalty Function Algorithms -- An Augmented Lagrangian Method.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4612-0663-7
Links to Related Works
Subject References:
Algorithms
.
Calculus of variations
.
Calculus of variations and optimal control; optimization
.
Decision making
.
Engineering mathematics
.
Mathematical optimization
.
Nonlinear programming
.
Operations research
.
System theory
.
Authors:
Polak, Elijah 1931-
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Applied mathematical sciences
.
Classification:
515.64
.
.
ISBD Display
Catalogue Record 42088
.
Tag Display
Catalogue Record 42088
.
Related Works
Catalogue Record 42088
.
Marc XML
Catalogue Record 42088
.
Add Title to Basket
Catalogue Record 42088
.
Catalogue Information 42088
Beginning of record
.
Catalogue Information 42088
Top of page
.
Download Title
Catalogue Record 42088
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
42088
1
42088
-
2
42088
-
3
42088
-
4
42088
-
5
42088
-
Quick Search
Search for