國立虎尾科技大學 |

A penalty method for network quadratic programming via a nonsmooth Newton's approach.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	A penalty method for network quadratic programming via a nonsmooth Newton's approach./
Author:	Kuo, Hsi.
Description:	1 online resource (94 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 54-04, Section: B.
Contained By:	Dissertations Abstracts International54-04B.
Subject:	Industrial engineering. -
Online resource:	click for full text (PQDT)
ISBN:	9798207685120

A penalty method for network quadratic programming via a nonsmooth Newton's approach.
Kuo, Hsi.

A penalty method for network quadratic programming via a nonsmooth Newton's approach. - 1 online resource (94 pages)

Source: Dissertations Abstracts International, Volume: 54-04, Section: B.

Thesis (Ph.D.)--Northwestern University, 1992.

Includes bibliographical references

In this dissertation, we present an exterior penalty method for network quadratic programming (NQP) problems. After adding penalty terms, the objective function of the NQP becomes a separable, continuously differentiable, piecewise quadratic convex function. We then apply a recently developed nonsmooth Newton's method to find the optimal solution. In order to avoid inverse operations of the generalized Hessians, we develop an iterative algorithm as a direction-finding subroutine. The iterative algorithm is implemented by using graphical instead of algebraic operations. The implementations and convergence properties of this algorithm are discussed in detail. A minimum spanning tree is used to accelerate the convergence. We also propose a revised piecewise linearization algorithm to give the Newton method a warm start. Numerical experiments on these algorithms are summarized, which include transportation, assigment and transshipment problems with up to 400 nodes and 10,000 arcs.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798207685120Subjects--Topical Terms:

679492
Industrial engineering.
Index Terms--Genre/Form:

554714
Electronic books.

A penalty method for network quadratic programming via a nonsmooth Newton's approach.
LDR:02212ntm a22003257 4500 001 1144354
005 20240531083834.5
006 m o d
007 cr mn ---uuuuu
008 250605s1992 xx obm 000 0 eng d
020 $a 9798207685120
035 $a (MiAaPQ)AAI9229939
035 $a AAI9229939
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Kuo, Hsi. $3 1469349
245 1 2 $a A penalty method for network quadratic programming via a nonsmooth Newton's approach.
264 0 $c 1992
300 $a 1 online resource (94 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 54-04, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Sun, Jie.
502 $a Thesis (Ph.D.)--Northwestern University, 1992.
504 $a Includes bibliographical references
520 $a In this dissertation, we present an exterior penalty method for network quadratic programming (NQP) problems. After adding penalty terms, the objective function of the NQP becomes a separable, continuously differentiable, piecewise quadratic convex function. We then apply a recently developed nonsmooth Newton's method to find the optimal solution. In order to avoid inverse operations of the generalized Hessians, we develop an iterative algorithm as a direction-finding subroutine. The iterative algorithm is implemented by using graphical instead of algebraic operations. The implementations and convergence properties of this algorithm are discussed in detail. A minimum spanning tree is used to accelerate the convergence. We also propose a revised piecewise linearization algorithm to give the Newton method a warm start. Numerical experiments on these algorithms are summarized, which include transportation, assigment and transshipment problems with up to 400 nodes and 10,000 arcs.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Industrial engineering. $3 679492
655 7 $a Electronic books. $2 local $3 554714
690 $a 0546
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Northwestern University. $3 1184372
773 0 $t Dissertations Abstracts International $g 54-04B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9229939 $z click for full text (PQDT)