highly-constrained non-convex optimization and uncertainty quantification
mystic framework provides a collection of optimization algorithms
and tools that allows the user to more robustly (and easily) solve hard
optimization problems. All optimization algorithms included in
provide workflow at the fitting layer, not just access to the algorithms
as function calls.
mystic gives the user fine-grained power to both
monitor and steer optimizations as the fit processes are running.
Optimizers can advance one iteration with
Step, or run to completion
Solve. Users can customize optimizer stop conditions, where both
compound and user-provided conditions may be used. Optimizers can save
state, can be reconfigured dynamically, and can be restarted from a
saved solver or from a results file. All solvers can also leverage
parallel computing, either within each iteration or as an ensemble of
mystic optimizers share a common interface, and thus can
be easily swapped without the user having to write any new code.
solvers all conform to a solver API, thus also have common method calls
to configure and launch an optimization job. For more details, see
mystic.abstract_solver. The API also makes it easy to bind a favorite
3rd party solver into the
Optimization algorithms in
mystic can accept parameter constraints,
either in the form of penaties (which “penalize” regions of solution
space that violate the constraints), or as constraints (which “constrain”
the solver to only search in regions of solution space where the
the constraints are respected), or both.
mystic provides a large
selection of constraints, including probabistic and dimensionally
reducing constraints. By providing a robust interface designed to
enable the user to easily configure and control solvers,
greatly reduces the barrier to solving hard optimization problems.
mystic is in active development, so any user feedback, bug reports, comments,
or suggestions are highly appreciated. A list of known issues is maintained
at http://trac.mystic.cacr.caltech.edu/project/mystic/query, with a public
ticket list at https://github.com/uqfoundation/mystic/issues.
mystic provides a stock set of configurable, controllable solvers with:
- a common interface - a control handler with: pause, continue, exit, and callback - ease in selecting initial population conditions: guess, random, etc - ease in checkpointing and restarting from a log or saved state - the ability to leverage parallel & distributed computing - the ability to apply a selection of logging and/or verbose monitors - the ability to configure solver-independent termination conditions - the ability to impose custom and user-defined penalties and constraints
To get up and running quickly,
mystic also provides infrastructure to:
- easily generate a model (several standard test models are included) - configure and auto-generate a cost function from a model
This version is
The latest released version of
mystic is available from:
mystic is distributed under a 3-clause BSD license.
>>> import mystic >>> print (mystic.license())
You can get the latest development version with all the shiny new features at:
If you have a new contribution, please submit a pull request.
mystic is packaged to install from source, so you must
download the tarball, unzip, and run the installer:
[download] $ tar -xvzf mystic-0.3.0.tgz $ cd mystic-0.3.0 $ python setup py build $ python setup py install
You will be warned of any missing dependencies and/or settings
after you run the “build” step above.
mystic depends on
sympy, so you should install them first. There are several
scipy is used if it is available;
scipy is an optional dependency. Having
is necessary for running several of the examples, and you should
probably go get it even though it’s not required.
matplotlib is required
for results visualization available in the scripts packaged with
mystic can be installed with
$ pip install mystic
- python, version >= 2.6, version < 3.0 - numpy, version >= 1.0 - sympy, version >= 0.6.7 - dill, version >= 0.2.5 - klepto, version >= 0.1.2
- setuptools, version >= 0.6 - matplotlib, version >= 0.91 - scipy, version >= 0.6.0 - pathos, version >= 0.2.0 - pyina, version >= 0.2a1.dev0
Probably the best way to get started is to look at the tests and
examples provided within
for a set of scripts that demonstrate the configuration and launching of
optimization jobs for one of the sample models in
Many of the included examples are standard optimization test problems.
The source code is also generally well documented, so further questions
may be resolved by inspecting the code itself. Please also feel free to
submit a ticket on github, or ask a question on stackoverflow (@Mike McKerns).
mystic is an active research tool. There are a growing number of publications
and presentations that discuss real-world examples and new features of
in greater detail than presented in the user’s guide. If you would like to
share how you use
mystic in your work, please post a link or send an email
(to mmckerns at uqfoundation dot org).
Instructions on building a new model are in
mystic provides base classes for two types of models:
- `AbstractFunction` [evaluates `f(x)` for given evaluation points `x`] - `AbstractModel` [generates `f(x,p)` for given coefficients `p`]
mystic also provides some convienence functions to help you build a
model instance and a cost function instance on-the-fly. For more
mystic.forward_model. It is, however, not necessary
to use base classes or the model builder in building your own model or
cost function, as any standard python function can be used as long as it
meets the basic
AbstractFunction interface of
cost = f(x).
mystic solvers are highly configurable, and provide a robust set of
methods to help customize the solver for your particular optimization
problem. For each solver, a minimal (
scipy.optimize) interface is also
provided for users who prefer to configure and launch their solvers as a
single function call. For more information, see
for the solver API, and each of the individual solvers for their minimal
mystic enables solvers to use parallel computing whenever the user provides
a replacement for the (serial) python
mystic includes a
mystic.python_map that mirrors the behavior of the
map, and a
mystic.pools that provides
functions using the
solvers are designed to utilize distributed and parallel tools provided by
pathos package. For more information, see
mystic.abstract_ensemble_solver, and the
pathos documentation at
Important classes and functions are found here:
- `mystic.solvers` [solver optimization algorithms] - `mystic.termination` [solver termination conditions] - `mystic.strategy` [solver population mutation strategies] - `mystic.monitors` [optimization monitors] - `mystic.symbolic` [symbolic math in constaints] - `mystic.constraints` [constraints functions] - `mystic.penalty` [penalty functions] - `mystic.collapse` [checks for dimensional collapse] - `mystic.coupler` [decorators for function coupling] - `mystic.pools` [parallel worker pool interface] - `mystic.munge` [file readers and writers] - `mystic.scripts` [model and convergence plotting] - `mystic.support` [hypercube measure support plotting] - `mystic.forward_model` [cost function generator] - `mystic.tools` [constraints, wrappers, and other tools] - `mystic.cache` [results caching and archiving] - `mystic.models` [models and test functions] - `mystic.math` [mathematical functions and tools]
Important functions within
mystic.math are found here:
- `mystic.math.Distribution` [a sampling distribution object] - `mystic.math.legacydata` [classes for legacy data observations] - `mystic.math.discrete` [classes for discrete measures] - `mystic.math.measures` [tools to support discrete measures] - `mystic.math.approx` [tools for measuring equality] - `mystic.math.grid` [tools for generating points on a grid] - `mystic.math.distance` [tools for measuring distance and norms] - `mystic.math.poly` [tools for polynomial functions] - `mystic.math.samples` [tools related to sampling] - `mystic.math.integrate` [tools related to integration] - `mystic.math.stats` [tools related to distributions]
Solver and model API definitions are found here:
- `mystic.abstract_solver` [the solver API definition] - `mystic.abstract_map_solver` [the parallel solver API] - `mystic.abstract_ensemble_solver` [the ensemble solver API] - `mystic.models.abstract_model` [the model API definition]
mystic also provides several convience scripts that are used to visualize
models, convergence, and support on the hypercube. These scripts are installed
to a directory on the user’s $PATH, and thus can be run from anywhere:
- `mystic_log_reader.py` [parameter and cost convergence] - `mystic_collapse_plotter.py` [convergence and dimensional collapse] - `mystic_model_plotter.py` [model surfaces and solver trajectories] - `support_convergence.py` [convergence plots for measures] - `support_hypercube.py` [parameter support on the hypercube] - `support_hypercube_measures.py` [measure support on the hypercube] - `support_hypercube_scenario.py` [scenario support on the hypercube]
--help as an argument to any of the above scripts will print out an
instructive help message.
If you use
mystic to do research that leads to publication, we ask that you
acknowledge use of
mystic by citing the following in your publication:
M.M. McKerns, L. Strand, T. Sullivan, A. Fang, M.A.G. Aivazis, "Building a framework for predictive science", Proceedings of the 10th Python in Science Conference, 2011; http://arxiv.org/pdf/1202.1056 Michael McKerns, Patrick Hung, and Michael Aivazis, "mystic: highly-constrained non-convex optimization and UQ", 2009- ; http://trac.mystic.cacr.caltech.edu/project/mystic
Please see http://trac.mystic.cacr.caltech.edu/project/mystic or http://arxiv.org/pdf/1202.1056 for further information.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|File Name & Checksum SHA256 Checksum Help||Version||File Type||Upload Date|
|mystic-0.3.0.tgz (345.8 kB) Copy SHA256 Checksum SHA256||–||Source||Nov 9, 2016|
|mystic-0.3.0.zip (563.9 kB) Copy SHA256 Checksum SHA256||–||Source||Nov 9, 2016|