Part 4 Nonlinear Programming

Slides:



Advertisements
Similar presentations
Branch-and-Bound Technique for Solving Integer Programs
Advertisements

Chapter 5 The Simplex Method The most popular method for solving Linear Programming Problems We shall present it as an Algorithm.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 One-Dimensional Unconstrained Optimization Chapter.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Thursday, April 25 Nonlinear Programming Theory Separable programming Handouts: Lecture Notes.
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
ENGINEERING OPTIMIZATION
So far all our functions were linear. In many situations, it might not be the case. Example: Production cost. – c 1 = $11/unit for first 5 items – c 2.
Chapter 1 Introduction The solutions of engineering problems can be obtained using analytical methods or numerical methods. Analytical differentiation.
1 Chapter 8: Linearization Methods for Constrained Problems Book Review Presented by Kartik Pandit July 23, 2010 ENGINEERING OPTIMIZATION Methods and Applications.
Chapter 10: Iterative Improvement
MAE 552 – Heuristic Optimization Lecture 26 April 1, 2002 Topic:Branch and Bound.
Optimization Methods One-Dimensional Unconstrained Optimization
Ch. 9: Direction Generation Method Based on Linearization Generalized Reduced Gradient Method Mohammad Farhan Habib NetLab, CS, UC Davis July 30, 2010.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
1 OR II GSLM Outline  separable programming  quadratic programming.
Chapter 3 Introduction to Optimization Modeling

Operations Research Models
1.3 Solving Equations Using a Graphing Utility; Solving Linear and Quadratic Equations.
1 Chapter 8 Nonlinear Programming with Constraints.
Nonlinear Programming.  A nonlinear program (NLP) is similar to a linear program in that it is composed of an objective function, general constraints,
Part 4 Nonlinear Programming 4.3 Successive Linear Programming.
Full symmetric duality in continuous linear programming Evgeny ShindinGideon Weiss.
Numerical Methods for Engineering MECN 3500
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
Optimization of functions of one variable (Section 2)
Nonlinear Programming In this handout Gradient Search for Multivariable Unconstrained Optimization KKT Conditions for Optimality of Constrained Optimization.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
5.3 Mixed Integer Nonlinear Programming Models. A Typical MINLP Model.
OR Integer Programming ( 정수계획법 ). OR
D Nagesh Kumar, IIScOptimization Methods: M8L1 1 Advanced Topics in Optimization Piecewise Linear Approximation of a Nonlinear Function.
Notes Over 3.1 Solving a System Graphically Graph the linear system and estimate the solution. Then check the solution algebraically.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
Part 4 Nonlinear Programming 4.3 Successive Linear Programming.
Solving Linear Program by Simplex Method The Concept
Water Resources Development and Management Optimization (Nonlinear Programming & Time Series Simulation) CVEN 5393 Apr 11, 2011.
Computation of the solutions of nonlinear polynomial systems
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.
Copyright © Cengage Learning. All rights reserved.
Advanced Engineering Mathematics 6th Edition, Concise Edition
Systems of Nonlinear Equations
Solver & Optimization Problems
One-layer neural networks Approximation problems
5.3 Mixed-Integer Nonlinear Programming (MINLP) Models
Chapter 5 The Simplex Method
Full symmetric duality in continuous linear programming
Statistical Learning Dong Liu Dept. EEIS, USTC.
Gomory Cuts Updated 25 March 2009.
Chapter 4 Linear Programming: The Simplex Method
5.3 Mixed Integer Nonlinear Programming Models
Chapter 6. Large Scale Optimization
Computers in Civil Engineering 53:081 Spring 2003
Chapter 10. Numerical Solutions of Nonlinear Systems of Equations
Chapter 6. Large Scale Optimization
Copyright © Cengage Learning. All rights reserved.
Chapter 8. General LP Problems
Chapter 8. General LP Problems
Numerical Integration
Objectives Approximate a definite integral using the Trapezoidal Rule.
Part 4 Nonlinear Programming
Multivariable Linear Systems
L23 Numerical Methods part 3
Chapter 10: Iterative Improvement
Chapter 8. General LP Problems
Linear Algebra Lecture 16.
Chapter 6. Large Scale Optimization
Discrete Optimization
Presentation transcript:

Part 4 Nonlinear Programming 4.3 Successive Linear Programming

Basic Concept

Approach 1: Direct Use of Linear Programs The simplest and most direct use of the linearization construction is to replace the general nonlinear problem with a complete linearization of all problem functions at some selected estimate solution. The linearized problem takes the form of a linear program and can be solved as such.

Case 1.1 The linearly constrained case

Case 1.1 The approximate problem

Bounded Line Search

Frank-Wolfe Algorithm

Remark

Case 1.2 The general LP case

Direct Linear Approximation

Remark In order attain convergence to the true optimum, it is sufficient that at each iteration an improvement be made in both the objective function and constraint infeasibility. This type of monotonic behavior will occur if the problem functions are mildly nonlinear.

Approach 2 Separable Programming The motivation for this technique stems from the observation that a good way of improving the linear approximation over a large interval is to partition the interval into subintervals and construct individual linear approximation over each subinterval, i.e., piecewise linear approximation.

Case 2.1 Single-Variable Functions

Line Segment in Interval k

Line Segment in Interval k

General Formula

Case 2.2 Multivariable Separable Functions

General Formula

General Formula

Restricted Basis Entry Prior to entering one lambda into the basis (which will make it nonzero), a check should be made to ensure that no more than one other lambda associated with the same x_i is in the basis. If there is one such lambda in the basis, it has to be adjacent.

Example

k 1 2 -2 3 16 -8 4 81 -18

Homework