Fascinating lighting offers an infinite spectrum of

Info icon This preview shows pages 159–161. Sign up to view the full content.

Fascinating lighting offers an infinite spectrum of possibilities: Innovative technologies and new markets provide both opportunities and challenges. An environment in which your expertise is in high demand. Enjoy the supportive working atmosphere within our global group and benefit from international career paths. Implement sustainable ideas in close cooperation with other specialists and contribute to influencing our future. Come and join us in reinventing light every day. Light is OSRAM
Image of page 159

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Download free eBooks at Fundamental Engineering Optimization Methods 160 ±umerical Optimization Methods The resulting KKT conditions for an optimum are given as: ׏݂ ൅ ׏ ࣦ ο࢞ ൅ ࡺ࢜ ൌ ૙ǡ ࢎ ൅ ࡺο࢞ ൌ ૙ ² In matrix form, these KKT conditions are similar to those used in the Newton-Raphson update. 7.6.5 SQP with Hessian Update The above Newton’s implementation of SQP algorithm uses Hessian of the Lagrangian function for the update. Since Hessian computation is relatively costly, an approximate to the Hessian may instead be used. Towards that end, let ࡴ ൌ ׏ ³ then the modified QP subproblem is defined as (Arora, p. 557): ݂ ҧ ൌ ࢉ ࢊ ൅ ͳ ʹ ࡴࢊ 6XEMHFW WR³ ࢊ ൑ ࢈ǡ ࡺ ࢊ ൌ ࢋ (7.64) We note that quasi-Newton methods (Sec. 7.3.4) solve the unconstrained minimization problem by solving a set of linear equations given as: ൌ െࢉ IRU ³ ZKHUH where represents an approximation to the Hessian matrix. In particular, the popular BFGS method uses the following Hessian update: ௞ାଵ ൌ ࡴ ൅ ࡰ ൅ ࡱ (7.65) where ǡ ࡱ ǡ ࢙ ൌ ߙ ǡ ࢟ ൌ ࢉ ௞ାଵ െ ࢉ ǡ ࢉ ൌ ׏݂൫࢞ ² Next, the BFGS Hessian update is modified to apply to the constrained optimization problems as follows: let ൌ ߙ ǡ ࢠ ൌ ࡴ ǡ ࢟ ൌ ׏ࣦ൫࢞ ௞ାଵ ൯ െ ׏ࣦ൫࢞ ൯ǡ ࢙ ൌ ߦ ǡ ࢙ ൌ ߦ · further, define: ൌ ߠ࢟ ൅ ሺͳ െ ߠሻࢠ ³ where ߠ ൌ ቄͳǡ ଴Ǥ଼క ିక ³ ൌ ߦ Ǣ then, the Hessian update is given as: ௞ାଵ ൌ ࡴ ൅ ࡰ െ ࡱ ǡ ࡰ ǡ ࡱ ² The modified SQP algorithm is given as follows: Modified SQP Algorithm (Arora, p. 558) : Initialize: choose ǡ ܴ ൌ ͳǡ ࡴ ൌ ܫǢ ߝ ǡ ߝ ൐ Ͳ ² For ݇ ൌ Ͳǡͳǡʹǡ ǥ 1. Compute ݂ ǡ ݃ ǡ ݄ ǡ ࢉǡ ܾ ǡ ݁ ǡ DQG ܸ ² ,I ݇ ൐ Ͳǡ compute H k 2. Formulate and solve the modified QP subproblem for search direction d k and the Lagrange multipliers DQG ² 3. If ܸ ൑ ߝ DQG ฮࢊ ฮ ൑ ߝ ³ stop.
Image of page 160
Image of page 161
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern