TOMLAB - For fast and robust largescale optimization in MATLAB



Similar documents
An Overview Of Software For Convex Optimization. Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM

Solving convex MINLP problems with AIMMS

Introduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems

Big Data Optimization at SAS

Nonlinear Optimization: Algorithms 3: Interior-point methods

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: FILTER METHODS AND MERIT FUNCTIONS

1 Nonlinear Optimization and Tools. 2 Models and Problems

Computer Sciences Department

GAMS Productivity - Performance - Reliability

Why is SAS/OR important? For whom is SAS/OR designed?

SBB: A New Solver for Mixed Integer Nonlinear Programming

High-performance local search for planning maintenance of EDF nuclear park

REPORT DOCUMENTATION PAGE

Operations Research. Inside Class Credit Hours: 51 Prerequisite:Linear Algebra Number of students : 55 Semester: 2 Credit: 3

Cloud Branching. Timo Berthold. joint work with Domenico Salvagnin (Università degli Studi di Padova)

A Server for Automated Performance Analysis of Benchmarking Data

Performance of Optimization Software - an Update

The Master s Degree with Thesis Course Descriptions in Industrial Engineering

Optimization applications in finance, securities, banking and insurance

Global Optimization with GAMS/LGO Introduction, Usage, and Applications

The Gurobi Optimizer

Fundamentals and Recent Developments of the GAMS System

Variable Neighbourhood Search for the Global Optimization of Constrained NLPs

A Simple Introduction to Support Vector Machines

Nonlinear Programming Methods.S2 Quadratic Programming

Timber Harvest Scheduling (Tactical planning)

Open-source Quality Assurance and Performance Analysis Tools

International Journal of Software and Web Sciences (IJSWS)

Mixed Integer Linear Programming in R

Chapter 13: Binary and Mixed-Integer Programming

Advances in Convex Optimization: Interior-point Methods, Cone Programming, and Applications

Using the analytic center in the feasibility pump

BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION

Introduction to Process Optimization

Introduction to Linear Programming (LP) Mathematical Programming (MP) Concept

New and Forthcoming Developments in the AMPL Modeling Language & System

Web-Based Economic Optimization Tools for Reducing Operating Costs

Index tracking UNDER TRANSACTION COSTS:

An Introduction on SemiDefinite Program

Minimizing costs for transport buyers using integer programming and column generation. Eser Esirgen

Simplified Benders cuts for Facility Location

Multiple Solutions of Mixed Variable Optimization by Multistart Hooke and Jeeves Filter Method

Solving Very Large Financial Planning Problems on Blue Gene

Summer course on Convex Optimization. Fifth Lecture Interior-Point Methods (1) Michel Baes, K.U.Leuven Bharath Rangarajan, U.

2.3 Convex Constrained Optimization Problems

A server for automated performance analysis of benchmarking data

Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling

Improving Market Clearing Software Performance to Meet Existing and Future Challenges MISO s Perspective

Solving Method for a Class of Bilevel Linear Programming based on Genetic Algorithms

MEng, BSc Applied Computer Science

Zentrum für Technomathematik

Using diversification, communication and parallelism to solve mixed-integer linear programs

Solving polynomial least squares problems via semidefinite programming relaxations

Optimization Modeling for Mining Engineers

Solving NP Hard problems in practice lessons from Computer Vision and Computational Biology

MEng, BSc Computer Science with Artificial Intelligence

Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation

Support Vector Machines

Optimization - Elements of Calculus - Basics of constrained and unconstrained optimization

A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik

GAMS, Condor and the Grid: Solving Hard Optimization Models in Parallel. Michael C. Ferris University of Wisconsin

LocalSolver: black-box local search for combinatorial optimization

Software that writes Software Stochastic, Evolutionary, MultiRun Strategy Auto-Generation. TRADING SYSTEM LAB Product Description Version 1.

OpenFOAM Optimization Tools

Network Optimization using AIMMS in the Analytics & Visualization Era

Optimization Methods in Finance

Interior Point Methods and Linear Programming

Evolutionary Algorithms Software

Large Neighborhood Search beyond MIP

Real-Time Embedded Convex Optimization

Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs

Large-Scale Similarity and Distance Metric Learning

Introduction to MATLAB Gergely Somlay Application Engineer

ILOG AMPL CPLEX System Version 10.0 User s Guide. Standard (Command-line) Version Including CPLEX Directives

Interior-Point Algorithms for Quadratic Programming

Simplex method summary

Operations Research and Financial Engineering. Courses

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

On Minimal Valid Inequalities for Mixed Integer Conic Programs

Big Data - Lecture 1 Optimization reminders

OPTIMIZED STAFF SCHEDULING AT SWISSPORT

Instituto Superior Técnico Masters in Civil Engineering. Lecture 2: Transport networks design and evaluation Xpress presentation - Laboratory work

How the European day-ahead electricity market works

Parallel & Distributed Optimization. Based on Mark Schmidt s slides

Airport Planning and Design. Excel Solver

Massive Data Classification via Unconstrained Support Vector Machines

Dual Methods for Total Variation-Based Image Restoration

CPLEX Tutorial Handout

A progressive method to solve large-scale AC Optimal Power Flow with discrete variables and control of the feasibility

Investigation and Application of Multi-Disciplinary Optimization for. Automotive Body-in-White Development

Matpower 4.1 User s Manual

Number of hours in the semester L Ex. Lab. Projects SEMESTER I 1. Economy Philosophy Mathematical Analysis Exam

Resource Allocation Modeling Techniques Applied to Air Force Crew Scheduling Problem

Conic optimization: examples and software

Construction of Risk-Averse Enhanced Index Funds

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

Isight Design Optimization Methodologies. Dr. Alex Van der Velden, Director, SIMULIA Dr. Pat Koch, Manager, SIMULIA

Solving Large Scale Optimization Problems via Grid and Cluster Computing

Transcription:

The TOMLAB Optimization Environment is a powerful optimization and modeling package for solving applied optimization problems in MATLAB. TOMLAB provides a wide range of features, tools and services for your solution process: A uniform approach to solving optimization problem. A modeling class, tomsym, for lightning fast source transformation. Automatic gateway routines for format mapping to different solver types. Over 100 different algorithms for linear, discrete, global and nonlinear optimization. A large number of fully integrated Fortran and C solvers. Full integration with the MAD toolbox for automatic differentiation. 6 different methods for numerical differentiation. Unique features, like costly global black-box optimization and semi-definite programming with bilinear inequalities. Demo licenses with no solver limitations. Call compatibility with MathWorks Optimization Toolbox. Very extensive example problem sets, more than 700 models. Advanced support by our team of developers in Sweden and the USA. TOMLAB is available for all MATLAB R2007b+ users. Continuous solver upgrades and customized implementations. Embedded solvers and stand-alone applications. Easy installation for all supported platforms, Windows (32/64-bit) and Linux/OS X 64-bit For more information, see http://tomopt.com or e-mail tomlab@tomopt.com. Modeling Environment: http://tomsym.com. Dedicated Optimal Control Page: http://tomdyn.com.

The TOMLAB Product Family TOMLAB /BASE v8.0 - Now with a symbolic modeling engine! The TOMLAB Base Module includes 32 solvers for a wide variety of problem types, routines for problem setup and analysis, sparse and dense solvers for global optimization, linear/nonlinear least squares and nonlinear programming are also included. Most popular features include: Tlsqr: Large-scale sparse linear least squares. glccluster: Mixed-integer nonlinear global optimization. glcdirect: Modified C implementation of the DIRECT method. PDCO: Primal-dual barrier method for convex objectives, handles linear constraints. slssolve: Sparse least squares with nonlinear constraints. Linear, Mixed-Integer, Quadratic, Mixed-Integer Quadratic Programming. Mixed-Integer Quadratic with Quadratic Constraints. TOMLAB /GUROBI v5.6 GUROBI Optimizations groundbreaking suite for parallel mixed-integer programming. TOMLAB /CPLEX v12.5 ILOG s state-of-the-art CPLEX simplex and barrier LP, QP, MIP, MIPQ and MIQQ solvers. Supports logical constraints. The TOMLAB package gives the MATLAB user full control of this powerful suite. Parallell processing on up to 64 processors is possible.

Nonlinear Programming TOMLAB /CONOPT v3.1 Large-scale nonlinear solver with a feasible path GRG method. Developed in cooperation with Arki Consulting and Development A/S. TOMLAB /MINOS v8.0 nonlinear programming (MINOS), and dense LP and QP (LPOPT, QPOPT). TOMLAB /SNOPT v8.0 nonlinear programming (SNOPT, MINOS), and sparse or dense LP and QP (LPOPT, QPOPT, SQOPT). TOMLAB /NPSOL v8.0 nonlinear programming (NPSOL, MINOS) dense LP and QP (LPOPT, QPOPT), and linear and nonlinear least squares (LSSOL, NLSSOL) problems. Global Optimization TOMLAB /CGO v8.0 Toolbox for costly optimization. The solvers handle mixed-integer global nonconvex problems with CPU-intensive objective functions and constraints. TOMLAB /LGO Integrated solver suite for general constrained (global and local) optimization. LGO solver options include branch-and-bound, adaptive stochastic global search, stochastic multistart based global search, and reduced gradient local search modules. LGO is developed and maintained by Pintér Consulting Service, Inc. TOMLAB /GENO Toolbox for genetic and evolutionary optimization. The solver handles uni- and multi-objective optimization problems.

Mixed-Integer Nonlinear Programming TOMLAB /MINLP v1.5 Sparse and dense versions of solvers BQPD for QP, Filter SQP for nonlinear programming, MIQP bb for MIQP and MINLP bb for mixed-integer nonlinear programming. Developed by Fletcher and Leyffer, University of Dundee, Scotland. TOMLAB /OQNLP Multistart heuristic algorithm to find global optima of smooth constrained nonlinear programs and mixed-integer nonlinear programs, in cooperation with Optimal Methods, Inc. TOMLAB /KNITRO v9.0 Industy-standard sparse nonlinear interior point solver efficiently integrated in TOMLAB. KNITRO implements a novel algorithm for nonlinear programming. The algorithm belongs to the class of interior or barrier methods, and uses trust regions to promote convergence. And active-set solver is also included. All solver algorithms can be used to solve MPEC problems. The latest version also support MINLP problem with two alternative methods. Semidefinite Programming TOMLAB /PENSDP v2.0 /PENBMI v2.0 Solver from PENOPT GbR for semidefinite programming. The solvers handle linear objectives with linear matrix inequality constraints (LMI). PENBMI also handles bilinear matrix inequalities (BMI). Multi-Objective Optimization TOMLAB /NLPQL v2.7 Klaus Schittkowski s package for multi criteria optimization and nonlinear fitting problems. The package includes a dense SQP solver (NLPQLP), an interface suite for multi criteria optimization (NLPJOB) and a solver for nonlinear data fitting problems (DFNLP). Optimal Control TOMLAB /PROPT TOMLAB-integrated platform for optimal control. The system uses the symbolic modeling engine tomsym and automatically generates m-file code, two levels of derivatives, sparsity patterns and more to achieve superior performance. See this link for more information: http://tomdyn.com.

Geometric Programming TOMLAB /GP A powerful package for geometric programming. Specialized tools are needed for these problem types as the optimum is commonly non-differentiable. The solver uses an efficient interior-point algorithm in the solution process. Automatic Differentiation TOMLAB /MAD A powerful package for automatic differentiation in MATLAB. The system includes a full TOMLAB integration and a stand-alone version of MAD. The system is maintained in cooperation with Cranfield University. Other products TOMLAB /AMPL v2.0 Problems formulated in AMPL can be solved in TOMLAB. The interface detects problem type, and assign the problem to the appropriate TOMLAB structure. The pre-defined problem types are: LP, MILP, QP, MIQP, NLP and MINLP.