The method of moments in dynamic optimization

Slides:

Advertisements

Similar presentations

Duality for linear programming. Illustration of the notion Consider an enterprise producing r items: f k = demand for the item k =1,…, r using s components:

Advertisements

5.1 Real Vector Spaces.

Globally Optimal Estimates for Geometric Reconstruction Problems Tom Gilat, Adi Lakritz Advanced Topics in Computer Vision Seminar Faculty of Mathematics.

Dragan Jovicic Harvinder Singh

Equilibrium Concepts in Two Player Games Kevin Byrnes Department of Applied Mathematics & Statistics.

Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.

by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright

Non convex variational problems under restrictions on the derivative R. Meziat, C. Rivera, D. Patiño Departamento de Matemáticas Universidad de los Andes.

CHAPTER ONE Matrices and System Equations

The Most Important Concept in Optimization (minimization)  A point is said to be an optimal solution of a unconstrained minimization if there exists no.

Support Vector Machines

Totally Unimodular Matrices Lecture 11: Feb 23 Simplex Algorithm Elliposid Algorithm.

1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.

Introduction to Linear and Integer Programming Lecture 7: Feb 1.

Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.

Support Vector Machines and Kernel Methods

CS Pattern Recognition Review of Prerequisites in Math and Statistics Prepared by Li Yang Based on Appendix chapters of Pattern Recognition, 4.

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.

Optimality Conditions for Nonlinear Optimization Ashish Goel Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.

Analysis of Microstructures and Phase Transition Phenomena contribution to Dynamic Days, Berlin, July 25-28, 2005 René J. Meziat, Jorge Villalobos Department.

KKT Practice and Second Order Conditions from Nash and Sofer

: Appendix A: Mathematical Foundations 1 Montri Karnjanadecha ac.th/~montri Principles of.

CHAPTER SIX Eigenvalues

CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.

AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.

CS774. Markov Random Field : Theory and Application Lecture 08 Kyomin Jung KAIST Sep

Duality Theory 對偶理論.

C&O 355 Mathematical Programming Fall 2010 Lecture 4 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.

A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:

Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,

1 1.5 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra SOLUTION SETS OF LINEAR SYSTEMS.

The Simplex Method. Standard Linear Programming Problem Standard Maximization Problem 1. All variables are nonnegative. 2. All the constraints (the conditions)

TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A Image:

Comparative Statics and Duality of the Cost Function Lecture VII.

Elementary Linear Algebra Anton & Rorres, 9th Edition

Nonlinear Programming Models

Linear Programming (Convex) Cones  Def: closed under nonnegative linear combinations, i.e. K is a cone provided a 1, …, a p  K  R n, 1, …, p.

Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.

Elluminate * The purpose of this paper is to provide a complete characterization of the normalized restricted profit function via the conjugate.

I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.

Survey of Kernel Methods by Jinsan Yang. (c) 2003 SNU Biointelligence Lab. Introduction Support Vector Machines Formulation of SVM Optimization Theorem.

Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University.

C&O 355 Mathematical Programming Fall 2010 Lecture 5 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.

CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.

Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.

Proving that a Valid Inequality is Facet-defining  Ref: W, p  X  Z + n. For simplicity, assume conv(X) bounded and full-dimensional. Consider.

Linear Programming Back to Cone  Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they.

(COEN507) LECTURE III SLIDES By M. Abdullahi

Linear Programming Chapter 9. Interior Point Methods  Three major variants  Affine scaling algorithm - easy concept, good performance  Potential.

Optimal parameters of satellite–stabilizer system in circular and elliptic orbits 2nd International Workshop Spaceflight Dynamics and Control October 9-11,

Support Vector Machine: An Introduction. (C) by Yu Hen Hu 2 Linear Hyper-plane Classifier For x in the side of o : w T x + b  0; d = +1; For.

Linear Programming Piyush Kumar Welcome to CIS5930.

Approximation Algorithms based on linear programming.

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.

Part 3 Linear Programming 3.3 Theoretical Analysis.

Mathematical Programming

Proving that a Valid Inequality is Facet-defining

Chap 9. General LP problems: Duality and Infeasibility

Nuclear Norm Heuristic for Rank Minimization

Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.

Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.

Structural Optimization Design ( Structural Analysis & Optimization )

I.4 Polyhedral Theory (NW)

A particular discrete dynamical program used as a model for one specific situation in chess involving knights and rooks 22nd EUROPEAN CONFERENCE ON OPERATIONS.

Linear Algebra Lecture 23.

Back to Cone Motivation: From the proof of Affine Minkowski, we can see that if we know generators of a polyhedral cone, they can be used to describe.

I.4 Polyhedral Theory.

Proving that a Valid Inequality is Facet-defining

(Convex) Cones Def: closed under nonnegative linear combinations, i.e.

Presentation transcript:

The method of moments in dynamic optimization Mathematics Seminar. Institute of Mathematics. Charles University. Prague, May 2005 R. Meziat Departamento de Matemáticas Universidad de los Andes Colombia, 2005

Index Conic programming. Convex envelopes Microstructures Optimal control The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Matrix of m rows and n columns: P and V are closed convex cones in Rn Polar cone: System of homogenous inequalities: Basic results: Positive cone generated by the rows of the matrix A The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Farkas Lemma: Theorem of the alternative I: Ax=b has a solution in x 0 of Rn or excluding: has solution in The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Theorem of the alternative II: Ax b has a solution in x 0 of Rn or excluding: Theorem of the alternative III: Ax b has a solution in x  Rn or excluding: has solution in: has solution in: The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Corollary: Consequences of the Farkas Lemma: Kuhn-Tucker conditions in programs under restrictions in form of inequality. Duality in convex programming. The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Duality gap: Given a couple of feasible solutions (x,y) Primal program (P) The system of lineal inequalities: Dual program (D) Has a solution (y,x,t)  Rm x Rn x R1 that satisfies: The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming One of the following affirmations is always truth: There is a couple of optimal solutions for the primal (P) and dual (D) that satisfies: One of the problems is not limited and it is not feasible. One couple of feasible solutions is a couple of optimal solution if the complementariness relations are fulfilled: The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Equivalence between convex cones and relations of order in linear spaces with inner product. Relation of compatible linear order with the topology and the operations of the underlying linear space Order properties: Reflexivity Antisymetric Transitive Homogenous Additive Continuity The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Relationship between cones and orders: Given a closed cone pointed V and a lineal space E, the relation a  b defined as a-b  V fulfills all the properties. Example of cones: Positives octants in Euclidean Spaces: Lorentz cones: Positive semidefinite matrix cones. E: Space of n x n symmetric matrix with the interior product of Frobenius. V=S+n: Cone of positive semidefinite symmetrical matrix The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Primal program (P) (P) and (D) are dual conic programs. The duality gap is always positive: c x - b y  0 for every couple of feasible solutions (x, y) When one of the problems (P) or (D) is limited and feasible, then the other one has a solutions and the optimal solution is the same A couple of feasible solution (x, y) is composed by optimal solutions: Dual program (D) The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Examples of conic programs: Steiner Min-Max problem: Weighted Steiner problem: General form of the duality in the conic programming: Vi if the family of convex cones. Primal (P) Dual (D) The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Global optimization in bidimensional polynomials: be positive semidefinite Semidefinite relaxation: A necessary condition is that the values: be moments is that the matrix: The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Primal program (P) We suppose that the non negative polynomial: Dual program (D) can be expressed as: The method of moments in dynamic optimization, R. Meziat, 2005.

Conic programming Solution: We take the coefficient of the expression: The feasible solution for (D) give us a inferior cote for (P) and we have that the inferior cote is m* for the relaxation of the global problem: As the feasible solution for the problem (D) which value of the feasible function of (D) is the same with m* The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes We find the convex envelope of one-dimensional coercive polynomials given in the general form: Primal problem: The convex envelope in the point t is: Dual problem: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes We use the truncated Hamburger moment problem and we transform the problem in a semidefinite problem: The optimal measure has two forms: We characterize the moments using the Hankel matrix. The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes Example 1: For t=0 For t=0.5 For t=1 The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes Example 2: For t= 0 For t= 2 The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes Example 3: For t= -0.5 The method of moments in dynamic optimization, R. Meziat, 2005.

Microstructures General problem: u is the displacement of each point respect to the starting point. u’ is the unitary deformation f internal energy of deformation. y potential of external forces. This method is used to determine the microstructure in unidimensional elastic bars, which deformation potential is non-convex: Schematic curve of a typical potential of deformation for a steel The method of moments in dynamic optimization, R. Meziat, 2005.

Microstructures We make an analysis of general models where the non-convex dependence of  in u’ can be written with a polynomial expression: The method of moments in dynamic optimization, R. Meziat, 2005.

Microstructures The original problem has a minimizer only if it is a Direc Delta If the original problem does not have a minimizer, there is a region I where the parametrized measure is supported by two points. This solution determines the oscillation of the solutions of the problem. The method of moments in dynamic optimization, R. Meziat, 2005.

Microstructures The method of moments in dynamic optimization, R. Meziat, 2005.

Microstructures The new problem is an convex optimization problem in the variable m, thus the existence of the minimizer is guaranteed The non-lineal problem is in the restriction imposed by the moment characterization. The way that the problem has taken an ideal form in order to solve it with software for non-linear programming. The solution of the relaxed problem tell us wheater the original problem has solution or not. The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D Caratheodory theorem: Every point in a convex envelope of a coercive function f can be expressed as a convex combination that has r+1 points when the function is defined in The convex envelope can be defined as: And we define the probability distribution supported in t1, …,tn with weights 1,…, n, Bidimensional polynomial: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D For a fourth order polynomial: Where: We compute the convex envelope in (a,b) solving the SPD program with m10=a , m01 =b and m00=1 M: Restriction matrix that characterize the moments The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D We change the problem by a semidefinite program. The solution of the semidefinite program has the moments of the optimal measure. Convex envelope calculus in (a,b) We take marginal moments CASE I CASE II CASE III NO YES The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D Weights: CASE I: Support: tx=a, ty=b Weight: =1 CASE II: Support: tx=roots(P(tX)), ty=roots(P(ty)) The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D CASE III: Support: tx=roots(P(tX)), ty=roots(P(ty)) Weights: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D Example 1: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D Example 1: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D We construct the measure for the polynomial f(x,y) in the point (0.5,0) Marginal measures: Jointed measure: The method of moments in dynamic optimization, R. Meziat, 2005.

Convex envelopes 2D We construct the measure for the polynomial f(x,y) in the point (0,0.1) Marginal measures: Jointed measure: The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control BOLZA FORM MAYER FORM Non linear, optimal control problems with Bolza form or Mayer form: BOLZA FORM MAYER FORM The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Linearity problems: Convexity problems: 1. NON LINEAR: Integration. Stability Chaos Convexity problems: 2. NON CONVEX : The Classical Theory of Optimal Control does not apply for proving the existence of the solution Search Routines of Numerical Optimization fail to attain the global optimum. The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control We introduce the linear and convex relaxation with moments. The Hamiltonian H has a polynomial form: The global optimization of a polynomial: m: New variable of control We use the probability moments The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Theorem: Assume that the Hamiltonian is a coercive polynomial with a single global minimum u*, then the optimization problem has an unique solution given by the Dirac measure u* Theorem: Let H(u) be an even degree algebraic polynomial whose leader coefficient k is positive, we can express its convex hull as: The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control When H(u) is a coercive polynomial with a single global minimum u*, the solution is the vector of moments m. Hankel Positive semi definite The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Discretization of the problem. The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Example 1: t vs X Control signal The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Example 2: Control signal t vs X The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Example 3: t vs X t vs Y Control signal The method of moments in dynamic optimization, R. Meziat, 2005.

Optimal control Example 4: THERE IS NO MINIMIZERS The method of moments in dynamic optimization, R. Meziat, 2005.