Metódy vol nej optimalizácie
|
|
- Catherine Henry
- 5 years ago
- Views:
Transcription
1 Matematické programovanie Metódy vol nej optimalizácie p. 1/35
2 Informácie o predmete Informácie o predmete p. 2/35
3 Informácie o predmete METÓDY VOL NEJ OPTIMALIZÁCIE Prednášajúca: M. Trnovská (M 267) Cvičiaci: J. Komadel Informácie týkajúce sa predmetu na stránke Konzultácie sa dajú dohodnút mailom. trnovska@pc2.iam.fmph.uniba.sk p. 3/35
4 Informácie o predmete Podmienky hodnotenia Domáce úlohy na cvičeniach 40 % Výstup: matlabovský kód, spracovanie úlohy (výstupu, komentárr, grafy, tabul ky) do pdf súboru (latex) Skúška 60 % Minimálna kostra - základné znalosti Písomka Ústna čast (nepovinná) p. 4/35
5 Informácie o predmete Podmienky hodnotenia % známka A B C D E p. 5/35
6 Informácie o predmete Literatúra Základná literatúra: M. Hamala, M. Trnovská: Nelineárne programovanie (1. čast ) Doplnková literatúra: S. Boyd, L. Vandenberghe: Convex optimization p. 6/35
7 Informácie o predmete Harmonogram prednášok Úvod do predmetu Motivačné prendášky Metódy minimalizácie funkcie jednej premennej Metódy intervalovej aproximácie Metódy bodovej aproximácie Metódy minimalizácie funkcie n premenných Klasické metódy Gradientné metódy Metóda CSR Newtonova metóda Moderné metódy Združené gradienty Kvázinewtonovské metódy Metódy pre vel korozmerné úlohy p. 7/35
8 Matematické programovanie Matematické programovanie p. 8/35
9 Matematické programovanie ÚLOHA MATEMATICKÉHO PROGRAMOVANIA min f 0 (x) x K R n (MP) Ak K = R n alebo K je otvorená množina - hovoríme o úlohe na vol ný extrém. Ak K je uzavretá množina spravidla popísaná systémom rovníc a nerovníc K = {x R n f i (x) 0,i I, h j (x) = 0,j J}, hovoríme o úlohe s ohraničeniami. p. 9/35
10 Matematické programovanie Z hl ladiska typu funkcií rozlišujeme Úlohu lineárneho programovania - ak funkcie f 0,f i, i I, h j, j J sú lineárne (afínne); Úlohu nelineárneho programovania - ak aspoň jedna z funkcií f 0,f i (x), i I, h j (x), j J nie je lineárna; Úlohu konvexného programovania - ak funkcie f 0,f i (x) 0,i I sú konvexné a funkcie h j (x), j J sú lineárne (afínne); LINEÁRNE KONVEXNÉ NELINEÁRNE p. 10/35
11 Matematické programovanie Klasifikácia úloh nelineárneho programovania: Ak K = {x R n h j (x) = 0,j J}, - klasická Lagrangeova úloha na viazaný extrém Ak K = {x R n f i (x) 0,i I}, - úloha nelineárneho programovania programovania v užšom zmysle Ak K = {x R n f i (x) 0,i I, h j (x) = 0,j J}, - úloha nelineárneho programovania programovania v širšom zmysle p. 11/35
12 Matematické programovanie METÓDY VOL NEJ OPTIMALIZÁCIE = metódy riešenia úloh na vol ný extrém min f(x) x R n (U1) kde f : R n R a často sa predpokladá diferencovatel nost (1. alebo 2. rádu). Optimálne riešenie úlohy (U1) - ˆx R n Optimálna hodnota f(ˆx) = ˆf Platí x R n : f(ˆx) = ˆf f(x) p. 12/35
13 Matematické programovanie Ak f je diferencovatel ná, ˆx je optimálne riešenie, tak zrejme f(ˆx) = 0. (NP) Ak f je navyše konvexná, podmienka (NP) je nie len nutnou, ale aj postačujúcou podmienkou optimality - riešenie úlohy (U1) je ekvivalentné riešeniu systḿu (NP). Úloha (U1) sa zvyčajne rieši nejakým iteračným algoritmom, ktorý generuje postupnost bodov x 0,x 1,x 2,... R n, f(x k ) ˆx, pre k Algoritmus končí v ε-presnom riešení, t. j. ked f(x k ) ˆf < ε. alebo ked je splnené iné kritérium suboptimality - napr. f(x k ) < ε. p. 13/35
14 Matematické programovanie Niektoré úlohy možno priamo naformulovat ako úlohu na vol ný extrém (U1) - napr. min f(x) = Ax b x R n - hl adanie približného riešenia systému Ax b v norme. min f(x) = Ax b +λ x x R n - hl adanie približného riešenia systému Ax b s regularizáciou. p. 14/35
15 Matematické programovanie Riešenie mnohých úloh matematického programovania s ohraničeniami min f 0 (x) f i (x) 0, i I h j (x) = 0, j J (MP) možno transformovat na riešenie postupnosti úloh na vol ný extrém (U1): Metódy Lagrangeovych funkcií Metódy vnútorného bodu p. 15/35
16 História optimalizačných úloh p. 16/35
17 Euklidova úloha: Do daného trojuholníka ABC vpíšte rovnobežník ADEF tak, že AF DE, AD EF a jeho obsah je maximálny. Ako naformulujeme Euklidov problém ako optimalizačnú úlohu? p. 17/35
18 Hx(c x) max f(x) = x (0,c) c maximum sa nadobúda pre x = c 2. Euklid to ukázal geometrickou úvahou dnes vieme, že stačí riešit f (x) = 0. Fermat ( ) Newton ( ) Leibnitz ( ) Lagrange ( ) p. 18/35
19 Joseph Louis Lagrange ( ) "Essai sur d une nouvelle méthode pour déterminer les maxima et minima des formules intégrales indéfinies" p. 19/35
20 Lagrangeova úloha: Min{f 0 (x) h i (x) = 0, i = 1,...,m} kde f 0,h j : R n R, j = 1,...,m Lagrangeova funkcia: L : R n R m R, L(x,u) = f 0 (x)+ m u i h i (x) i=1 Lagrangeova metóda: x L(x,u) = 0, u L(x,u) = 0. - systém nelineárnych rovníc - Newtonov algoritmus p. 20/35
21 Moderná matematická teória nelineárneho porgramovania Konferenica: Second Berkeley Symposium on Mathematical Statistics and Probability, 31. júl august, 1950 Miesto: Statistical Laboratory of the University of California, Berkeley Albert W. Tucker (Princeton) prezetnoval príspevok s názvom Nonlinear Programming (spoluautor: Harold W. Kuhn) Prvý krát sformulovaná úloha typu min g(x) f i (x) 0, i = 1,...,m x 0 a sformulovaná a dokázaná Kuhn-Tuckerova veta Na úvodnej strane: This work was done under contracts with the Office of Naval Research. p. 21/35
22 Harold W. Kuhn a Albert W. Tucker p. 22/35
23 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) p. 23/35
24 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne p. 24/35
25 lineárne vs. nelineárne 3 x- 2 y 4 x 2-2 x x 6 + x y- 4 y y y x y x p. 25/35
26 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne p. 26/35
27 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne George Dantzig - simplexová metóda p. 27/35
28 George Dantzig ( ) - Simplexová metóda p. 28/35
29 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne George Dantzig - simplexová metóda Narendra Karmarkar - metódy vnútorného bodu p. 29/35
30 Narendra Karmarkar ( ) - Metódy vnútorného bodu p. 30/35
31 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne George Dantzig - simplexová metóda Narendra Karmarkar - metódy vnútorného bodu konvexné vs. nekonvexné p. 31/35
32 konvexné vs. nekonvexné 0.5 x y 2 4 x 2-2 x x 6 + x y- 4 y y y x y x p. 32/35
33 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne George Dantzig - simplexová metóda Narendra Karmarkar - metódy vnútorného bodu konvexné vs. nekonvexné p. 33/35
34 Posúvanie hranice medzi jednoduchými a zložitými úlohami z historického hl adiska Matematické programovanie - teória a algoritmy na riešenie optimalizačných úloh typu min f 0 (x) x K R n (MP) lineárne vs. nelineárne George Dantzig - simplexová metóda Narendra Karmarkar - metódy vnútorného bodu konvexné vs. nekonvexné Nesterov & Nemirovski - metódy vnútorného bodu pre konvexné úlohy. p. 34/35
35 Yurii Nesterov a Arkadi Nemirovski p. 35/35
PROGRAM VZDELÁVACEJ ČINNOSTI. Anotácia predmetu
PROGRAM VZDELÁVACEJ ČINNOSTI Číslo predmetu : 3I0107 Názov predmetu : Štatistické a numerické metódy Typ predmetu : Povinný Študijný odbor: EF Zameranie: Ročník : 1. Ing. Semester : zimný Počet hodín týždenne
More informationConvex Optimization. Prof. Nati Srebro. Lecture 12: Infeasible-Start Newton s Method Interior Point Methods
Convex Optimization Prof. Nati Srebro Lecture 12: Infeasible-Start Newton s Method Interior Point Methods Equality Constrained Optimization f 0 (x) s. t. A R p n, b R p Using access to: 2 nd order oracle
More informationDIPLOMOVÁ PRÁCE. Peter Baník Metody optimalizace ve financích
Univerzita Karlova v Praze Matematicko-fyzikální fakulta DIPLOMOVÁ PRÁCE Peter Baník Metody optimalizace ve financích Katedra pravděpodobnosti a matematické statistiky Vedoucí diplomové práce: Doc. RNDr.
More informationCS295: Convex Optimization. Xiaohui Xie Department of Computer Science University of California, Irvine
CS295: Convex Optimization Xiaohui Xie Department of Computer Science University of California, Irvine Course information Prerequisites: multivariate calculus and linear algebra Textbook: Convex Optimization
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More information5. Subgradient method
L. Vandenberghe EE236C (Spring 2016) 5. Subgradient method subgradient method convergence analysis optimal step size when f is known alternating projections optimality 5-1 Subgradient method to minimize
More informationAlgoritmy metód vnútorného bodu v lineárnom programovaní
UNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY Algoritmy metód vnútorného bodu v lineárnom programovaní RIGORÓZNA PRÁCA 14 Mgr. Marek KABÁT UNIVERZITA KOMENSKÉHO V BRATISLAVE
More informationFAKULTA MATEMATIKY, FYZIKY A INFORMATIKY UNIVERZITY KOMENSKÉHO V BRATISLAVE
FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY UNIVERZITY KOMENSKÉHO V BRATISLAVE PÍSOMNÁ PRÁCA K DIZERTAČNEJ SKÚŠKE 2005 Zuzana Holeščáková FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY UNIVERZITY KOMENSKÉHO V BRATISLAVE
More informationConvex Optimization Lecture 13
Convex Optimization Lecture 13 Today: Interior-Point (continued) Central Path method for SDP Feasibility and Phase I Methods From Central Path to Primal/Dual Central'Path'Log'Barrier'Method Init: Feasible&#
More informationFakulta matematiky, fyziky a informatiky Univerzity Komenského v Bratislave. Písomná práca k dizertačnej skúške
Fakulta matematiky, fyziky a informatiky Univerzity Komenského v Bratislave Písomná práca k dizertačnej skúške Marec 2007 Tomáš Jurík Fakulta matematiky, fyziky a informatiky Univerzity Komenského v Bratislave
More informationLecture 1: Introduction
EE 227A: Convex Optimization and Applications January 17 Lecture 1: Introduction Lecturer: Anh Pham Reading assignment: Chapter 1 of BV 1. Course outline and organization Course web page: http://www.eecs.berkeley.edu/~elghaoui/teaching/ee227a/
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
More informationPrednáška 3. Optimalizačné metódy pre funkcie n-premenných. Študujme reálnu funkciu n-premenných. f: R R
Prednáška 3 Optimalizačné metódy pre funkcie n-premenných Študujme reálnu funkciu n-premenných n f: R R Našou úlohou bude nájsť také x opt R n, pre ktoré má funkcia f minimum x opt = arg min ( f x) Túto
More informationUNCLASSIFIED AD NUMBER LIMITATION CHANGES
TO: UNCLASSIFIED AD NUMBER AD237455 LIMITATION CHANGES Approved for public release; distribution is unlimited. FROM: Distribution authorized to U.S. Gov't. agencies and their contractors; Administrative/Operational
More informationTeória grafov. RNDr. Milan Stacho, PhD.
Teória grafov RNDr. Milan Stacho, PhD. Literatúra Plesník: Grafové algoritmy, Veda Bratislava 1983 Sedláček: Úvod do teórie grafů, Academia Praha 1981 Bosák: Grafy a ich aplikácie, Alfa Bratislava 1980
More informationCourse Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979)
Course Outline FRTN Multivariable Control, Lecture Automatic Control LTH, 6 L-L Specifications, models and loop-shaping by hand L6-L8 Limitations on achievable performance L9-L Controller optimization:
More information1. Introduction. mathematical optimization. least-squares and linear programming. convex optimization. example. course goals and topics
1. Introduction ESE 605 Modern Convex Optimization mathematical optimization least-squares and linear programming convex optimization example course goals and topics nonlinear optimization brief history
More informationConvex Optimization and l 1 -minimization
Convex Optimization and l 1 -minimization Sangwoon Yun Computational Sciences Korea Institute for Advanced Study December 11, 2009 2009 NIMS Thematic Winter School Outline I. Convex Optimization II. l
More informationLecture 7: Convex Optimizations
Lecture 7: Convex Optimizations Radu Balan, David Levermore March 29, 2018 Convex Sets. Convex Functions A set S R n is called a convex set if for any points x, y S the line segment [x, y] := {tx + (1
More information2. Vektorová metóda kinematickej analýzy VMS
2-5596 Mechanika viaaných mechanických systémov (VMS) pre špecialiáciu Aplikovaná mechanika, 4.roč. imný sem. Prednáša: doc.ing.františek Palčák, PhD., ÚAMM 02010 2. Vektorová metóda kinematickej analýy
More informationPrimal-Dual Interior-Point Methods. Javier Peña Convex Optimization /36-725
Primal-Dual Interior-Point Methods Javier Peña Convex Optimization 10-725/36-725 Last time: duality revisited Consider the problem min x subject to f(x) Ax = b h(x) 0 Lagrangian L(x, u, v) = f(x) + u T
More informationDEA modely a meranie eko-efektívnosti
Fakulta matematiky, fyziky a informatiky Univerzita Komenského v Bratislave DEA modely a meranie eko-efektívnosti 2008 Veronika Lennerová DEA modely a meranie eko-efektívnosti DIPLOMOVÁ PRÁCA Diplomant:
More informationUnit: Optimality Conditions and Karush Kuhn Tucker Theorem
Unit: Optimality Conditions and Karush Kuhn Tucker Theorem Goals 1. What is the Gradient of a function? What are its properties? 2. How can it be used to find a linear approximation of a nonlinear function?
More informationSummary Notes on Maximization
Division of the Humanities and Social Sciences Summary Notes on Maximization KC Border Fall 2005 1 Classical Lagrange Multiplier Theorem 1 Definition A point x is a constrained local maximizer of f subject
More informationIntroduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research
Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,
More informationPrimal-Dual Interior-Point Methods. Ryan Tibshirani Convex Optimization /36-725
Primal-Dual Interior-Point Methods Ryan Tibshirani Convex Optimization 10-725/36-725 Given the problem Last time: barrier method min x subject to f(x) h i (x) 0, i = 1,... m Ax = b where f, h i, i = 1,...
More informationOptimálne riadenie. Viacetapové rozhodovacie procesy v ekonómii a financiách. Margaréta Halická Pavel Brunovský Pavol Jurča
Optimálne riadenie Viacetapové rozhodovacie procesy v ekonómii a financiách Margaréta Halická Pavel Brunovský Pavol Jurča EPOS Bratislava 2009 Kniha predstavuje komplexný výklad teórie optimálneho rozhodovania
More informationOptimization: Then and Now
Optimization: Then and Now Optimization: Then and Now Optimization: Then and Now Why would a dynamicist be interested in linear programming? Linear Programming (LP) max c T x s.t. Ax b αi T x b i for i
More informationJanuary 29, Introduction to optimization and complexity. Outline. Introduction. Problem formulation. Convexity reminder. Optimality Conditions
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis Dimensioning II Department of Electronics Communications Engineering Tampere University of Technology, Tampere, Finl January 29, 2014 1 2 3
More informationPrimal-Dual Interior-Point Methods. Ryan Tibshirani Convex Optimization
Primal-Dual Interior-Point Methods Ryan Tibshirani Convex Optimization 10-725 Given the problem Last time: barrier method min x subject to f(x) h i (x) 0, i = 1,... m Ax = b where f, h i, i = 1,... m are
More informationSúťaž PALMA junior a programovanie v jazyku Python
Súťaž PALMA junior a programovanie v jazyku Python Ján Guniš Ľubomír Šnajder Prírodovedecká fakulta Univerzity P. J. Šafárika v Košiciach DidInfo + DidactIG 2017, Banská Bystrica Obsah Súťaž PALMA junior
More informationInterior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems
AMSC 607 / CMSC 764 Advanced Numerical Optimization Fall 2008 UNIT 3: Constrained Optimization PART 4: Introduction to Interior Point Methods Dianne P. O Leary c 2008 Interior Point Methods We ll discuss
More informationUNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY
UNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY Vlastnosti spektrahedrálnych mnoºín a ich aplikácie v nelineárnej optimalizácii DIPLOMOVÁ PRÁCA 2016 Bc. Andrej Iring UNIVERZITA
More informationMath 5593 Linear Programming Week 1
University of Colorado Denver, Fall 2013, Prof. Engau 1 Problem-Solving in Operations Research 2 Brief History of Linear Programming 3 Review of Basic Linear Algebra Linear Programming - The Story About
More informationÚLOHA KURIÉRA S ČASOVÝMI OKNAMI
ÚLOHA KURIÉRA S ČASOVÝMI OKNAMI Čičková Zuzana Brezina Ivan Pekár Jura ÚVOD Problém kuriéra ([4], [5]) e edným z mnohých modifikácií známeho problému obchodného cestuúceho. Jeho názov vyplýva z priame
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationEcon 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS. Carmen Astorne-Figari Washington University in St. Louis.
Econ 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS Carmen Astorne-Figari Washington University in St. Louis August 12, 2010 INTRODUCTION General form of an optimization problem: max x f
More informationA DUALITY THEOREM FOR NON-LINEAR PROGRAMMING* PHILIP WOLFE. The RAND Corporation
239 A DUALITY THEOREM FOR N-LINEAR PROGRAMMING* BY PHILIP WOLFE The RAND Corporation Summary. A dual problem is formulated for the mathematical programming problem of minimizing a convex function under
More informationSpectral Functions and Smoothing Techniques on Jordan Algebras
Université catholique de Louvain Faculté des Sciences appliquées Département d Ingénierie mathématique Center for Operation Research and Econometrics Center for Systems Engineering and Applied Mechanics
More informationCE 191: Civil & Environmental Engineering Systems Analysis. LEC 17 : Final Review
CE 191: Civil & Environmental Engineering Systems Analysis LEC 17 : Final Review Professor Scott Moura Civil & Environmental Engineering University of California, Berkeley Fall 2014 Prof. Moura UC Berkeley
More informationMTH 202 : Probability and Statistics
MTH 202 : Probability and Statistics Lecture 9 - : 27, 28, 29 January, 203 4. Functions of a Random Variables 4. : Borel measurable functions Similar to continuous functions which lies to the heart of
More informationKapitola S5. Skrutkovica na rotačnej ploche
Kapitola S5 Skrutkovica na rotačnej ploche Nech je rotačná plocha určená osou rotácie o a meridiánom m. Skrutkový pohyb je pohyb zložený z rovnomerného rotačného pohybu okolo osi o a z rovnomerného translačného
More informationOn well definedness of the Central Path
On well definedness of the Central Path L.M.Graña Drummond B. F. Svaiter IMPA-Instituto de Matemática Pura e Aplicada Estrada Dona Castorina 110, Jardim Botânico, Rio de Janeiro-RJ CEP 22460-320 Brasil
More informationA Second-Order Path-Following Algorithm for Unconstrained Convex Optimization
A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization Yinyu Ye Department is Management Science & Engineering and Institute of Computational & Mathematical Engineering Stanford
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009
UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that
More informationShiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient
Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian
More information10. Unconstrained minimization
Convex Optimization Boyd & Vandenberghe 10. Unconstrained minimization terminology and assumptions gradient descent method steepest descent method Newton s method self-concordant functions implementation
More informationIng. Tomasz Kanik. doc. RNDr. Štefan Peško, CSc.
Ing. Tomasz Kanik Školiteľ: doc. RNDr. Štefan Peško, CSc. Pracovisko: Študijný program: KMMOA, FRI, ŽU 9.2.9 Aplikovaná informatika 1 identifikácia problémovej skupiny pacientov, zlepšenie kvality rozhodovacích
More informationLecture 3. Optimization Problems and Iterative Algorithms
Lecture 3 Optimization Problems and Iterative Algorithms January 13, 2016 This material was jointly developed with Angelia Nedić at UIUC for IE 598ns Outline Special Functions: Linear, Quadratic, Convex
More informationConvex Optimization. Ofer Meshi. Lecture 6: Lower Bounds Constrained Optimization
Convex Optimization Ofer Meshi Lecture 6: Lower Bounds Constrained Optimization Lower Bounds Some upper bounds: #iter μ 2 M #iter 2 M #iter L L μ 2 Oracle/ops GD κ log 1/ε M x # ε L # x # L # ε # με f
More informationSharpness, Restart and Compressed Sensing Performance.
Sharpness, Restart and Compressed Sensing Performance. Alexandre d Aspremont, CNRS & D.I., Ecole normale supérieure. With Vincent Roulet (U. Washington) and Nicolas Boumal (Princeton U.). Support from
More informationNewton s Method. Javier Peña Convex Optimization /36-725
Newton s Method Javier Peña Convex Optimization 10-725/36-725 1 Last time: dual correspondences Given a function f : R n R, we define its conjugate f : R n R, f ( (y) = max y T x f(x) ) x Properties and
More informationLecture 15 Newton Method and Self-Concordance. October 23, 2008
Newton Method and Self-Concordance October 23, 2008 Outline Lecture 15 Self-concordance Notion Self-concordant Functions Operations Preserving Self-concordance Properties of Self-concordant Functions Implications
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 6 Optimization Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More informationWSEAS TRANSACTIONS on MATHEMATICS
l p -Norm Minimization Method for Solving Nonlinear Systems of Equations ANDRÉ A. KELLER Laboratoire d Informatique Fondamentale de Lille/ Section SMAC UMR 8022 CNRS) Université de Lille 1 Sciences et
More informationImplicit sampling for particle filters. Alexandre Chorin, Mathias Morzfeld, Xuemin Tu, Ethan Atkins
0/20 Implicit sampling for particle filters Alexandre Chorin, Mathias Morzfeld, Xuemin Tu, Ethan Atkins University of California at Berkeley 2/20 Example: Try to find people in a boat in the middle of
More informationIntroduction to optimization
Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)
More informationMatematická analýza II.
V. Diferenciálny počet (prezentácia k prednáške MANb/10) doc. RNDr., PhD. 1 1 ondrej.hutnik@upjs.sk umv.science.upjs.sk/analyza Prednáška 8 6. marca 2018 It has apparently not yet been observed, that...
More informationGENERALIZED second-order cone complementarity
Stochastic Generalized Complementarity Problems in Second-Order Cone: Box-Constrained Minimization Reformulation and Solving Methods Mei-Ju Luo and Yan Zhang Abstract In this paper, we reformulate the
More informationMASTER THESIS. Vlastnosti k-intervalových booleovských funkcí Properties of k-interval Boolean functions
Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Pavol Gál Vlastnosti k-intervalových booleovských funkcí Properties of k-interval Boolean functions Department of Theoretical
More information2.3 Linear Programming
2.3 Linear Programming Linear Programming (LP) is the term used to define a wide range of optimization problems in which the objective function is linear in the unknown variables and the constraints are
More informationThe Q-parametrization (Youla) Lecture 13: Synthesis by Convex Optimization. Lecture 13: Synthesis by Convex Optimization. Example: Spring-mass System
The Q-parametrization (Youla) Lecture 3: Synthesis by Convex Optimization controlled variables z Plant distubances w Example: Spring-mass system measurements y Controller control inputs u Idea for lecture
More informationAplikácia kvantitatívnych prístupov
Aplikácia kvantitatívnych prístupov v logistike Ivan Brezina Katedra operačného výskumu a ekonometrie FHI EU v Bratislave Realizácia výrobného procesu Ivan Brezina 2 Logistika obstarávania Ivan Brezina
More informationUNCLASSIFIED. .n ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED
UNCLASSIFIED.n 260610 ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED NOTICE: When government or other drawings, specifications or other data are
More informationMath 273a: Optimization Subgradients of convex functions
Math 273a: Optimization Subgradients of convex functions Made by: Damek Davis Edited by Wotao Yin Department of Mathematics, UCLA Fall 2015 online discussions on piazza.com 1 / 42 Subgradients Assumptions
More informationFrom Convex Optimization to Linear Matrix Inequalities
Dep. of Information Engineering University of Pisa (Italy) From Convex Optimization to Linear Matrix Inequalities eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain
More informationUNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY
UNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY Aplikácie matematiky v ekonómii a financiách BAKALÁRSKA PRÁCA 2012 Martin BUŠÍK UNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY,
More informationČasopis pro pěstování matematiky a fysiky
Časopis pro pěstování matematiky a fysiky Norman Levinson Criteria for the limit-point case for second order linear differential operators Časopis pro pěstování matematiky a fysiky, Vol. 74 (1949), No.
More informationJádrové odhady gradientu regresní funkce
Monika Kroupová Ivana Horová Jan Koláček Ústav matematiky a statistiky, Masarykova univerzita, Brno ROBUST 2018 Osnova Regresní model a odhad gradientu Metody pro odhad vyhlazovací matice Simulace Závěr
More informationConvex Optimization. Dani Yogatama. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA. February 12, 2014
Convex Optimization Dani Yogatama School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA February 12, 2014 Dani Yogatama (Carnegie Mellon University) Convex Optimization February 12,
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationIntroduction to Nonlinear Stochastic Programming
School of Mathematics T H E U N I V E R S I T Y O H F R G E D I N B U Introduction to Nonlinear Stochastic Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio SPS
More informationSLOVENSKÁ TECHNICKÁ UNIVERZITA V BRATISLAVE FAKULTA CHEMICKEJ A POTRAVINÁRSKEJ TECHNOLÓGIE ÚSTAV INFORMATIZÁCIE, AUTOMATIZÁCIE A MATEMATIKY
SLOVENSKÁ TECHNICKÁ UNIVERZITA V BRATISLAVE FAKULTA CHEMICKEJ A POTRAVINÁRSKEJ TECHNOLÓGIE ÚSTAV INFORMATIZÁCIE, AUTOMATIZÁCIE A MATEMATIKY OPTIMÁLNE RIADENIE PROCESOV BAKALARÁSKA PRÁCA FCHPT-5415-17457
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationAn Iterative Descent Method
Conjugate Gradient: An Iterative Descent Method The Plan Review Iterative Descent Conjugate Gradient Review : Iterative Descent Iterative Descent is an unconstrained optimization process x (k+1) = x (k)
More informationKarush-Kuhn-Tucker Conditions. Lecturer: Ryan Tibshirani Convex Optimization /36-725
Karush-Kuhn-Tucker Conditions Lecturer: Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given a minimization problem Last time: duality min x subject to f(x) h i (x) 0, i = 1,... m l j (x) = 0, j =
More informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More information4.1 - Maximum and Minimum Values
4.1 - Maximum and Minimum Values Calculus I, Section 011 Zachary Cline Temple University October 27, 2017 Maximum and Minimum Values absolute max. of 5 occurs at 3 absolute min. of 2 occurs at 6 Maximum
More information= (, ) V λ (1) λ λ ( + + ) P = [ ( ), (1)] ( ) ( ) = ( ) ( ) ( 0 ) ( 0 ) = ( 0 ) ( 0 ) 0 ( 0 ) ( ( 0 )) ( ( 0 )) = ( ( 0 )) ( ( 0 )) ( + ( 0 )) ( + ( 0 )) = ( + ( 0 )) ( ( 0 )) P V V V V V P V P V V V
More informationPrimal-Dual Interior-Point Methods
Primal-Dual Interior-Point Methods Lecturer: Aarti Singh Co-instructor: Pradeep Ravikumar Convex Optimization 10-725/36-725 Outline Today: Primal-dual interior-point method Special case: linear programming
More informationFRTN10 Multivariable Control, Lecture 13. Course outline. The Q-parametrization (Youla) Example: Spring-mass System
FRTN Multivariable Control, Lecture 3 Anders Robertsson Automatic Control LTH, Lund University Course outline The Q-parametrization (Youla) L-L5 Purpose, models and loop-shaping by hand L6-L8 Limitations
More informationAffine Arithmetic: Concepts and Applications
SCAN 2002 Affine Arithmetic: Concepts and Applications Luiz Henrique de Figueiredo (IMPA) Jorge Stolfi (UNICAMP) Outline What is affine arithmetic? The dependency problem in interval arithmetic Main concepts
More informationSamuel Flimmel. Univerzita Karlova v Praze Matematicko-fyzikální fakulta. Katedra pravděpodobnosti a matematické statistiky
Univerzita Karlova v Praze Matematicko-fyzikální fakulta BAKALÁŘSKÁ PRÁCE Samuel Flimmel Log-optimální investování Katedra pravděpodobnosti a matematické statistiky Vedoucí bakalářské práce: doc. RNDr.
More informationg(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to
1 of 11 11/29/2010 10:39 AM From Wikipedia, the free encyclopedia In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) provides a strategy for finding the
More informationGRADIENT = STEEPEST DESCENT
GRADIENT METHODS GRADIENT = STEEPEST DESCENT Convex Function Iso-contours gradient 0.5 0.4 4 2 0 8 0.3 0.2 0. 0 0. negative gradient 6 0.2 4 0.3 2.5 0.5 0 0.5 0.5 0 0.5 0.4 0.5.5 0.5 0 0.5 GRADIENT DESCENT
More informationAlgorithms for nonlinear programming problems II
Algorithms for nonlinear programming problems II Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects
More informationNewton s Method. Ryan Tibshirani Convex Optimization /36-725
Newton s Method Ryan Tibshirani Convex Optimization 10-725/36-725 1 Last time: dual correspondences Given a function f : R n R, we define its conjugate f : R n R, Properties and examples: f (y) = max x
More informationIOE 611/Math 663: Nonlinear Programming
1. Introduction I course logistics I mathematical optimization I least-squares and linear programming I convex optimization I example I course goals and topics I nonlinear optimization I brief history
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationMETRICKÉ ÚLOHY V PRIESTORE
1. ÚVOD METRICKÉ ÚLOHY V PRIESTORE Monika ĎURIKOVIČOVÁ 1 Katedra Matematiky, Strojnícka fakulta STU, Abstrakt: Popisujeme možnosti použitia programového systému Mathematica pri riešení špeciálnych metrických
More informationMatematika 17. a 18. storočia
Matematika 17. a 18. storočia René Descartes Narodený : 31 Marec 1596 v La Haye (teraz Descartes),Touraine, France Zomrel : 11 Feb 1650 v Stockholm, Sweden Riešenie kvadratických rovníc podľa Descarta
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationFAKULTA HUMANITNÝCH VIED, ŽILINSKÁ UNIVERZITA V ŽILINE INFORMAČNÝ LIST PREDMETU. Názov: Matematická analýza 1 (povinný) Zabezpečuje:
Názov: Matematická analýza 1 (povinný) prof. RNDr. Miroslava Růžičková, CSc. Semester: 1. rok štúdia: 1. Týždenný: 4 2 0 Za semester: 52 26 0 Prerekvizity: Stredoškolská matematika v rozsahu osnov gymnázií.
More informationDuality in Mathematical Programming
Duality in Mathematical Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Operations research courses p. 1 Lecture material Website: http://www.lix.polytechnique.fr/~liberti/
More informationSolving a Class of Generalized Nash Equilibrium Problems
Journal of Mathematical Research with Applications May, 2013, Vol. 33, No. 3, pp. 372 378 DOI:10.3770/j.issn:2095-2651.2013.03.013 Http://jmre.dlut.edu.cn Solving a Class of Generalized Nash Equilibrium
More informationLecture 15: October 15
10-725: Optimization Fall 2012 Lecturer: Barnabas Poczos Lecture 15: October 15 Scribes: Christian Kroer, Fanyi Xiao Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationLecture: Quadratic optimization
Lecture: Quadratic optimization 1. Positive definite och semidefinite matrices 2. LDL T factorization 3. Quadratic optimization without constraints 4. Quadratic optimization with constraints 5. Least-squares
More informationMathematics of Data: From Theory to Computation
Mathematics of Data: From Theory to Computation Prof. Volkan Cevher volkan.cevher@epfl.ch Lecture 13: Disciplined convex optimization Laboratory for Information and Inference Systems (LIONS) École Polytechnique
More information