Numerical Experiments with the Lagrange Multiplier and Conjugate Gradient Methods (ILMCGM)

Similar documents
7.0 Equality Contraints: Lagrange Multipliers

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming

A Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming

A Conventional Approach for the Solution of the Fifth Order Boundary Value Problems Using Sixth Degree Spline Functions

Parallelized methods for solving polynomial equations

KURODA S METHOD FOR CONSTRUCTING CONSISTENT INPUT-OUTPUT DATA SETS. Peter J. Wilcoxen. Impact Research Centre, University of Melbourne.

Algorithms behind the Correlation Setting Window

Some Different Perspectives on Linear Least Squares

An Innovative Algorithmic Approach for Solving Profit Maximization Problems

Minimization of Unconstrained Nonpolynomial Large-Scale Optimization Problems Using Conjugate Gradient Method Via Exact Line Search

D. L. Bricker, 2002 Dept of Mechanical & Industrial Engineering The University of Iowa. CPL/XD 12/10/2003 page 1

Global Optimization for Solving Linear Non-Quadratic Optimal Control Problems

2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission

Capacitated Plant Location Problem:

LINEARLY CONSTRAINED MINIMIZATION BY USING NEWTON S METHOD

( x) min. Nonlinear optimization problem without constraints NPP: then. Global minimum of the function f(x)

A conic cutting surface method for linear-quadraticsemidefinite

The Geometric Least Squares Fitting Of Ellipses

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

Construction of Composite Indices in Presence of Outliers

Neural Networks for Nonlinear Fractional Programming

Performance of a Queuing System with Exceptional Service

15-381: Artificial Intelligence. Regression and neural networks (NN)

Numerical Study for the Fractional Differential Equations Generated by Optimization Problem Using Chebyshev Collocation Method and FDM

Analysis of Lagrange Interpolation Formula

Unique Common Fixed Point of Sequences of Mappings in G-Metric Space M. Akram *, Nosheen

PRACTICAL CONSIDERATIONS IN HUMAN-INDUCED VIBRATION

ASYMPTOTIC STABILITY OF TIME VARYING DELAY-DIFFERENCE SYSTEM VIA MATRIX INEQUALITIES AND APPLICATION

Arithmetic Mean and Geometric Mean

Sebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions

Functions of Random Variables

Non-degenerate Perturbation Theory

Debabrata Dey and Atanu Lahiri

1 0, x? x x. 1 Root finding. 1.1 Introduction. Solve[x^2-1 0,x] {{x -1},{x 1}} Plot[x^2-1,{x,-2,2}] 3

OPTIMALITY CONDITIONS FOR LOCALLY LIPSCHITZ GENERALIZED B-VEX SEMI-INFINITE PROGRAMMING

1 Lyapunov Stability Theory

A COMPARATIVE STUDY OF THE METHODS OF SOLVING NON-LINEAR PROGRAMMING PROBLEM

BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler

PGE 310: Formulation and Solution in Geosystems Engineering. Dr. Balhoff. Interpolation

Symmetry of the Solution of Semidefinite Program by Using Primal-Dual Interior-Point Method

MULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE-I n -SET FUNCTIONS

SUBCLASS OF HARMONIC UNIVALENT FUNCTIONS ASSOCIATED WITH SALAGEAN DERIVATIVE. Sayali S. Joshi

The Modified Bi-quintic B-spline Base Functions: An Application to Diffusion Equation

Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

A Fixed Point Method for Convex Systems

A Remark on the Uniform Convergence of Some Sequences of Functions

The theoretical background of

On the construction of symmetric nonnegative matrix with prescribed Ritz values

THE TRUNCATED RANDIĆ-TYPE INDICES

G S Power Flow Solution

Cubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem

International Journal of Mathematical Archive-3(5), 2012, Available online through ISSN

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

An Introduction to. Support Vector Machine

Duality Theory for Interval Linear Programming Problems

SMOOTH SUPPORT VECTOR REGRESSION BASED ON MODIFICATION SPLINE INTERPOLATION

FEEDBACK STABILIZATION METHODS FOR THE SOLUTION OF NONLINEAR PROGRAMMING PROBLEMS

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

Q-analogue of a Linear Transformation Preserving Log-concavity

ECE 421/599 Electric Energy Systems 7 Optimal Dispatch of Generation. Instructor: Kai Sun Fall 2014

CS 2750 Machine Learning. Lecture 7. Linear regression. CS 2750 Machine Learning. Linear regression. is a linear combination of input components x

-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function

MOLECULAR VIBRATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

International Journal of Mathematical Archive-5(8), 2014, Available online through ISSN

A Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces *

Numerical Analysis Formulae Booklet

Regression and the LMS Algorithm

Chapter 9 Jordan Block Matrices

Lecture 12: Multilayer perceptrons II

Supervised learning: Linear regression Logistic regression

Numerical Simulations of the Complex Modied Korteweg-de Vries Equation. Thiab R. Taha. The University of Georgia. Abstract

Two Fast Alternating Direction Optimization Methods for Multiphase Segmentation

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

Basic Concepts in Numerical Analysis November 6, 2017

A Characterization of Jacobson Radical in Γ-Banach Algebras

Estimation of R= P [Y < X] for Two-parameter Burr Type XII Distribution

Long blade vibration model for turbine-generator shafts torsional vibration analysis

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

Beam Warming Second-Order Upwind Method

Lecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES

X ε ) = 0, or equivalently, lim

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 17

Reliability and Cost Analysis of a Series System Model Using Fuzzy Parametric Geometric Programming

Econometric Methods. Review of Estimation

CSE 5526: Introduction to Neural Networks Linear Regression

A Model Reduction Technique for linear Model Predictive Control for Non-linear Large Scale Distributed Systems

4 Inner Product Spaces

ROOT-LOCUS ANALYSIS. Lecture 11: Root Locus Plot. Consider a general feedback control system with a variable gain K. Y ( s ) ( ) K

Non-uniform Turán-type problems

Uniform asymptotical stability of almost periodic solution of a discrete multispecies Lotka-Volterra competition system

STK4011 and STK9011 Autumn 2016

Maps on Triangular Matrix Algebras

Applied Fitting Theory VII. Building Virtual Particles

On Signed Product Cordial Labeling

Power Flow S + Buses with either or both Generator Load S G1 S G2 S G3 S D3 S D1 S D4 S D5. S Dk. Injection S G1

3D Reconstruction from Image Pairs. Reconstruction from Multiple Views. Computing Scene Point from Two Matching Image Points

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek

On Modified Interval Symmetric Single-Step Procedure ISS2-5D for the Simultaneous Inclusion of Polynomial Zeros

Transcription:

Aerca Joural of Appled Matheatcs 4; (6: -6 Publshed ole Jauary 5, 5 (http://wwwscecepublshroupco//aa do: 648/aa465 ISSN: 33-43 (Prt; ISSN: 33-6X (Ole Nuercal Eperets wth the Larae Multpler ad Couate Gradet Methods (ILMCGM Saso Adebayo Olorusola, etayo Eauel Olaosebka, Kayode Jaes Adebayo Departet of Matheatcal Sceces, Ekt State Uversty, Ado Ekt, Nera Eal address: fuladebayo@yahooco (S A Olorusola, eolaosebka@hotalco ( E Olaosebka, ak77@yahooco (K J Adebayo o cte ths artcle: Saso Adebayo Olorusola, etayo Eauel Olaosebka, Kayode Jaes Adebayo Nuercal Eperets wth the Larae Multpler ad Couate Gradet Methods (ILMCGM Aerca Joural of Appled Matheatcs Vol, No 6, 4, pp -6 do: 648/aa465 Abstract: I ths paper, we bed Larae Multpler Method (LMM Couate Gradet Method (CGM, whch eables Couate Gradet Method (CGM to be eployed for solv costraed optzato probles of ether equalty, equalty costrat or both I the past, Larae Multpler Method has bee used etesvely to solve costraed optzato probles However, wth soe specal features CGM whch akes t uque solv ucostraed optzato probles, we see that ths features we be advataeous to solve costraed optzato probles f we ca add or subtract oe or two ths to the CGM hs, the call for the Nuercal Eperets wth the Larae Multpler Couate Gradet Method (ILMCGM that s aed at tak care of ay costraed optzato probles, ether wth equalty or equalty costrat he authors of ths paper desre that, wth the costructo of the Alorth, oe wll crcuvet the dffcultes uderoe us oly LMM to solve costraed optzato probles ad ts applcato wll further prove the result of the Couate Gradet Method solv ths class of optzato proble We appled the ew alorth to soe costraed optzato probles of two, three ad four varables whch soe of the probles are perta to quadratc fuctos Soe of these fuctos are subect to lear, olear, equalty ad equalty costrats Keywords: Larae Multpler Method, Costraed Optzato Proble, Couate Gradet Method, Nuercal Eperets of the Larae Multpler Couate Gradet Method Itroducto he eeral optzato proble to be cosdered s of the for descrbed by [] ad [] as: Optze: Subect to: R, h ( f ( ( (,,, h = = ( (,,, = (3 where, a equalty vector equatos of deso, ad ( s a equalty vector of deso, such that the su of the costrats = ( + he fuctos f (, h ( ad ( are dfferetable fuctos Methods for solv ths odel have bee developed, tested ad successfully appled to ay portat probles of scetfc ad ecooc terest However, spte of the prolferato of the ethods, there s o uversal ethod for solv all optzato probles whch calls for applcato of ILMCGA to solve costraed optzato probles Couate Gradet Method I 95, Hestees ad Stefel developed a Couate Gradet Method (CGM alorth for solv alebrac equatos whch was successfully appled to olear equatos wth results reported by Fletcher ad Reeves 964 he CGM alorth for teratvely locat the u of f ( H s descrbed as follows: Step : Guess the frst eleet ϵ H ad copute the rea ebers of the sequece wth the ad of the forulae the steps throuh 6 Step : Copute the descet drecto

Saso Adebayo Olorusola et al: Nuercal Eperets wth the Larae Multpler ad Couate Gradet Methods (ILMCGM Step 3: Set Step 4: Copute Step 5: Set p = (4 + = + α p ; where =, H (5, H = + + αgp (6 p + = + + β p ; =, H (7, H Step 6: If = for soe, the, terate the sequece; else set = + ad o to step 3 I the teratve steps throuh 6 above, deotes the descet drecto at h step of the alorth,, s the step leth of the descet sequece ad deotes the radet of at Steps 3, 4 ad 5 of the alorth reveal the crucal role of the lear operator G deter the step leth of the descet sequece ad also eerat a couate drecto of search Doctoral hess of [3] threw lht o the theoretcal applcablty of the CGM, whch was eteded to optal cotrol probles by [4], [5] ad [6]Applcablty of the CGM alorth thus depeds solely o the eplct kowlede of the lear operator, G Geerally, for optzato probles, G s readly detered ad such eoys the beauty of the CGM as a coputatoal schee sce the CGM ehbts quadratc coverece ad requres oly a lttle ore coputato per terato Larae Multplers Method I atheatcal optzato, the ethod of Larae ultplers (aed after Joseph Lous Larae provdes a stratey for fd the au/u of a fucto subect to costrats he Larae ultpler ethod was bascally troduced to solve optzato probles wth equalty costrats of the for ( ad ( I solv ths, a ew varable, λ, called the Larae ultpler troduced to apped the costrat ( to the obectve fucto ( to ve a ew fucto: ( λ ( L X, = f X + λ h ( X (8 = the equvalet atr for of (4 s of the for: ( λ ( L X, = f X + λ h( X (9 (8 ad (9 are referred to as Laraa fuctos where λ s a vector of Larae ultplers I fd the u of the fucto f(, eerally we ca set the partal dervatves of (8 or (9 to zero such as: L ( X, λ =, =,,, ( L ( X, λ =, =,,, λ ( where X, λ ( ad ( are the u soluto ad the set of assocated Larae ultplers of (8 or (9 Also, ( ad ( are referred to as Kuh-ucker ecessary codtos for a local u of (8 or (9 whle the secod dervatves of the fucto f( ve as: L ( X, λ =, =,,, L ( X, λ =, =,,, λ ( (3 are referred to as suffcet codtos for a local u of (8 or (9 3 Larae Multplers Method Alorth I order to aze or ze the fucto ( subect to the costrat (, the follow procedures are take: Step : frst create the Larae Fucto ( λ ( L X, = f X + λ h ( X (4 = Step : Copute the partal dervatves wth respect to ad the Larae ultpler of the fucto (4 Step 3: Set each of the partal dervatves of (4 equal to zero to et: L = X L = λ (5 (6 us (4 proceed to solve for X ter of Now substtute the solutos for X so that (5 s ters of oly he, solve for λ ad use ths value to fd the optal values X Ibedded Larae Multpler Couate Gradet Method (ILMCGM Alorth Have vestated the two ethods; we ow draw out the follow steps whch wll be used to solve soe costraed optzato probles he steps are as follows: Step : Equate the costrat to zero ( case of equato s of the for: AX = b Step : Apped the ew equato step (e AX b = to the perforace de us Larae Multpler to for Laraa or Aueted Laraa fucto

Aerca Joural of Appled Matheatcs 4; (6: -6 3 L, = f + λ( AX b ] [e ( λ ( Step 3: Guess the tal eleets, λ > Step 4: Copute the tal radet,, as well as the tal descet drecto, p = Step 5: Copute the Hessa Matr, H, step Step 6: Set = + α p, whereα = +,,,, p Hp = Step 7: Update the radet us: = + α Hp, = +,,, Step 8: Update the descet drecto us: p p where = + β, β = + + +,,,, = Step 9: If = stop, else, set = + ad retur to step 6 NOE: f ( ad L(, λ are the perforace de ad Laraa fucto respectvely whch are dfferetable 3 Coputatoal Procedure of the ILMCGA Alorth Cosder ( ad (, there ests a Larae Multpler whch bed ( to ( to ve a Laraa fucto such as: ( λ ( L X, = f X + λ h ( X (3 Let the tal uess be: ( ( = ( λ( λ( λ = λ ( = (3 (33 Putt (3 ad (33 ( ad (3 respectvely ves the tal fuctos values e ( ad L(, λ Coput the radet of (3 wth respect to ( #,,, % & we have: L( X, λ = f ( X + λ h ( X = L( X, λ = f ( X + λ h ( X = L( X, λ = f ( X + λ h ( X = (34 Putt (3 ad (33 for ad respectvely (34 ves us the tal radet as: L(, λ L(, λ = L(, λ (35 Multply (35 by eatve ves the decet drecto as: p L(, λ L(, λ = = L(, λ Coput the Hessa Matr of (3 us (34 ves: ( λ ( λ (, λ L, L, L L(, λ L(, λ L(, λ H = L(, λ L(, λ L(, λ (36 (37

4 Saso Adebayo Olorusola et al: Nuercal Eperets wth the Larae Multpler ad Couate Gradet Methods (ILMCGM ad O traspos (35 ad (36 respectvely, we have: = L L L (, λ (, λ (, λ p = L L L (, λ (, λ (, λ Multply (35 ad (38 ves us a scalar, ' e k = (38 (39 L(, λ L(, λ k = L (, λ L (, λ L(, λ L(, λ k = L(, λ + L(, λ + + L (, λ (3 Slarly, ultply (39, (37 ad (36 ves a scalar, z e z = p Hp ( λ ( λ (, λ L, L, L L(, λ L(, λ L(, λ L(, λ L(, λ z = L(, λ L(, λ L(, λ L(, λ L(, λ L(, λ L(, λ Hp ( λ ( λ (, λ L, L, L L(, λ L(, λ L(, λ L(, λ (, L λ = L(, λ L(, λ L(, λ (, L λ ( λ ( λ ( L, L, L, λ L(, λ + L(, λ + + L(, λ L(, λ L(, λ L(, λ L(, λ + L(, λ + + L(, λ = L(, λ L(, λ L(, λ L(, λ + (, (, L λ + + L λ (3 (3 putt (3 to (3, we have:

Aerca Joural of Appled Matheatcs 4; (6: -6 5 ( λ ( λ L, L, L, λ L(, λ + L(, λ + + L(, λ L(, λ L(, λ L(, λ L(, λ + L(, λ + + L(, λ z = L(, λ L(, λ L(, λ L(, λ L(, λ L(, λ L(, λ + (, + + (, L λ L λ ( (33 Wth atr ultplcato, (33 becoes: + - -, - ( 3,4 3 - - -, - ( 3,4 3 - -, 6 + - ( 3,4 3 - ( = - -, - ( 3,4 3 8 - : dvd (3 ad (34 e: -, 6 + - ( 3,4 3 - -, 6 + + - ( 3,4 3-8 -, 6 + + - ( 3,4 3-8 -, 69 8 = -, 69 8 -, 6 + - ( 3,4 3 - : -, 6 + + - ( 3,4 3 - :8-8, 69 ; (34 = 5 > >? ( 3,4 3 6 @5 > >? ( 3,4 3 6 @ @5 > >?8 ( 3,4 3 6 9 + A > >? ( 3,4 3 > B(?3,C3 >? 5A > >? ( 3,4 3 6@ > B(?3,C3 5A > >? >? ( 3,4 3 6@ @ > B(?3,C3 5A > >?8 >?8 ( 3,4 3 69 = A > >? ( 3,4 3 > B(?3,C3 5A > >? >? ( 3,4 3 6@ > B(?3,C3 >? 5A > >? ( 3,4 3 6@ @ > B(?3,C3 5A > >?8 >?8 ( 3,4 3 69 A > >?8 ( 3,4 3 > B(?3,C3 5A > >? : >? ( 3,4 3 6@ > B(?3,C3 5A > >?: >? ( 3,4 3 6@ @ > B(?3,C3 >?:8 5A > >?8 ( 3,4 3 69 ; (35 (35 s the step leth Now set = + α p, = +,,,, 4 Coputatoal Results he follow probles were evaluated us the ILMCGM alorth thus: Proble : Mzef ( = + + + 4 Subect to: + + 3 + 4 = Proble : 3 4 Subect to : ( + ( 3 4 Proble 3: = 4 Mzef ( = 3 + + Subect to: + 3 = Proble 4: 3 3 3 ( Mzef = + + + + 3 ( = + Mze f Subect to: + = able able of result for proble, at λ = No of Iteratos 3 4 Fucto values Gradet Nors 4 6 6758763 973946 599848-68988 -6756358 63964463 56898366 688-5633488 -3495673 476546-759335 333458 3-4376 -89558-97774 -58644-4767995 47774 4-88375 -59945 8343343-47487 -6965376 68837

6 Saso Adebayo Olorusola et al: Nuercal Eperets wth the Larae Multpler ad Couate Gradet Methods (ILMCGM λ able able of result for proble, at =, = the slack varable λ θ = No of teratos Fucto values Gradet Nors -5 88475 6 4-35 56568544 83333333 5 539388888 able3 able of result for proble 3, at λ = No of Iteratos 3 Fucto values Gradet Nors 4 6 34 5339638-685485 9863866 57763764 87485489 98777689-845393 668388 599543 4947735 6787968 3-484648 -49758 4934579-79795779 96644 able 4 able of result for proble 4, at λ = No of teratos Fucto values Gradet Nors 3 47 5-998844 -689753-783 8698568-5858 -499999476-5 476 5 Cocluso Coputatoally, the result alorth fro the Larae Multpler Method bedded Couate Gradet Method was tested o soe costraed optzato probles of two, three ad four varables he probles are pertaed to quadratc fuctos Soe of these fuctos are subect to lear ad olear costrats wth vary Larae paraeter,, betwee ad Whle the slack varable paraeter, θ, s Suppose we take the fucto value as the terat crtero, Proble ad 3 wth the uercal results 5393888888 ad 79795779 whe copare wth the aalytcal results whch are: 5 ad 9375446 respectvely, t varably establshes the relevace of the ew alorth for solv costraed optzato probles Proble ad 4 decreases ootocally establsh the coverece of the costraed Optzato Probles O us the Gradet Nor as the stopp crtero, the Gradet Nor of Probles,, 3 ad 4 teds to zero whch show the coverece of the probles O us the Gradet Nor as the stopp crtero, the Gradet Nor of Probles,, 3 ad 4 teds to zero whch show the coverece of the probles All these pots to the fact that, the costructed ILMCGM alorth effcetly solve the probles as supposed Refereces [] RAO, S S, (978, Optzato heory ad Applcatos, Wlly ad Sos [] HOMAS, FE, ad DAVID, MH, (, Optzato of Checal Processes, McGraw Hll [3] IGOR, G, SEPHEN, G N ad ARIELA, S, (9, Lear ad Nolear Optzato, Geore Maso Uversty, Farfa, Vra, SIAM, Phladelpha [4] Davd, G Hull, (3, Optal Cotrol heory for Applcatos, Mechacal Eeer Seres, Sprer-Verla, New York, Ic, 75 Ffth Aveue, New York, NY [5] Bersekas, D P, (98, Costraed Optzato ad Larae Multplers Method, Acadec Press, Ic [6] Rockafellar, R, (5, Multpler Method of Hestees ad Powell appled to cove Prora, Joural of Optzato heory ad Applcatos, Vol 4, No 4 [7] rphath S S ad Nareda K S, (97, Costraed Optzato Probles Us Multpler Methods, Joural of Optzato heory ad Applcatos: Vol 9, No