A Gentle Introduction to Continuous and Mixed-Integer Conic Programming

Total Page:16

File Type:pdf, Size:1020Kb

A Gentle Introduction to Continuous and Mixed-Integer Conic Programming A gentle introduction to Continuous and Mixed-Integer Conic Programming Universit`adi Bologna November 23th, 2020 Sven Wiese www.mosek.com Overview 1. From Linear to Conic Programming 2. Examples & Applications of cones - Symmetric cones - Non-symmetric cones - Yet more cones 3. Conic duality 4. Numerical solution methods - The continuous case - The mixed-integer case 1 / 67 1. From Linear to Conic Programming Linear Programming Linear Optimization in standard form: minimize cT x subject to Ax = b x ≥ 0: Pro: • Structure is explicit and simple. • Data is simple: c; A; b. • Structure implies data-independent convexity. • Powerful duality theory including Farkas lemma. Therefore, we have powerful algorithms and software. 3 / 67 Linear Programming Con: • It is linear only. 4 / 67 Nonlinear Programming The classical nonlinear optimization problem: minimize f (x) subject to h(x) = 0 g(x) ≤ 0: Pro • It is very general. Con: • Structure is less explicit. • How to specify the problem at all in software? • How to compute gradients and Hessians if needed? • How to exploit structure? • Smoothness? • Verifying convexity is NP-hard! 5 / 67 A fundamental question Is there a class of nonlinear optimization problems that preserves possibly many of the good properties of Linear Programming? 6 / 67 Good partial orderings Definition (Ben-Tal & Nemirovski, (2001)) n A \good" partial ordering of R is a vector relation that satisfies: 1. reflexivity 2. antisymmetry 3. transitivity 4. compatibility with linear operations The coordinatewise ordering x ≥ y () xi ≥ yi 8i = 1;:::; n is an example, but not the only one! 7 / 67 Good partial orderings • If for some good partial ordering \" we define n K := fa 2 R j a 0g; then K must be a pointed, convex cone: 1. a; a0 2 K =) a + a0 2 K 2. a 2 K; λ ≥ 0 =) λa 2 K 3. a 2 K and −a 2 K =) a = 0 • Conversely, if K is a non-empty pointed convex cone, then x K y :() x − y 2 K defines a good partial ordering. n The cone R+ is also closed and has a non-empty interior. 8 / 67 (Mixed-Integer) Conic Programming We thus consider problems of the form minimize cT x subject to Ax = b n p n x 2≥ RK0 +\ (Z × R ) where K is a (closed) pointed convex cone (with non-empty interior). • (MI)LP is a special case! • Typically, K = K1 × K2 × · · · × KK is a product of lower-dimensional cones. • A conic building block Ki can be thought of as encoding some type of specific non-linearity. 9 / 67 The beauty of conic optimization • Separation of data and structure: • Data: c, A and b. • Structure: K. • No issues with smoothness and differentiability. • Structural convexity. • Duality (almost...). 10 / 67 References I • A. Ben-Tal & A. Nemirovski: Lectures on Modern Convex Optimization (2001). 11 / 67 2. Examples & Applications of cones The conic wheel LP cone K 13 / 67 Quadratic cones n After the non-negative orthant R+, the quadratic-cone family is arguably most prominent. • the quadratic cone n n 2 21=2 Q = fx 2 R j x1 ≥ x2 + ··· + xn = kx2:nk2g; • the rotated quadratic cone n n 2 2 2 Qr = fx 2 R j 2x1x2 ≥ x3 + ··· + xn = kx3:nk2; x1; x2 ≥ 0g: n n Are equivalent in the sense that x 2 Q () Tnx 2 Qr with p p 0 1 1=p21 = p20 @1= 2 −1= 20 A : 00 In−2 14 / 67 Quadratic cones in dimension 3 x1 x1 x3 x3 x2 x2 15 / 67 Conic quadratic case study: least squares regression In least squares regression we use the penalty function φ(r) = krk2: n In its simplest form, given observations y 2 R and features n×d X 2 R , it solves min ky − Xwk2: w2Rd Start with a small and simple amount of reformulation: minimize t subject to t ≥ ky − Xwk2 d t 2 R; w 2 R 16 / 67 Conic quadratic case study: least squares regression In the conic framework this would be written as minimize t subject to s = y − Xw (t; s) 2 Qn+1 d w 2 R : We usually use the more compact notation (t; y − Xw) 2 Qn+1: 17 / 67 More conic quadratic modeling • Second-order cone inequality: T T m+1 c x + d ≥ kAx + bk2 () (c x + d; Ax + b) 2 Q : • Squared Euclidean norm: 2 n+2 t ≥ kxk2 () (t; 1=2; x) 2 Qr : • Convex quadratic inequality: T T k+2 t ≥ (1=2)x Qx () (t; 1; F x) 2 Qr T n×k with Q = F F , F 2 R . Any convex (MI)QCQP can be cast in conic form! 18 / 67 More conic quadratic modeling • Square roots, convex hyperbolic function, some convex negative rational powers... • Convex positive rational power t ≥ x3=2; x ≥ 0 : If we impose 1 (s; t; x); (x; 1=8; s) 2 Q3 () 2st ≥ x2; 2x · ≥ s2; r 8 it follows that 1 4s2t2 · x ≥ x4s2 =) t2 ≥ x3 =) t ≥ x3=2: 4 19 / 67 The positive semidefinite cone The positive semidefinite cone can be defined as a subspace of the n(n+1)=2 vector space R n(n+1)=2 n(n+1)=2 T n S := fx 2 R j z smat(x)z ≥ 0; 8z 2 R g; with p p 0 1 x1p x2= 2 ::: xn= p2 B x2= 2 xn+1 ::: x2n−1= 2 C smat(x) := B C : B . C @ .p . p . A xn= 2 x2n−1= 2 ::: xn(n+1)=2 An equivalent definition via matrix variables: n n T n X 2 S+ :() X 2 S and z Xz ≥ 0 8z 2 R : X is mapped to Sn(n+1)=2 via p p p T svec(X ) := (X11; 2X21;:::; 2Xn1; X22; 2X32;:::; Xnn) : 20 / 67 SDP use-case: Nearest correlation matrix n Let A 2 S and assume we want to find its nearest correlation matrix ∗ n X 2 C := fX 2 S+ j Xii = 1 8i = 1;:::; ng; i.e., ∗ X = min kA − X kF : X 2C A conic formulation in vector space is given by minimize t subject to x1 = xn+1 = x2n = ::: = xn(n+1)=2 = 1 (t; svec(A) − x) 2 Qn(n+1)=2+1 x 2 Sn(n+1)=2: 21 / 67 More semidefinite modeling • SDP can come in handy in eigenvalue optimization, e.g., if tI − X n 0; S+ then t is an upper bound on the largest eigenvalue of X . • SDP-relaxations play a role in Quadratic Programming and in Combinatorial Optimization: T T X = xx can be relaxed to X − xx n 0: S+ • There are applications for Mixed-Integer SDP, see, e.g., Gally, Pfetsch and Ulbrich (2018). 22 / 67 Back to the conic wheel LP cone K quadratic cones SDP The three cones we have seen so far are so-called symmetric cones, i.e., they are 1. homogeneous 2. self-dual 23 / 67 The exponential cone The exponential cone is defined as the closure of the epigraph of the perspective of the exponential function: 3 Kexp := clfx 2 R j x1 ≥ x2 exp(x3=x2); x2 > 0g; or more explicitly Kexp = f(x1; x2; x3) j x1 ≥ x2 exp(x3=x2); x2 > 0g [ f(x1; 0; x3) j x1 ≥ 0; x3 ≤ 0g: The exponential cone is non-symmetric! 24 / 67 The exponential cone x1 x3 x2 25 / 67 Exponential cone use case: Geometric Programming Consider the very simple Geometric Program 0:3 minimize px + y z subject to x + y −1 ≤ 1 x; y; z > 0 First note that ex1 + ::: + exk ≤ 1 can be modeled as k X (ui ; 1; xi ) 2 Kexp 8i = 1;:::; k and ui ≤ 1; i=1 and then substitute x = ep; y = eq; z = er : minimize t subject to( u1; 1; p − t); (u2; 1; 0:3q + w − t) 2 Kexp; u1 + u2 ≤ 1 (v1; 1; p=2); (v2; 1; −q) 2 Kexp; v1 + v2 ≤ 1 26 / 67 More exponential cone modeling • Logarithm: log x ≥ t () (x; 1; t) 2 Kexp: • Entropy: −x log x ≥ t () (1; x; t) 2 Kexp: • Relative entropy: x log(x=y) ≤ t () (y; x; −t) 2 Kexp: • Softplus function: x log(1+e ) ≤ t () (u; 1; x−t); (v; 1; −t) 2 Kexp; u+v ≤ 1: 27 / 67 The power cone The power cone is defined as α n α (1−α) Pn = fx 2 R j x1 x2 ≥ kx3:nk2; x1; x2 ≥ 0g; for0 < α < 1. One may also restrict to the three-dimensional power cone without losing any modeling capabilities: α α n−1 (x1;:::; xn) 2 Pn () (x1; x2; z) 2 P3 ; (z; x3;:::; xn) 2 Q : Also the power cone is non-symmetric! 28 / 67 The power cone x1 x1 x3 x3 α = 0:6 x2 α = 0:8 x2 29 / 67 Power cone modeling • Simple powers: p p jtj ≤ x ; x ≥ 0 with 0 < p < 1 () (x; 1; t) 2 P3 : p 1=p t ≥ jxj with p > 1 () (t; 1; x) 2 P3 : 3=2 2=3 Example: t ≥ x ; x ≥ 0 () (t; 1; x) 2 P3 (instead of 3 (s; t; x); (x; 1=8; s) 2 Qr ...) • p-norms, geometric mean, ... 30 / 67 How general is the conic wheel? exponential LP cone cone Continuous Optimization Folklore power K quadratic \Almost all convex constraints which cone cones arise in practice are representable using these 5 cones." SDP More evidence: Lubin et al. (2016) show that all convex instances (333) in MINLPLIB2 are conic representable using only 4 of the above cones. 31 / 67 Verifying convexity Is log(1=(1 + exp(−x))) ≤ 0 a convex constraint? From ask.cvxr.com: Verifying convexity can be hard! Solution: Disciplined Convex Programming (DCP) by Grant, Boyd and Ye (2006): only allow for modeling operations that preserve convexity.
Recommended publications
  • Multi-Objective Optimization of Unidirectional Non-Isolated Dc/Dcconverters
    MULTI-OBJECTIVE OPTIMIZATION OF UNIDIRECTIONAL NON-ISOLATED DC/DC CONVERTERS by Andrija Stupar A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Edward S. Rogers Department of Electrical and Computer Engineering University of Toronto © Copyright 2017 by Andrija Stupar Abstract Multi-Objective Optimization of Unidirectional Non-Isolated DC/DC Converters Andrija Stupar Doctor of Philosophy Graduate Department of Edward S. Rogers Department of Electrical and Computer Engineering University of Toronto 2017 Engineers have to fulfill multiple requirements and strive towards often competing goals while designing power electronic systems. This can be an analytically complex and computationally intensive task since the relationship between the parameters of a system’s design space is not always obvious. Furthermore, a number of possible solutions to a particular problem may exist. To find an optimal system, many different possible designs must be evaluated. Literature on power electronics optimization focuses on the modeling and design of partic- ular converters, with little thought given to the mathematical formulation of the optimization problem. Therefore, converter optimization has generally been a slow process, with exhaus- tive search, the execution time of which is exponential in the number of design variables, the prevalent approach. In this thesis, geometric programming (GP), a type of convex optimization, the execution time of which is polynomial in the number of design variables, is proposed and demonstrated as an efficient and comprehensive framework for the multi-objective optimization of non-isolated unidirectional DC/DC converters. A GP model of multilevel flying capacitor step-down convert- ers is developed and experimentally verified on a 15-to-3.3 V, 9.9 W discrete prototype, with sets of loss-volume Pareto optimal designs generated in under one minute.
    [Show full text]
  • Julia, My New Friend for Computing and Optimization? Pierre Haessig, Lilian Besson
    Julia, my new friend for computing and optimization? Pierre Haessig, Lilian Besson To cite this version: Pierre Haessig, Lilian Besson. Julia, my new friend for computing and optimization?. Master. France. 2018. cel-01830248 HAL Id: cel-01830248 https://hal.archives-ouvertes.fr/cel-01830248 Submitted on 4 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 1 « Julia, my New frieNd for computiNg aNd optimizatioN? » Intro to the Julia programming language, for MATLAB users Date: 14th of June 2018 Who: Lilian Besson & Pierre Haessig (SCEE & AUT team @ IETR / CentraleSupélec campus Rennes) « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 2 AgeNda for today [30 miN] 1. What is Julia? [5 miN] 2. ComparisoN with MATLAB [5 miN] 3. Two examples of problems solved Julia [5 miN] 4. LoNger ex. oN optimizatioN with JuMP [13miN] 5. LiNks for more iNformatioN ? [2 miN] « Julia, my new computing friend? » | 14 June 2018, IETR@Vannes | By: L. Besson & P. Haessig 3 1. What is Julia ? Open-source and free programming language (MIT license) Developed since 2012 (creators: MIT researchers) Growing popularity worldwide, in research, data science, finance etc… Multi-platform: Windows, Mac OS X, GNU/Linux..
    [Show full text]
  • Numericaloptimization
    Numerical Optimization Alberto Bemporad http://cse.lab.imtlucca.it/~bemporad/teaching/numopt Academic year 2020-2021 Course objectives Solve complex decision problems by using numerical optimization Application domains: • Finance, management science, economics (portfolio optimization, business analytics, investment plans, resource allocation, logistics, ...) • Engineering (engineering design, process optimization, embedded control, ...) • Artificial intelligence (machine learning, data science, autonomous driving, ...) • Myriads of other applications (transportation, smart grids, water networks, sports scheduling, health-care, oil & gas, space, ...) ©2021 A. Bemporad - Numerical Optimization 2/102 Course objectives What this course is about: • How to formulate a decision problem as a numerical optimization problem? (modeling) • Which numerical algorithm is most appropriate to solve the problem? (algorithms) • What’s the theory behind the algorithm? (theory) ©2021 A. Bemporad - Numerical Optimization 3/102 Course contents • Optimization modeling – Linear models – Convex models • Optimization theory – Optimality conditions, sensitivity analysis – Duality • Optimization algorithms – Basics of numerical linear algebra – Convex programming – Nonlinear programming ©2021 A. Bemporad - Numerical Optimization 4/102 References i ©2021 A. Bemporad - Numerical Optimization 5/102 Other references • Stephen Boyd’s “Convex Optimization” courses at Stanford: http://ee364a.stanford.edu http://ee364b.stanford.edu • Lieven Vandenberghe’s courses at UCLA: http://www.seas.ucla.edu/~vandenbe/ • For more tutorials/books see http://plato.asu.edu/sub/tutorials.html ©2021 A. Bemporad - Numerical Optimization 6/102 Optimization modeling What is optimization? • Optimization = assign values to a set of decision variables so to optimize a certain objective function • Example: Which is the best velocity to minimize fuel consumption ? fuel [ℓ/km] velocity [km/h] 0 30 60 90 120 160 ©2021 A.
    [Show full text]
  • TOMLAB –Unique Features for Optimization in MATLAB
    TOMLAB –Unique Features for Optimization in MATLAB Bad Honnef, Germany October 15, 2004 Kenneth Holmström Tomlab Optimization AB Västerås, Sweden [email protected] ´ Professor in Optimization Department of Mathematics and Physics Mälardalen University, Sweden http://tomlab.biz Outline of the talk • The TOMLAB Optimization Environment – Background and history – Technology available • Optimization in TOMLAB • Tests on customer supplied large-scale optimization examples • Customer cases, embedded solutions, consultant work • Business perspective • Box-bounded global non-convex optimization • Summary http://tomlab.biz Background • MATLAB – a high-level language for mathematical calculations, distributed by MathWorks Inc. • Matlab can be extended by Toolboxes that adds to the features in the software, e.g.: finance, statistics, control, and optimization • Why develop the TOMLAB Optimization Environment? – A uniform approach to optimization didn’t exist in MATLAB – Good optimization solvers were missing – Large-scale optimization was non-existent in MATLAB – Other toolboxes needed robust and fast optimization – Technical advantages from the MATLAB languages • Fast algorithm development and modeling of applied optimization problems • Many built in functions (ODE, linear algebra, …) • GUIdevelopmentfast • Interfaceable with C, Fortran, Java code http://tomlab.biz History of Tomlab • President and founder: Professor Kenneth Holmström • The company founded 1986, Development started 1989 • Two toolboxes NLPLIB och OPERA by 1995 • Integrated format for optimization 1996 • TOMLAB introduced, ISMP97 in Lausanne 1997 • TOMLAB v1.0 distributed for free until summer 1999 • TOMLAB v2.0 first commercial version fall 1999 • TOMLAB starting sales from web site March 2000 • TOMLAB v3.0 expanded with external solvers /SOL spring 2001 • Dash Optimization Ltd’s XpressMP added in TOMLAB fall 2001 • Tomlab Optimization Inc.
    [Show full text]
  • COSMO: a Conic Operator Splitting Method for Convex Conic Problems
    COSMO: A conic operator splitting method for convex conic problems Michael Garstka∗ Mark Cannon∗ Paul Goulart ∗ September 10, 2020 Abstract This paper describes the Conic Operator Splitting Method (COSMO) solver, an operator split- ting algorithm for convex optimisation problems with quadratic objective function and conic constraints. At each step the algorithm alternates between solving a quasi-definite linear sys- tem with a constant coefficient matrix and a projection onto convex sets. The low per-iteration computational cost makes the method particularly efficient for large problems, e.g. semidefi- nite programs that arise in portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to ef- fectively exploit sparsity in large, structured semidefinite programs. A number of benchmarks against other state-of-the-art solvers for a variety of problems show the effectiveness of our approach. Our Julia implementation is open-source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem. 1 Introduction We consider convex optimisation problems in the form minimize f(x) subject to gi(x) 0; i = 1; : : : ; l (1) h (x)≤ = 0; i = 1; : : : ; k; arXiv:1901.10887v2 [math.OC] 9 Sep 2020 i where we assume that both the objective function f : Rn R and the inequality constraint n ! functions gi : R R are convex, and that the equality constraints hi(x) := ai>x bi are ! − affine. We will denote an optimal solution to this problem (if it exists) as x∗. Convex optimisa- tion problems feature heavily in a wide range of research areas and industries, including problems ∗The authors are with the Department of Engineering Science, University of Oxford, Oxford, OX1 3PJ, UK.
    [Show full text]
  • Introduction to Mosek
    Introduction to Mosek Modern Optimization in Energy, 28 June 2018 Micha l Adamaszek www.mosek.com MOSEK package overview • Started in 1999 by Erling Andersen • Convex conic optimization package + MIP • LP, QP, SOCP, SDP, other nonlinear cones • Low-level optimization API • C, Python, Java, .NET, Matlab, R, Julia • Object-oriented API Fusion • C++, Python, Java, .NET • 3rd party • GAMS, AMPL, CVXOPT, CVXPY, YALMIP, PICOS, GPkit • Conda package, .NET Core package • Upcoming v9 1 / 10 Example: 2D Total Variation Someone sends you the left signal but you receive noisy f (right): How to denoise/smoothen out/approximate u? P 2 P 2 minimize ij(ui;j − ui+1;j) + ij(ui;j − ui;j+1) P 2 subject to ij(ui;j − fi;j) ≤ σ: 2 / 10 Conic problems A conic problem in canonical form: min cT x s:t: Ax + b 2 K where K is a product of cones: • linear: K = R≥0 • quadratic: q n 2 2 K = fx 2 R : x1 ≥ x2 + ··· + xng • semidefinite: n×n T K = fX 2 R : X = FF g 3 / 10 Conic problems, cont. • exponential cone: 3 K = fx 2 R : x1 ≥ x2 exp(x3=x2); x2 > 0g • power cone: 3 p−1 p K = fx 2 R : x1 x2 ≥ jx3j ; x1; x2 ≥ 0g; p > 1 q 2 2 2 x1 ≥ x2 + x3; 2x1x2 ≥ x3 x1 ≥ x2 exp(x3=x2) 4 / 10 Conic representability Lots of functions and constraints are representable using these cones. T jxj; kxk1; kxk2; kxk1; kAx + bk2 ≤ c x + d !1=p 1 X xy ≥ z2; x ≥ ; x ≥ yp; t ≥ jx jp = kxk y i p i p 1=n t ≤ xy; t ≤ (x1 ··· xn) ; geometric programming (GP) X 1 t ≤ log x; t ≥ ex; t ≤ −x log x; t ≥ log exi ; t ≥ log 1 + x i 1=n det(X) ; t ≤ λmin(X); t ≥ λmax(X) T T convex (1=2)x Qx + c x + q 5 / 10 Challenge Find a • natural, • practical, • important, • convex optimization problem, which cannot be expressed in conic form.
    [Show full text]
  • AJINKYA KADU 503, Hans Freudenthal Building, Budapestlaan 6, 3584 CD Utrecht, the Netherlands
    AJINKYA KADU 503, Hans Freudenthal Building, Budapestlaan 6, 3584 CD Utrecht, The Netherlands Curriculum Vitae Last Updated: Oct 15, 2018 Contact Ph.D. Student +31{684{544{914 Information Mathematical Institute [email protected] Utrecht University https://ajinkyakadu125.github.io Education Mathematical Institute, Utrecht University, The Netherlands 2015 - present Ph.D. Candidate, Numerical Analysis and Scientific Computing • Dissertation Topic: Discrete Seismic Tomography • Advisors: Dr. Tristan van Leeuwen, Prof. Wim Mulder, Prof. Joost Batenburg • Interests: Seismic Imaging, Computerized Tomography, Numerical Optimization, Level-Set Method, Total-variation, Convex Analysis, Signal Processing Indian Institute of Technology Bombay, Mumbai, India 2010 - 2015 Bachelor and Master of Technology, Department of Aerospace Engineering • Advisors: Prof. N. Hemachandra, Prof. R. P. Shimpi • GPA: 8.7/10 (Specialization: Operations Research) Work Mitsubishi Electric Research Labs, Cambridge, MA, USA May - Oct, 2018 Experience • Mentors: Dr. Hassan Mansour, Dr. Petros Boufounos • Worked on inverse scattering problem arising in ground penetrating radar. University of British Columbia, Vancouver, Canada Jan - Apr, 2016 • Mentors: Prof. Felix Herrmann, Prof. Eldad Haber • Worked on development of framework for large-scale inverse problems in geophysics. Rediff.com Pvt. Ltd., Mumbai, India May - July, 2014 • Mentor: A. S. Shaja • Worked on the development of data product `Stock Portfolio Match' based on Shiny & R. Honeywell Technology Solutions, Bangalore, India May - July, 2013 • Mentors: Kartavya Mohan Gupta, Hanumantha Rao Desu • Worked on integration bench for General Aviation(GA) to recreate flight test scenarios. Research: Journal • A convex formulation for Discrete Tomography. Publications Ajinkya Kadu, Tristan van Leeuwen, (submitted to) IEEE Transactions on Computational Imaging (arXiv: 1807.09196) • Salt Reconstruction in Full Waveform Inversion with a Parametric Level-Set Method.
    [Show full text]
  • Robert Fourer, David M. Gay INFORMS Annual Meeting
    AMPL New Solver Support in the AMPL Modeling Language Robert Fourer, David M. Gay AMPL Optimization LLC, www.ampl.com Department of Industrial Engineering & Management Sciences, Northwestern University Sandia National Laboratories INFORMS Annual Meeting Pittsburgh, Pennsylvania, November 5-8, 2006 Robert Fourer, New Solver Support in the AMPL Modeling Language INFORMS Annual Meeting, November 5-8, 2006 1 AMPL What it is . A modeling language for optimization A system to support optimization modeling What I’ll cover . Brief examples, briefer history Recent developments . ¾ 64-bit versions ¾ floating license manager ¾ AMPL Studio graphical interface & Windows COM objects Solver support ¾ new KNITRO 5.1 features ¾ new CPLEX 10.1 features Robert Fourer, New Solver Support in the AMPL Modeling Language INFORMS Annual Meeting, November 5-8, 2006 2 Ex 1: Airline Fleet Assignment set FLEETS; set CITIES; set TIMES circular; set FLEET_LEGS within {f in FLEETS, c1 in CITIES, t1 in TIMES, c2 in CITIES, t2 in TIMES: c1 <> c2 and t1 <> t2}; # (f,c1,t1,c2,t2) represents the availability of fleet f # to cover the leg that leaves c1 at t1 and # whose arrival time plus turnaround time at c2 is t2 param leg_cost {FLEET_LEGS} >= 0; param fleet_size {FLEETS} >= 0; Robert Fourer, New Solver Support in the AMPL Modeling Language INFORMS Annual Meeting, November 5-8, 2006 3 Ex 1: Derived Sets set LEGS := setof {(f,c1,t1,c2,t2) in FLEET_LEGS} (c1,t1,c2,t2); # the set of all legs that can be covered by some fleet set SERV_CITIES {f in FLEETS} := union {(f,c1,c2,t1,t2)
    [Show full text]
  • Julia: a Modern Language for Modern ML
    Julia: A modern language for modern ML Dr. Viral Shah and Dr. Simon Byrne www.juliacomputing.com What we do: Modernize Technical Computing Today’s technical computing landscape: • Develop new learning algorithms • Run them in parallel on large datasets • Leverage accelerators like GPUs, Xeon Phis • Embed into intelligent products “Business as usual” will simply not do! General Micro-benchmarks: Julia performs almost as fast as C • 10X faster than Python • 100X faster than R & MATLAB Performance benchmark relative to C. A value of 1 means as fast as C. Lower values are better. A real application: Gillespie simulations in systems biology 745x faster than R • Gillespie simulations are used in the field of drug discovery. • Also used for simulations of epidemiological models to study disease propagation • Julia package (Gillespie.jl) is the state of the art in Gillespie simulations • https://github.com/openjournals/joss- papers/blob/master/joss.00042/10.21105.joss.00042.pdf Implementation Time per simulation (ms) R (GillespieSSA) 894.25 R (handcoded) 1087.94 Rcpp (handcoded) 1.31 Julia (Gillespie.jl) 3.99 Julia (Gillespie.jl, passing object) 1.78 Julia (handcoded) 1.2 Those who convert ideas to products fastest will win Computer Quants develop Scientists prepare algorithms The last 25 years for production (Python, R, SAS, DEPLOY (C++, C#, Java) Matlab) Quants and Computer Compress the Scientists DEPLOY innovation cycle collaborate on one platform - JULIA with Julia Julia offers competitive advantages to its users Julia is poised to become one of the Thank you for Julia. Yo u ' v e k i n d l ed leading tools deployed by developers serious excitement.
    [Show full text]
  • Open Source Tools for Optimization in Python
    Open Source Tools for Optimization in Python Ted Ralphs Sage Days Workshop IMA, Minneapolis, MN, 21 August 2017 T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Outline 1 Introduction 2 COIN-OR 3 Modeling Software 4 Python-based Modeling Tools PuLP/DipPy CyLP yaposib Pyomo T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Outline 1 Introduction 2 COIN-OR 3 Modeling Software 4 Python-based Modeling Tools PuLP/DipPy CyLP yaposib Pyomo T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Caveats and Motivation Caveats I have no idea about the background of the audience. The talk may be either too basic or too advanced. Why am I here? I’m not a Sage developer or user (yet!). I’m hoping this will be a chance to get more involved in Sage development. Please ask lots of questions so as to guide me in what to dive into! T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Mathematical Optimization Mathematical optimization provides a formal language for describing and analyzing optimization problems. Elements of the model: Decision variables Constraints Objective Function Parameters and Data The general form of a mathematical optimization problem is: min or max f (x) (1) 8 9 < ≤ = s.t. gi(x) = bi (2) : ≥ ; x 2 X (3) where X ⊆ Rn might be a discrete set. T.K. Ralphs (Lehigh University) Open Source Optimization August 21, 2017 Types of Mathematical Optimization Problems The type of a mathematical optimization problem is determined primarily by The form of the objective and the constraints.
    [Show full text]
  • Benchmarks for Current Linear and Mixed Integer Optimization Solvers
    ACTA UNIVERSITATIS AGRICULTURAE ET SILVICULTURAE MENDELIANAE BRUNENSIS Volume 63 207 Number 6, 2015 http://dx.doi.org/10.11118/actaun201563061923 BENCHMARKS FOR CURRENT LINEAR AND MIXED INTEGER OPTIMIZATION SOLVERS Josef Jablonský1 1 Department of Econometrics, Faculty of Informatics and Statistics, University of Economics, Prague, nám. W. Churchilla 4, 130 67 Praha 3, Czech Republic Abstract JABLONSKÝ JOSEF. 2015. Benchmarks for Current Linear and Mixed Integer Optimization Solvers. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 63(6): 1923–1928. Linear programming (LP) and mixed integer linear programming (MILP) problems belong among very important class of problems that fi nd their applications in various managerial consequences. The aim of the paper is to discuss computational performance of current optimization packages for solving large scale LP and MILP optimization problems. Current market with LP and MILP solvers is quite extensive. Probably among the most powerful solvers GUROBI 6.0, IBM ILOG CPLEX 12.6.1, and XPRESS Optimizer 27.01 belong. Their attractiveness for academic research is given, except their computational performance, by their free availability for academic purposes. The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of diff erent hardness (easy, hard, and not solved). Keywords: benchmark, linear programming, mixed integer linear programming, optimization, solver INTRODUCTION with integer variables need not be solved even Solving linear and mixed integer linear in case of a very small size of the given problem. optimization problems (LP and MILP) that Real-world optimization problems have usually belong to one of the most o en modelling tools, many thousands of variables and/or constraints.
    [Show full text]
  • Insight MFR By
    Manufacturers, Publishers and Suppliers by Product Category 11/6/2017 10/100 Hubs & Switches ASCEND COMMUNICATIONS CIS SECURE COMPUTING INC DIGIUM GEAR HEAD 1 TRIPPLITE ASUS Cisco Press D‐LINK SYSTEMS GEFEN 1VISION SOFTWARE ATEN TECHNOLOGY CISCO SYSTEMS DUALCOMM TECHNOLOGY, INC. GEIST 3COM ATLAS SOUND CLEAR CUBE DYCONN GEOVISION INC. 4XEM CORP. ATLONA CLEARSOUNDS DYNEX PRODUCTS GIGAFAST 8E6 TECHNOLOGIES ATTO TECHNOLOGY CNET TECHNOLOGY EATON GIGAMON SYSTEMS LLC AAXEON TECHNOLOGIES LLC. AUDIOCODES, INC. CODE GREEN NETWORKS E‐CORPORATEGIFTS.COM, INC. GLOBAL MARKETING ACCELL AUDIOVOX CODI INC EDGECORE GOLDENRAM ACCELLION AVAYA COMMAND COMMUNICATIONS EDITSHARE LLC GREAT BAY SOFTWARE INC. ACER AMERICA AVENVIEW CORP COMMUNICATION DEVICES INC. EMC GRIFFIN TECHNOLOGY ACTI CORPORATION AVOCENT COMNET ENDACE USA H3C Technology ADAPTEC AVOCENT‐EMERSON COMPELLENT ENGENIUS HALL RESEARCH ADC KENTROX AVTECH CORPORATION COMPREHENSIVE CABLE ENTERASYS NETWORKS HAVIS SHIELD ADC TELECOMMUNICATIONS AXIOM MEMORY COMPU‐CALL, INC EPIPHAN SYSTEMS HAWKING TECHNOLOGY ADDERTECHNOLOGY AXIS COMMUNICATIONS COMPUTER LAB EQUINOX SYSTEMS HERITAGE TRAVELWARE ADD‐ON COMPUTER PERIPHERALS AZIO CORPORATION COMPUTERLINKS ETHERNET DIRECT HEWLETT PACKARD ENTERPRISE ADDON STORE B & B ELECTRONICS COMTROL ETHERWAN HIKVISION DIGITAL TECHNOLOGY CO. LT ADESSO BELDEN CONNECTGEAR EVANS CONSOLES HITACHI ADTRAN BELKIN COMPONENTS CONNECTPRO EVGA.COM HITACHI DATA SYSTEMS ADVANTECH AUTOMATION CORP. BIDUL & CO CONSTANT TECHNOLOGIES INC Exablaze HOO TOO INC AEROHIVE NETWORKS BLACK BOX COOL GEAR EXACQ TECHNOLOGIES INC HP AJA VIDEO SYSTEMS BLACKMAGIC DESIGN USA CP TECHNOLOGIES EXFO INC HP INC ALCATEL BLADE NETWORK TECHNOLOGIES CPS EXTREME NETWORKS HUAWEI ALCATEL LUCENT BLONDER TONGUE LABORATORIES CREATIVE LABS EXTRON HUAWEI SYMANTEC TECHNOLOGIES ALLIED TELESIS BLUE COAT SYSTEMS CRESTRON ELECTRONICS F5 NETWORKS IBM ALLOY COMPUTER PRODUCTS LLC BOSCH SECURITY CTC UNION TECHNOLOGIES CO FELLOWES ICOMTECH INC ALTINEX, INC.
    [Show full text]