Interior Point Methods of Mathematical Programming edited by Tamás Terlaky.

One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every­ body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Meth...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Terlaky, Tamás (Editor)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 1996.
Edition:1st ed. 1996.
Series:Applied Optimization, 5
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3231187
003 MWH
005 20191027031723.0
007 cr nn 008mamaa
008 111019s1996 xxu| s |||| 0|eng d
020 |a 9781461334491 
024 7 |a 10.1007/978-1-4613-3449-1  |2 doi 
035 |a (DE-He213)978-1-4613-3449-1 
050 4 |a E-Book 
072 7 |a PBU  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBU  |2 thema 
245 1 0 |a Interior Point Methods of Mathematical Programming  |h [electronic resource] /  |c edited by Tamás Terlaky. 
250 |a 1st ed. 1996. 
264 1 |a New York, NY :  |b Springer US :  |b Imprint: Springer,  |c 1996. 
300 |a XXII, 530 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Applied Optimization,  |x 1384-6485 ;  |v 5 
490 1 |a Springer eBook Collection 
505 0 |a I Linear Programming -- 1 Introduction to the Theory of Interior Point Methods -- 2 Affine Scaling Algorithm -- 3 Target-Following Methods for Linear Programming -- 4 Potential Reduction Algorithms -- 5 Infeasible-Interior-Point Algorithms -- 6 Implementation of Interior-Point Methods for Large Scale Linear Programs -- II Convex Programming -- 7 Interior-Point Methods for Classes of Convex Programs -- 8 Complementarity Problems -- 9 Semidefinite Programming -- 10 Implementing Barrier Methods for Nonlinear Programming -- III Applications, Extensions -- 11 Interior point Methods for Combinatorial Optimization -- 12 Interior Point Methods for Global Optimization -- 13 Interior Point Approaches for the VLSI Placement Problem. 
520 |a One has to make everything as simple as possible but, never more simple. Albert Einstein Discovery consists of seeing what every­ body has seen and thinking what nobody has thought. Albert S. ent_Gyorgy; The primary goal of this book is to provide an introduction to the theory of Interior Point Methods (IPMs) in Mathematical Programming. At the same time, we try to present a quick overview of the impact of extensions of IPMs on smooth nonlinear optimization and to demonstrate the potential of IPMs for solving difficult practical problems. The Simplex Method has dominated the theory and practice of mathematical pro­ gramming since 1947 when Dantzig discovered it. In the fifties and sixties several attempts were made to develop alternative solution methods. At that time the prin­ cipal base of interior point methods was also developed, for example in the work of Frisch (1955), Caroll (1961), Huard (1967), Fiacco and McCormick (1968) and Dikin (1967). In 1972 Klee and Minty made explicit that in the worst case some variants of the simplex method may require an exponential amount of work to solve Linear Programming (LP) problems. This was at the time when complexity theory became a topic of great interest. People started to classify mathematical programming prob­ lems as efficiently (in polynomial time) solvable and as difficult (NP-hard) problems. For a while it remained open whether LP was solvable in polynomial time or not. The break-through resolution ofthis problem was obtained by Khachijan (1989). 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Mathematical optimization. 
650 0 |a Operations research. 
650 0 |a Management science. 
650 0 |a Decision making. 
650 0 |a Electrical engineering. 
690 |a Electronic resources (E-books) 
700 1 |a Terlaky, Tamás.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Applied Optimization,  |x 1384-6485 ;  |v 5 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-4613-3449-1  |3 Click to view e-book  |t 0 
907 |a .b32311874  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g xxu  |h 0  |i 1 
912 |a ZDB-2-SMA 
912 |a ZDB-2-BAE 
950 |a Mathematics and Statistics (Springer-11649) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i2144352x  |z 02-26-20 
999 f f |i 43e10905-4bcd-5a1b-b41d-922889729834  |s dde07c25-cfd6-5d6f-a564-7b6a72170b65  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File