Computational methods in optimization David F. Gleich Purdue - PowerPoint PPT Presentation

Dec 03, 2023 •600 likes •829 views

Computational methods in optimization David F. Gleich Purdue University Thanks to Nick Henderson for many slides. 1 Course objectives To understand optimization To be able to optimize a function Course outline Background Software Least

Computational methods in optimization David F. Gleich Purdue University Thanks to Nick Henderson for many slides. 1
Course objectives To understand optimization To be able to optimize a function
Course outline
Background Software Least Squares Matrix calculus
Unconstrained Optimization Non-linear equations Newton methods Line search minimize ƒ ( � ) Trust region Quasi-newton
Constrained Optimization Linear programming minimize ƒ ( � ) Quadratic   � programming A � subject to � ≤  ≤ �    Large-scale c ( � )
Modern Topics Convex Integer Stochastic
Questions about topics?
Your first quiz
Source: http://xkcd.com/135/
Raptors move at 25 m/s You move at 6 m/s
But who cares?
The new model choose direction to run v p [ j ] for j = { 1 , . . . , N } N 3 1 to minimize “likelihood” of X X k p [ j ] � r i [ j ] k 2 dt being eaten j =1 i =1 subject to raptor motion p [ j ] � r i [ j ] r i [ j + 1] = r i [ j ] + hv i k p [ j ] � r i [ j ] k human motion p [ j + 1] = p [ j ] + h v p [ j ] Thanks to Nick Henderson for many slides.
How it’s done modeling solver model environment (SNOPT) (AMPL) web service (NEOS) direct (Matlab, C, Fortran) Thanks to Nick Henderson for many slides.
Solve!
time = 2.65 sec
Source: http://en.wikipedia.org/wiki/Velociraptor
What are your applications?

Recommend

Computational Optimization Constrained Optimization Algorithms Feasible Descent Methods

Computational Optimization Constrained Optimization Algorithms Feasible Descent Methods Continued Next Problem Consider Next Hardest Problem min ( ) f x . . s t Ax b How could we adapt gradient projection or other linear

514 views • 13 slides

Computational Optimization Quasi Newton Methods 2/22 NW Chapter 8 Theorem 3.4 Suppose f is

Computational Optimization Quasi Newton Methods 2/22 NW Chapter 8 Theorem 3.4 Suppose f is twice cont diff and the sequence of steepest descent converge to x* satisfying SOSC. 1 Let =

672 views • 32 slides

Optimization-based computational physics and high-order methods: from optimized analysis to

Optimization-based computational physics and high-order methods: from optimized analysis to design and data assimilation Matthew J. Zahr and Per-Olof Persson CRD Postdoc Seminar Series Lawrence Berkeley National Laboratory, Berkeley, CA

1.63k views • 104 slides

Dampening the Curse of Dimensionality Decomposition Methods for Stochastic Optimization Problems

Dampening the Curse of Dimensionality Decomposition Methods for Stochastic Optimization Problems Vadim Gorski Adriana Kiszka Nils Lhndorf Goncalo Terca David W. Conference on Computational Management Science Mathematical Methods in

1.11k views • 69 slides

Computational Optimization Constrained Optimization m R b , m n n Easiest Problem

Computational Optimization Constrained Optimization m R b , m n n Easiest Problem R R Linear equality constraints f A b ( ) = f x Ax min . . s t Null Space Representation Let x* be a feasible point, Ax*=b.

354 views • 33 slides

25. NLP algorithms Overview Local methods Constrained optimization Global methods

CS/ECE/ISyE 524 Introduction to Optimization Spring 201718 25. NLP algorithms Overview Local methods Constrained optimization Global methods Black-box methods Course wrap-up Laurent Lessard (www.laurentlessard.com)

649 views • 35 slides

Combinatorial Optimization Problems 4. Solution Methods 5. Construction Heuristics for the

Outline DM63 HEURISTICS FOR 1. Course Introduction COMBINATORIAL OPTIMIZATION PROBLEMS 2. Combinatorial Problems Lecture 1 3. Computational Complexity Combinatorial Optimization Problems 4. Solution Methods 5. Construction Heuristics for

567 views • 17 slides

Computational Optimization Advance Topics NonSmooth Optimization Reference: Nonlinear

Computational Optimization Advance Topics NonSmooth Optimization Reference: Nonlinear Optimization, Ruszynski,2006 Best Linear Separator: Supporting Plane Method Maximize distance Between two para supporting planes Distance = x

1.24k views • 26 slides

Computational Methods in Systems and Synthetic Biology Fran cois Fages and Aur elien Rizk

From model-checking to constaint solving Continuous valuation of QFLTL formulae Parameter optimization Robustness Conclusion Computational Methods in Systems and Synthetic Biology Fran cois Fages and Aur elien Rizk Constraint

608 views • 43 slides

Computational Optimization Convexity and Unconstrained Optimization 1/29/08 and 2/1(revised)

Computational Optimization Convexity and Unconstrained Optimization 1/29/08 and 2/1(revised) Convex Sets A set S is convex if the line segment joining any two points in the set is also in the set, i.e., for any x,y S, x+(1- )y S

792 views • 53 slides

Computational Sustainability: Computational Methods for a Sustainable Environment, Economy, and

Computational Sustainability: Computational Methods for a Sustainable Environment, Economy, and Society Optimal Forest Fire Fuel Management and Timber Harvest In The Face Of Endogenous Spatial Risk The Next Step Cl i Claire Montgomery M t

332 views • 17 slides

CSCI 1951-G Optimization Methods in Finance Part 11: Stochastic Optimization April 13, 2018

CSCI 1951-G Optimization Methods in Finance Part 11: Stochastic Optimization April 13, 2018 1 / 53 Outline 1) Uncertainty in optimization 2) The troubles of an European farmer 3) Two-stage problems with recourse 4) Benders decomposition

763 views • 53 slides

CSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization March 916,

CSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization March 916, 2018 1 / 19 The portfolio optimization problem How to best allocate our money to n risky assets S 1 , . . . , S n with random returns ? i :

693 views • 19 slides

Lecture 22 Computational Methods for GPs Colin Rundel 04/12/2017 1 GPs and Computational

Lecture 22 Computational Methods for GPs Colin Rundel 04/12/2017 1 GPs and Computational Complexity 2 2 exp n 1 i The problem with GPs x n 2 j 2 ij d ij Update covariance parameter? n 3 log 2 2 n 1 Unless you are lucky (or

772 views • 48 slides

CSCI 1951-G Optimization Methods in Finance Part 09: Interior Point Methods March 23, 2018

CSCI 1951-G Optimization Methods in Finance Part 09: Interior Point Methods March 23, 2018 1 / 35 This material is covered in S. Boyd, L. Vandenberges book Convex Optimization https://web.stanford.edu/~boyd/cvxbook/ . Some of the

498 views • 35 slides

Optimization-Based Control: Direct Collocation Methods for Trajectory and Policy Optimization CS

Optimization-Based Control: Direct Collocation Methods for Trajectory and Policy Optimization CS 287: Advanced Robotics, Fall 2019 Guest Lecture Igor Mordatch Overview Previously: Locally optimal control (shooting vs. collocation)

1.54k views • 138 slides

Computational Optimization Last of unconstrained 2/26 Half-way there Minimize f(x) (objective

Computational Optimization Last of unconstrained 2/26 Half-way there Minimize f(x) (objective function) subject to x S (constraints) Can characterize problem by type of objective functions and constraints NEOS Optimization Guide

600 views • 33 slides

Boosting Methods: Implicit Combinatorial Optimization via First-Order Convex Optimization Robert

Motivation Review of SD and FW(CG) Binary Classification and Boosting Linear Regression and Boosting Boosting Methods: Implicit Combinatorial Optimization via First-Order Convex Optimization Robert M. Freund Paul Grigas Rahul Mazumder

707 views • 49 slides

Optimization for Kernel Methods S. Sathiya Keerthi Yahoo! Research, Burbank, CA, USA Kernel

Optimization for Kernel Methods S. Sathiya Keerthi Yahoo! Research, Burbank, CA, USA Kernel methods: Support Vector Machines (SVMs) Kernel Logistic Regression (KLR) Aim: To introduce a variety of optimization problems that arise in the

738 views • 59 slides

(Log) Barrier methods November 9, 2018 339 / 429 Barrier Methods for Constrained Optimization

(Log) Barrier methods November 9, 2018 339 / 429 Barrier Methods for Constrained Optimization Consider a more general constrained optimization problem min f ( x ) x R n s.t. g i ( x ) 0 i = 1 ... m and A x = b Possibly reformulations

726 views • 33 slides

Computational Optimization Constrained Optimization Algorithms Same basic algorithms Repeat

Computational Optimization Constrained Optimization Algorithms Same basic algorithms Repeat Determine descent direction Determine step size Take a step Until Optimal But now must consider feasibility, e.g. Pick a feasible descent

415 views • 25 slides

Topology Optimization for Computational Fabrication Jun Wu Depart. of Design Engineering, TU

Topology Optimization for Computational Fabrication Jun Wu Depart. of Design Engineering, TU Delft www.jun-wu.net 2 3 http://www.wikiwand.com/en/Delftware 4 www.tudelft.nl Computational Design and Fabrication Group Charlie Wang

904 views • 68 slides

CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 /

CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 / 34 This material is covered in the textbook, Chapters 9 and 10. Some of the materials are taken from it. Some of the figures are from S. Boyd, L.

490 views • 34 slides

General Methods and Search 2. Generic Approaches to Combinatorial Optimization Algorithms 3.

Outline DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS FOR COMBINATORIAL OPTIMZATION 1. Solution Methods for Combinatorial Optimization Overview Lecture 3 General Methods and Search 2. Generic Approaches to Combinatorial Optimization

94 views • 7 slides