Christakis Charalambous, B.Sc.(Eng.} A Thesis. Submitted to the Faculty of Graduate Studies. in Partial Fulfilment of the Requirements.
|
|
- Oswin Hines
- 5 years ago
- Views:
Transcription
1 NONLINEAR LEAST pth APPROXDfATION AND NONL:':NEAR PROGRAMMING WITH APPLICATIONS IN THE DESIGN OF NETWORKS AND SYSTEMS by Christakis Charalambous, B.Sc.(Eng.} A Thesis Submitted to the Faculty of Graduate Studies in Partial Fulfilment of the Requirements for the Degree Doctor of Philosophy Mc~fastet' University February 1973 ~ Christakis Charalambous 1973
2 NONLINEAR LEAST pte APPROXI~~TION WITH APPLICATIONS
3 DOCtOR OF PHILOSOPHY (1973) McMaster University Hamilton, Ontario title AutHOR SUPERVISOR : Nonlinear Least pth Approximation and Nonlinear Programming with Applications in the Design of Networks and Systems Christakis Charalambous B.Sc.(Eng.)(University of Surrey) J.W. Bandler B.Sc.(Eng.), Ph.D. (University of London) D.I.C. (Imperial College) NUMBER OF PAGES: ix, 156 SCOPE AND CON'IEN'IS: the purpose of this thesis is to present a unified treatment of nonlinear least pth and nonlinear minimax approximation problems, and a new method for nonlinear programming. Least pth approximation with values of p in the range 1,000 to l~~oo,ooo in conjunction with the Fletcher-Powell and Fletcher algorithms have been successfully applied to a variety of network and system optimization problems. A comparison is made between two new ~lgorithrns for nonlinear minimax approximation and some of the existing ones. Also, the new approach to nonlinear programming is compared with the well-known SUMT. A critical review of unconstrained optimization is also included. ii
4 ACKNOtf:LEDGE~mNTS The author wishes to express appreciation to Dr. J.W. Bandler for his guidance and encouragement in the preparation of this thesis. The author thanks the other members of the Supervisory Committee, Dr. C.M. Crowe, Dr. T.M.K. Davison and Dr. E. Della Torre for their interest and encouragement. The author wishes to thank Dr. R.E. Seviora whose early suggestion~ resulted in a turning point in this work. Thanks go to B.L. Bardakjian, J. Chen, V.K. Jha, N.D. ~~rkettos, P. Liu, J.R. ropovic and T.V. Srinivasan who implemented some of the ideas presented in this thesis. Discussions with W. Kinsner are acknowledge~. The author is grateful for the generous support of the National Research Council of Canada through grants A7239 and C154, and through the award of an NRC Scholarship. The author's special thanks go to his wife Mary without whose patience this work could not have been undertaken. Thanks go. to Mrs. K. Paulin for her expert typing of the manuscript. iii
5 TABLE OF CONTENTS CHAPTER 1 - INTRODUCTION CHAPTER 2 - UNCONSTRAINED OPTIMIZATION Fundamental Concepts and Definitions Multidimensional Gradient Strategies Steepest Descent Newton Method Huang's Generalized Algorithm (1970) Special Case Special Case Fletcher Algorithm (1970a) CHAPTER 3 - GENERALIZED LEAST pth APPROXDIATION Introduction Leaet pth Approximation for Single Specified Function The Error Function Continuous Approximation Discrete Approximation Generalized Least pth Objectives The Error Functions Case 1 - Specification Violated Case 2 - Specification Satisfied Discussion Conclusions CHAPTER 4 - CONDITIONS FOR OPTIMALITY Introduction Objective Functions for Both Cases Case 1 - Specification Violated Case 2 - Specification Satisfied Assumptions Two Theorems Theorem Proof for Case Proof for Case Theorem Proof for Case Proof for Case Optimality Conditions for Complex Error iv
6 CHAPTER 4 - Continued Page Examples Second-Order Model of a Fourth- Order System Quarter-Wave Transmission-Line Transformer Conclusions 46 CHAPTER 5 - PRACTICAL LEAST pta OPTIMIZATION Introduction Definitions The Objective Function Case 1 - Specification Violated Case 2 - Specificntion Satisfied Examples Design Examples Two- and Three-Section Transmission- Line Transformer Five-Section Transmission-Line Filter Lumped-Distributed-Active Filter Discussion Conclusions 81 CHAPTER 6 - NONLINEAR MINIMAX OPTI}lIZATION Introduction Background Theory Derivation of Algorithm Computational Procedure Assumptions Lemma Lemma Lemma Theorem Theorem Theorem Derivation of Algorithm Computational Procedure Lemma LerJma Theorem Theorem Theorem Examples Problem Problem v
7 CHAPTER 6 - Continued Page Design Examples Second-Order Model of a Fourth- Order System Three-Section Transmission-Line Transformer Nonlinear ~animax Optfmization with Constraints Conclusions 119 CHAPTER 7 - NONLINEAR PROGRAMMING USING MINIMAX TECHNIQUES Introduction The Nonlinear Programming Problem An Equivalent Minimax Problem Theorem Possible Implementation l2~ Comments Examples The Post Office Parcel Problem (Rosenbrock 1960) The Beale Problem (Beale 1967) The Rosen-Su:uki Problem (Rosen and Suzuki 1965) Quadratic Function with Equality Constraints Conclusions 136 CHAPTER 8 - CONCLUSIONS 139 REFERENCES 142 APPENDIX 150 AUTHOR INDEX 154 vi
8 --, I LIST OF FIGURES Figure Fig. 3.1 Fig. 3.2 Fig. 3.3 Example of a design problem for which it is generally impossible for the response to exceed the specification. Case 1 is applicable. Example of a design problem in which the response exceeds the specification. Case 2 is applicable. Sketches to illustrate the behaviour of components of possible generalized least pth objectives. f(x) is convex, continuous with continuous derivatives. p>l in (b) and (c). p~l in (d) Fig. 4.l(a) Fig. 4.1 (b) Fig. 4.2 Optimum error for least pth approximation with p equal to 2 for the problem in Section 4.6.l~ Optimum error for least pth approximation with p equal to 10,000 for the problem in Section Pi(P) or li(p), as appropriate, calculated at specified values of time and for certain values of p for the problem in Section Fig. 5.1 Contours of U for p = Fig. 5.2 Contours of U for p = 2 55 Fig. 5.3 Contours of U for p = Fig. 5.4 Contours of U for p = Fig. 5.5 Optimization from Zl=1. 0, Z2=3.0, (a) Fletcher, 61 (b) Fletcher and Powell. Fig. 5.6 Optimization from Zl=1. 0, Z2=6.0, (a) Fletcher, 62 (b) Fletcher and Powell. F:f.g. 5.7 Optimization from Zl=3.5, Z2=6.0, (a) Fletcher, 63 (b) Fletcher and Powell. vii
9 Figure Page Fig. 5.8 Optimization from Zl=3.5, Z2=3.0, (a) Fletcher, 64 (b) Fletcher and Powell. Fi~. 5.9 Optimization from Zl=1.5, Z2=3.0, Z3~6.0, 65 tl/t~=0.8, t2/~=1.2, t3/lq=0.a, (a) Fletcher, (b) letcher an Powell. Fig. 5!10 5-section transmission-line lowpass filter. 66 Fig Optimized response of the circuit of Fig subject to the constraints imposed for Problem 1, Section Fig Fig Fig Fig Fig Fig Optimized response of the circuit of Fig subject to the constraints imposed for Problem 2, Section Passband details of the optimized response shown 71 in Fig Third-order lumped-distributed-active lowpass 72 filter. Optimized, gain of the circuit of Fig subject 77 to the constraints imposed for Problem 1, Section Optimized gain of the circuit of Fig subject 78 to the constraints imposed for Problem 2, Section Optimized gain of the circuit of Fig subject 79 to the constraints imposed for Problem 3, Section Fig. 6.1 Fig. 6.2 Fig. 6.3 Fig. 6.4 Fig. 6.5 Contours of U (~) for Problem ", Contours of U 2 (t,~) for Problem 6.1 with ~ = o. 99 Contours of U2<t'~) for Problem 6.1 with 100 ~= e. Contours of U2(t,~) for Problem 6.1 with 101 ~=2.036l+E. Contours of Uoo<t) for Problem viii
10 Figure Page Fig. 7.1 Contours for the Post Office Parcel Problem 127 when a=200. Fig. 7.2 Contours for the Post Office Parcel Problem 128 when a=245. Fig. 7.3 Contours for the Post Office Parcel Problem 129 when a=300. Fig. 7.4 Contours for the Post Office Parcel Problem 130 when a"'106 Fig. 7.5 Contours for the quadratic function when a-l. 137 Fig. A.1(a) Original network. 151 Fig. A.1(b) Adjoint network. lsi ix
11 CHAPTER 1 INTRODUCTION This thesis is basically centered around the theoretical and practical implementation of least pth approximation for cases where we have upper and lower response specifications, such as are encountered in filter design, and on new methods for nonlinear programming. Since, throughout the thesi~we will often have unconstrained objective functions to be minimized, Chaptar 2 is devoted to the most important gradient algorithms for unconstrained optimization, such as those by Huang (1970), Fletcher and Powell (1963), and Fletcher (1970a). Usually least pth approximation is applied to the approximation of single specified functions by a network or system response. Chapter 3 extends the usefulness of least pth approximation to a wider variety of network and system design problems and a wider range of specifications than appear to have been considered previously from the least pth point of view. See Eandler and Charalambous (197la, 1972c). Using the above extension of least pth approximation it w~s possible to derive the necessary and sufficient conditions for optimality in generalized nonlinear least pth approximation problems for p + ~ (Bandler and Charalambous 1971b, 1972b, 1973a). In the limit the conditions for a minimax approximation are derived as is to be expected. See, for example, Band1er (1971). This is discussed in Chapter 4. 1
12 2 It is very well known that 1ea~t pth approximation with a sufficiently large value of p cant in princip1e t be used to achieve a near minimax solution. Chapter 5 shows how to eliminate the i11 conditioning which arises when the value of p is extremely large. The important feature of this approach is the use that can be made of efficient gradient minimization techniques such as the Fletcher and Powell method (1963) and the more recent Fletcher method (1970a) in conjunction with least pth objective functions employing extremely large values of Pt typically 1 t OOO to 1 t OOO t OOO. At the time when this approach was developed the largest value of p successfully used and reported in the literature wast to the author's know1edge t 10. Application of this method to microwave design problems and to 1umpeddistributed-active filters is included (Band1er and Chara1ambous 1971c t 1972dt 1972e). See also Band1er t Chara1ambous and Tam (1972). Chapter 6 presents two new algorithms for nonlinear minimax optimization. The nonlinear optimization problem is solved by transforming it into a sequence of least pth optimization problems with a b-i.y!ue value of p (Chara1ambous and Band1er J.973a). From the experimental results which are available it seems that these methods are faster than any of the existing methods (Chara1ambous and Band1er 1973b). Chapter 7 presents a new approach to nonlinear programming (Band1er and Chara1ambous 1972at 1973b). The original nonlinear programming problem is formulated as an unconstrained minimax problem. Under reasonable restri~tions it is shown that a point satisfying the Kuhn-Tucker necessary conditions for optimality (1950) of the original nonlinear programming problem also satisfies the necessary conditions for
13 3 optimality of the minimax problem. Several numerical examples compare the new approach with the well-known SUMT method of Fiacco and McCormick (1964a, 1964b). The adjoint netw~rk approach for evaluating the gradients of the objective function with respect to network parameters was used for network design problems (Director and Rohrer 1969, Bandler and Seviora 1970). Throughout the thesis one function evaluation includes evaluation of all first derivatives. The digital computer used for all the numerical results was a CDC Original contributions are: (i) (ii) Generalized least pth objectives. The conditions for optimal minimax approximation derived from the generalized least pth objectives. (iii) The scaling procedure allowing least pth approximation with extremely large values of p. (iv) (v) Two new algorithms for minimax optimization. A new approach to nonlinear programming.
14 CHAPTER 2 UNCONSTRAINED OPT"tMIZATION 2.1 Fundamental Concepts and Definitions The uncol.atrained optimization problem is to calculate the minimum value of the scalar valued function U where (2.1) and (2.2) U is called the objective nunction and the column vector t contains the k real independent variables. The term "unconstrained" implies that the value of each variable can be any real number. Maximizing a function is the same as minimizing the negative of the function, so only the minimization problem will be considered. A point t is called a global minimum of U(t) if (2.3) for all t. If the strict inequality holds for t ~ to be unique. i the minimum is said..,.., If (2.3) holds only in the neighbourhood of t, then t is called a local minimum of U. 4
15 l I 5 given by The first three terms of the multidime~sionaltaylor series are where (2.4) 6 (2.5) represents the incremental change in the parameters, a a~l v 6.. '" a aljl2 a aljlk (2.6) is the first partial derivative operator with respect to the parameter vector t, and a 2 u aljl2 1 a 2 u aljllaljl2 a 2 u aljllaljlk G 6 "" '" a 2 u aljl2 aljl l a 2 u a 2 u ;2 aljl2 aljl k (2.7) 2.-1
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
, MODELLING AND CONTROL OF SUSTAINED OSCILLATIONS IN THE CONTINUOUS EMULSION POLYMERIZATION OF VINYL ACETATE. by Mark James Pollock
, MODELLING AND CONTROL OF SUSTAINED OSCILLATIONS IN THE CONTINUOUS EMULSION POLYMERIZATION OF VINYL ACETATE by Mark James Pollock A Thesi s Submitted to the Schoo~ of Graduate Studies in Partial Fulfilment
More informationMinimax Design of Complex-Coefficient FIR Filters with Low Group Delay
Minimax Design of Complex-Coefficient FIR Filters with Low Group Delay Wu-Sheng Lu Takao Hinamoto Dept. of Elec. and Comp. Engineering Graduate School of Engineering University of Victoria Hiroshima University
More informationTHE DECO~WOSITION OF AMMONIA ON TUNGSTEN SURFACES
THE DECO~WOSITION OF AMMONIA ON TUNGSTEN SURFACES THE DECOMPOSITION OF AMMONIA ON TUNGSTEN SURFACES by YU.KWANG PENG, DIPL. CHEM. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment
More informationOptimization Tutorial 1. Basic Gradient Descent
E0 270 Machine Learning Jan 16, 2015 Optimization Tutorial 1 Basic Gradient Descent Lecture by Harikrishna Narasimhan Note: This tutorial shall assume background in elementary calculus and linear algebra.
More informationCARBON DIOXIDE ON RANEY NICKEL, AND SIMULATION OF'CHAIN GROWTH IN THE FISCHER-TROPSCH SYNTHESIS
.. '.... ~mthanation OF CARBON MONOX~DE AND CARBON DIOXIDE ON RANEY NICKEL, AND COMPUTE~ SIMULATION OF'CHAIN GROWTH IN THE FISCHER-TROPSCH SYNTHESIS.,. j I l! 1!,i By, (5) CHUNG BOON LEE, B. ENG... \ I
More informationOptimization Concepts and Applications in Engineering
Optimization Concepts and Applications in Engineering Ashok D. Belegundu, Ph.D. Department of Mechanical Engineering The Pennsylvania State University University Park, Pennsylvania Tirupathi R. Chandrupatia,
More informationSTUDIES OF SOMEd-l,3,4-0XADIAZOLINES -OXADIAZOLINONES
STUDIES OF SOMEd-l,3,4-0XADIAZOLINES AND -OXADIAZOLINONES THE SYNTHESIS AND THERMAL DECOMPOSITION OF OXADIAZOLINES AND 5,5-DIPHENYL-2-(ARYLIMINO)-~-l,3,4 5,5-DIALKYL-~-l,3,4- OXADIAZOLIN-2-0NES by AUDREY
More informationSTRUCfURE AND REACfIVITY OF THE. 1,3-DlOXOLAN-2-YLIUM ION SYSTEM. JOHN PAUL BELLAVIA, B. Sc. A Thesis. Submitted to the School of Graduate Studies
STRUCfURE AND REACfIVITY OF THE 1,3-DlOXOLAN-2-YLIUM ION SYSTEM By JOHN PAUL BELLAVIA, B. Sc. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for the Degree
More informationNumerical Optimization of Partial Differential Equations
Numerical Optimization of Partial Differential Equations Part I: basic optimization concepts in R n Bartosz Protas Department of Mathematics & Statistics McMaster University, Hamilton, Ontario, Canada
More informationPart 4: IIR Filters Optimization Approach. Tutorial ISCAS 2007
Part 4: IIR Filters Optimization Approach Tutorial ISCAS 2007 Copyright 2007 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 24, 2007 Frame # 1 Slide # 1 A. Antoniou Part4: IIR Filters
More informationConstrained optimization. Unconstrained optimization. One-dimensional. Multi-dimensional. Newton with equality constraints. Active-set method.
Optimization Unconstrained optimization One-dimensional Multi-dimensional Newton s method Basic Newton Gauss- Newton Quasi- Newton Descent methods Gradient descent Conjugate gradient Constrained optimization
More informationOptimization: Insights and Applications. Jan Brinkhuis Vladimir Tikhomirov PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD
Optimization: Insights and Applications Jan Brinkhuis Vladimir Tikhomirov PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Preface 0.1 Optimization: insights and applications xiii 0.2 Lunch, dinner,
More informationCONSTRAINED NONLINEAR PROGRAMMING
149 CONSTRAINED NONLINEAR PROGRAMMING We now turn to methods for general constrained nonlinear programming. These may be broadly classified into two categories: 1. TRANSFORMATION METHODS: In this approach
More informationGradient Descent. Dr. Xiaowei Huang
Gradient Descent Dr. Xiaowei Huang https://cgi.csc.liv.ac.uk/~xiaowei/ Up to now, Three machine learning algorithms: decision tree learning k-nn linear regression only optimization objectives are discussed,
More informationPSEUDO-DIFFERENTIAL OPERATORS WITH ROUGH COEFFICIENTS
PSEUDO-DIFFERENTIAL OPERATORS WITH ROUGH COEFFICIENTS By LUQIWANG B.Sc., M.Sc. A Thesis Submitted to the School of Graduate Studies in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy
More informationIntroduction to unconstrained optimization - direct search methods
Introduction to unconstrained optimization - direct search methods Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Structure of optimization methods Typically Constraint handling converts the
More informationSPECTRAL PROPERTIES OF m InGaAsP SEMICONDUCTOR DIODE LASERS JOSEPH EDWARD HAYWARD, B.ENG, M.ENG. A Thesis
SPECTRAL PROPERTIES OF 1.3 11m InGaAsP SEMICONDUCTOR DIODE LASERS By JOSEPH EDWARD HAYWARD, B.ENG, M.ENG A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints
ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained
More informationHYBRID RUNGE-KUTTA AND QUASI-NEWTON METHODS FOR UNCONSTRAINED NONLINEAR OPTIMIZATION. Darin Griffin Mohr. An Abstract
HYBRID RUNGE-KUTTA AND QUASI-NEWTON METHODS FOR UNCONSTRAINED NONLINEAR OPTIMIZATION by Darin Griffin Mohr An Abstract Of a thesis submitted in partial fulfillment of the requirements for the Doctor of
More informationWritten Examination
Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes
More informationADAPTIVE FILTER THEORY
ADAPTIVE FILTER THEORY Fourth Edition Simon Haykin Communications Research Laboratory McMaster University Hamilton, Ontario, Canada Front ice Hall PRENTICE HALL Upper Saddle River, New Jersey 07458 Preface
More informationCurvature measures for generalized linear models
University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 1999 Curvature measures for generalized linear models Bernard A.
More informationCONVEX FUNCTIONS AND OPTIMIZATION TECHINIQUES A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF
CONVEX FUNCTIONS AND OPTIMIZATION TECHINIQUES A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN MATHEMATICS SUBMITTED TO NATIONAL INSTITUTE OF TECHNOLOGY,
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More information2.3 Linear Programming
2.3 Linear Programming Linear Programming (LP) is the term used to define a wide range of optimization problems in which the objective function is linear in the unknown variables and the constraints are
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 13 Overview of nonlinear programming. Ann-Brith Strömberg
MVE165/MMG631 Overview of nonlinear programming Ann-Brith Strömberg 2015 05 21 Areas of applications, examples (Ch. 9.1) Structural optimization Design of aircraft, ships, bridges, etc Decide on the material
More informationFATIGUE BEHAVIOUR OF OFFSHORE STEEL JACKET PLATFORMS
FATIGUE BEHAVIOUR OF OFFSHORE STEEL JACKET PLATFORMS by ASHOK GUPTA THESIS SUBMITTED TO THE INDIAN INSTITUTE OF TECHNOLOGY, DELHI FOR THE AWARD OF THE DEGREE OF DOCTOR OF PHILOSOPHY Department of Civil
More information14. Nonlinear equations
L. Vandenberghe ECE133A (Winter 2018) 14. Nonlinear equations Newton method for nonlinear equations damped Newton method for unconstrained minimization Newton method for nonlinear least squares 14-1 Set
More informationSingularities in minimax optimization of networks
Downloaded from orbit.dtu.dk on: Jul 18, 2018 Singularities in minimax optimization of networks Madsen, Kaj; Schjær-Jacobsen, Hans Published in: IEEE Transactions on Circuits and Systems Link to article,
More informationLecture V. Numerical Optimization
Lecture V Numerical Optimization Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Numerical Optimization p. 1 /19 Isomorphism I We describe minimization problems: to maximize
More informationA CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received
More informationOptimization Methods
Optimization Methods Decision making Examples: determining which ingredients and in what quantities to add to a mixture being made so that it will meet specifications on its composition allocating available
More informationQualitative Constraint Satisfaction Problems: Algorithms, Computational Complexity, and Extended Framework
Qualitative Constraint Satisfaction Problems: Algorithms, Computational Complexity, and Extended Framework Weiming Liu Faculty of Engineering and Information Technology University of Technology, Sydney
More informationOn Monoids Related to Braid Groups and Transformation Semigroups. James East
On Monoids Related to Braid Groups and Transformation Semigroups James East School of Mathematics and Statistics University of Sydney September 2005 A thesis submitted in fulfilment of the requirements
More informationTHE CLEANING OF lop SUBSTRATES FOR GROWTH BY MBE. PETER HOFSTRA, B.Sc. A Thesis. Submitted to the School of Graduate Studies
THE CLEANING OF lop SUBSTRATES FOR GROWTH BY MBE By PETER HOFSTRA, B.Sc. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for the Degree Doctor of Philosophy
More informationLecture 13: Constrained optimization
2010-12-03 Basic ideas A nonlinearly constrained problem must somehow be converted relaxed into a problem which we can solve (a linear/quadratic or unconstrained problem) We solve a sequence of such problems
More informationNumerical optimization
Numerical optimization Lecture 4 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 2 Longest Slowest Shortest Minimal Maximal
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationOptimization: Nonlinear Optimization without Constraints. Nonlinear Optimization without Constraints 1 / 23
Optimization: Nonlinear Optimization without Constraints Nonlinear Optimization without Constraints 1 / 23 Nonlinear optimization without constraints Unconstrained minimization min x f(x) where f(x) is
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More informationCannibalism in Barramundi Lates calcarifer: Understanding Functional Mechanisms and Implication to Aquaculture
Cannibalism in Barramundi Lates calcarifer: Understanding Functional Mechanisms and Implication to Aquaculture Flavio Furtado Ribeiro, BSc. MSc. A thesis submitted for the degree of Doctor of Philosophy,
More informationEFFECT OF SOIL TYPE ON SEISMIC PERFROMANCE OF REINFORCED CONCRETE SCHOOL BUILDING
EFFECT OF SOIL TYPE ON SEISMIC PERFROMANCE OF REINFORCED CONCRETE SCHOOL BUILDING NUR AMIRAH BINTI MOHD NASAI B. ENG (HONS.) CIVIL ENGINEERING UNIVERSITI MALAYSIA PAHANG SUPERVISOR S DECLARATION I hereby
More informationNumerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems
1 Numerical optimization Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book Numerical optimization 048921 Advanced topics in vision Processing and Analysis of
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationWSEAS TRANSACTIONS on MATHEMATICS
l p -Norm Minimization Method for Solving Nonlinear Systems of Equations ANDRÉ A. KELLER Laboratoire d Informatique Fondamentale de Lille/ Section SMAC UMR 8022 CNRS) Université de Lille 1 Sciences et
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationOptimization. Next: Curve Fitting Up: Numerical Analysis for Chemical Previous: Linear Algebraic and Equations. Subsections
Next: Curve Fitting Up: Numerical Analysis for Chemical Previous: Linear Algebraic and Equations Subsections One-dimensional Unconstrained Optimization Golden-Section Search Quadratic Interpolation Newton's
More informationThe Steepest Descent Algorithm for Unconstrained Optimization
The Steepest Descent Algorithm for Unconstrained Optimization Robert M. Freund February, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 1 Steepest Descent Algorithm The problem
More informationNonlinear Programming and the Kuhn-Tucker Conditions
Nonlinear Programming and the Kuhn-Tucker Conditions The Kuhn-Tucker (KT) conditions are first-order conditions for constrained optimization problems, a generalization of the first-order conditions we
More informationRobotic Manipulation by Pushing at a Single Point with Constant Velocity: Modeling and Techniques
UNIVERSITY OF TECHNOLOGY, SYDNEY Robotic Manipulation by Pushing at a Single Point with Constant Velocity: Modeling and Techniques by Michael James Behrens A thesis submitted in partial fulfillment for
More informationScientific Computing: Optimization
Scientific Computing: Optimization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 March 8th, 2011 A. Donev (Courant Institute) Lecture
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationDETECTION OF SIGNALS IN CHAOS. XIAO BO LI, B. Eng., M. Eng.
...or.- DETECTION OF SIGNALS IN CHAOS By XIAO BO LI, B. Eng., M. Eng. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for the Degree Ph.D. of Engineering
More informationNumerical Optimization Professor Horst Cerjak, Horst Bischof, Thomas Pock Mat Vis-Gra SS09
Numerical Optimization 1 Working Horse in Computer Vision Variational Methods Shape Analysis Machine Learning Markov Random Fields Geometry Common denominator: optimization problems 2 Overview of Methods
More informationOptimal control problems with PDE constraints
Optimal control problems with PDE constraints Maya Neytcheva CIM, October 2017 General framework Unconstrained optimization problems min f (q) q x R n (real vector) and f : R n R is a smooth function.
More information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 1-3 line supporting sentence
More informationDesign of Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization
Design of Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization by David Guindon B.Eng., University of Victoria, 2001 A Thesis Submitted in Partial Fulfillment of the Requirements for
More informationConstrained optimization: direct methods (cont.)
Constrained optimization: direct methods (cont.) Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Direct methods Also known as methods of feasible directions Idea in a point x h, generate a
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 12: Nonlinear optimization, continued Prof. John Gunnar Carlsson October 20, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I October 20,
More informationABASTRACT. Determination of nitrate content and ascorbic acid in intact pineapple by Vis-NIR spectroscopy Student. Thesis
Thesis Determination of nitrate content and ascorbic acid in intact pineapple by Vis-NIR spectroscopy Student Mrs. Sasathorn Srivichien Student ID 52680101 Degree Doctor of Philosophy Program Food Science
More informationA Thesis. Submitted to the School of Graduate Studies. in Partial Fulfilment of the Requirements. for the Degree of _. Doctor of PhilosQphy
MOIJEL RFllUCTION KETllOIJS APPLIED TO POWER S fsieks by IBRAHIM A. EL-NAHAS A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for the Degree of _ Doctor of
More informationUnconstrained optimization
Chapter 4 Unconstrained optimization An unconstrained optimization problem takes the form min x Rnf(x) (4.1) for a target functional (also called objective function) f : R n R. In this chapter and throughout
More informationPrimal-Dual Interior-Point Methods for Linear Programming based on Newton s Method
Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach
More informationMULTI VARIABLE OPTIMIZATION
MULI VARIABLE OPIMIZAION Min f(x 1, x 2, x 3,----- x n ) UNIDIRECIONAL SEARCH - CONSIDER A DIRECION S r r x( α ) = x +α s - REDUCE O Min f (α) - SOLVE AS A SINGLE VARIABLE PROBLEM Min Point s r Uni directional
More informationCITY UNIVERSITY OF HONG KONG
CITY UNIVERSITY OF HONG KONG Topics in Optimization: Solving Second-Order Conic Systems with Finite Precision; Calculus of Generalized Subdifferentials for Nonsmooth Functions Submitted to Department of
More informationConstrained optimization
Constrained optimization In general, the formulation of constrained optimization is as follows minj(w), subject to H i (w) = 0, i = 1,..., k. where J is the cost function and H i are the constraints. Lagrange
More informationAPPLICATION OF THE THEORY OF ATOMS IN MOLECULES
APPLICATION OF THE THEORY OF ATOMS IN MOLECULES By Clement D.H. Lau, B.Sc. A Thesis Submitted to the School of Graduate Studies in Partial Fulfilment of the Requirements for the Degree Doctor of Philosophy
More informationExamining the accuracy of the normal approximation to the poisson random variable
Eastern Michigan University DigitalCommons@EMU Master's Theses and Doctoral Dissertations Master's Theses, and Doctoral Dissertations, and Graduate Capstone Projects 2009 Examining the accuracy of the
More informationLine Search Methods for Unconstrained Optimisation
Line Search Methods for Unconstrained Optimisation Lecture 8, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Generic
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 15: Nonlinear optimization Prof. John Gunnar Carlsson November 1, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I November 1, 2010 1 / 24
More informationConvergence of a Two-parameter Family of Conjugate Gradient Methods with a Fixed Formula of Stepsize
Bol. Soc. Paran. Mat. (3s.) v. 00 0 (0000):????. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v38i6.35641 Convergence of a Two-parameter Family of Conjugate
More informationNonlinearOptimization
1/35 NonlinearOptimization Pavel Kordík Department of Computer Systems Faculty of Information Technology Czech Technical University in Prague Jiří Kašpar, Pavel Tvrdík, 2011 Unconstrained nonlinear optimization,
More informationHIGH SPEED INTERDIGITAL MSM PHOTODIODES. RICHARD JOHN SEYMOUR, B.Sc., M.Eng. A Thesis. Submitted to the School of Graduate Studies
HIGH SPEED INTERDIGITAL MSM PHOTODIODES '.S) By RICHARD JOHN SEYMOUR, B.Sc., M.Eng. A Thesis Submitted to the School of Graduate Studies in Partial Fulfillment of the Requirements for the degree Doctor
More informationNewey, Philip Simon (2009) Colony mate recognition in the weaver ant Oecophylla smaragdina. PhD thesis, James Cook University.
This file is part of the following reference: Newey, Philip Simon (2009) Colony mate recognition in the weaver ant Oecophylla smaragdina. PhD thesis, James Cook University. Access to this file is available
More informationADAPTIVE FILTER THEORY
ADAPTIVE FILTER THEORY Fifth Edition Simon Haykin Communications Research Laboratory McMaster University Hamilton, Ontario, Canada International Edition contributions by Telagarapu Prabhakar Department
More informationNumerical Optimization Prof. Shirish K. Shevade Department of Computer Science and Automation Indian Institute of Science, Bangalore
Numerical Optimization Prof. Shirish K. Shevade Department of Computer Science and Automation Indian Institute of Science, Bangalore Lecture - 13 Steepest Descent Method Hello, welcome back to this series
More informationDESIGN AND MODELLING OF MICRO WA VE CIRCUITS USING OPTIMIZATION METHODS S. Daijavad SOS-86-3-T June 1986
DESIGN AND MODELLING OF MICRO WA VE CIRCUITS USING OPTIMIZATION METHODS S. Daijavad SOS-86-3-T June 1986 0 S. Daijavad 1986 No part of this document may be copied, translated, transcribed or entered in
More informationA Vector Space Approach to Models and Optimization
A Vector Space Approach to Models and Optimization C. Nelson Dorny Moore School of Electrical Engineering University of Pennsylvania From a book originally published in 1975 by JOHN WILEY & SONS, INC.
More informationHIGH ACCURACY NUMERICAL METHODS FOR THE SOLUTION OF NON-LINEAR BOUNDARY VALUE PROBLEMS
ABSTRACT Of The Thesis Entitled HIGH ACCURACY NUMERICAL METHODS FOR THE SOLUTION OF NON-LINEAR BOUNDARY VALUE PROBLEMS Submitted To The University of Delhi In Partial Fulfillment For The Award of The Degree
More informationAlgorithms for Constrained Optimization
1 / 42 Algorithms for Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University April 19, 2015 2 / 42 Outline 1. Convergence 2. Sequential quadratic
More informationA Project Report Submitted by. Devendar Mittal 410MA5096. A thesis presented for the degree of Master of Science
PARTICULARS OF NON-LINEAR OPTIMIZATION A Project Report Submitted by Devendar Mittal 410MA5096 A thesis presented for the degree of Master of Science Department of Mathematics National Institute of Technology,
More informationLocal Hardy Spaces and Quadratic Estimates for Dirac Type Operators on Riemannian Manifolds
Local Hardy Spaces and Quadratic Estimates for Dirac Type Operators on Riemannian Manifolds Andrew J. Morris June 2010 A thesis submitted for the degree of Doctor of Philosophy. of The Australian National
More informationFeasible Adjoint Sensitivity Technique for EM Design Optimization
IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, VOL. 50, NO. 12, DECEMBER 2002 2751 Feasible Adjoint Sensitivity Technique for EM Design Optimization Natalia K. Georgieva, Member, IEEE, Snezana Glavic,
More informationMODAL EXPANSION THEORIES FOR SINGLY - PERIODIC DIFFRACTION GRATINGS
MODAL EXPANSION THEORIES FOR SINGLY - PERIODIC DIFFRACTION GRATINGS by.r. Andrewartha, B.Sc.(Hons.), University of Tasmania A thesis submitted in fulfilment of the requirements for the degree of Doctor
More informationLecture 7 Unconstrained nonlinear programming
Lecture 7 Unconstrained nonlinear programming Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University,
More informationLecture 3. Optimization Problems and Iterative Algorithms
Lecture 3 Optimization Problems and Iterative Algorithms January 13, 2016 This material was jointly developed with Angelia Nedić at UIUC for IE 598ns Outline Special Functions: Linear, Quadratic, Convex
More informationLegendre-Fenchel transforms in a nutshell
1 2 3 Legendre-Fenchel transforms in a nutshell Hugo Touchette School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, UK Started: July 11, 2005; last compiled: August 14, 2007
More informationConstrained Optimization
1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange
More information"OPTIMUM SYSTEM MODELLING USING 'RECENT GRADIENT METHODS
"OPTIMUM SYSTEM MODELLING USING 'RECENT GRADIENT METHODS OPTIMUM SYSTEM MODELLING USING RECENT GRADIENT METHODS by NICHOLAS D. MARKETTOS, B.Sc. A Thesis Submitted to the Faculty of Graduate Studies in
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationSTOCHASTIC MODELS OF CONTROL AND ECONOMIC DYNAMICS
STOCHASTIC MODELS OF CONTROL AND ECONOMIC DYNAMICS V. I. ARKIN I. V. EVSTIGNEEV Central Economic Mathematics Institute Academy of Sciences of the USSR Moscow, Vavilova, USSR Translated and Edited by E.
More informationButje Alfonsius Louk Fanggi
AXIAL COMPRESSIVE BEHAVIOR OF FRP-CONCRETE-STEEL DOUBLE-SKIN TUBULAR COLUMNS Butje Alfonsius Louk Fanggi BEng and MEng (Structural Engineering) Thesis submitted to The University of Adelaide School of
More informationAN EIGENVALUE STUDY ON THE SUFFICIENT DESCENT PROPERTY OF A MODIFIED POLAK-RIBIÈRE-POLYAK CONJUGATE GRADIENT METHOD S.
Bull. Iranian Math. Soc. Vol. 40 (2014), No. 1, pp. 235 242 Online ISSN: 1735-8515 AN EIGENVALUE STUDY ON THE SUFFICIENT DESCENT PROPERTY OF A MODIFIED POLAK-RIBIÈRE-POLYAK CONJUGATE GRADIENT METHOD S.
More informationOn the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method
Optimization Methods and Software Vol. 00, No. 00, Month 200x, 1 11 On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method ROMAN A. POLYAK Department of SEOR and Mathematical
More informationNonlinear Optimization
Nonlinear Optimization (Com S 477/577 Notes) Yan-Bin Jia Nov 7, 2017 1 Introduction Given a single function f that depends on one or more independent variable, we want to find the values of those variables
More informationThe boundedness of the Riesz transform on a metric cone
The boundedness of the Riesz transform on a metric cone Peijie Lin September 2012 A thesis submitted for the degree of Doctor of Philosophy of the Australian National University Declaration The work in
More information8 Barrier Methods for Constrained Optimization
IOE 519: NL, Winter 2012 c Marina A. Epelman 55 8 Barrier Methods for Constrained Optimization In this subsection, we will restrict our attention to instances of constrained problem () that have inequality
More informationGLOBAL CONVERGENCE OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
GLOBAL CONVERGENCE OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH Jie Sun 1 Department of Decision Sciences National University of Singapore, Republic of Singapore Jiapu Zhang 2 Department of Mathematics
More information