World Library  
Flag as Inappropriate
Email this Article

Mosek

Article Id: WHEBN0031045557
Reproduction Date:

Title: Mosek  
Author: World Heritage Encyclopedia
Language: English
Subject: OptimJ, Sol (format), AIMMS, Nl (format), AMPL
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Mosek

MOSEK
Developer(s) MOSEK ApS
Stable release 7.0
Development status Active
Type Mathematical optimization
License Proprietary
Website .commosek

MOSEK is a software package for the solution of linear, mixed-integer linear, quadratic, mixed-integer quadratic, quadratically constraint, conic and convex nonlinear mathematical optimization problems. The emphasis in MOSEK is on solving large scale sparse problems. Particularly the interior-point optimizer for linear, conic quadratic (aka. Second-order cone programming) and semi-definite (aka. semidefinite programming) problems is very efficient. A special feature of the MOSEK interior-point optimizer is that it is based on the so-called homogeneous model which implies MOSEK can reliably detect a primal and/or dual infeasible status as documented in several published papers.[1][2][3]

In addition to the interior-point optimizer MOSEK includes:

  • Primal and dual simplex optimizer for linear problems.
  • A primal network simplex optimizer for problems with special network structure.
  • Mixed-integer optimizer for linear, quadratic and conic quadratic problems.

MOSEK provides interfaces to the C, C#, Java and Python languages. Most major modeling systems are made compatible for MOSEK, examples are: AIMMS, AMPL, and GAMS. MOSEK can also be used from popular tools such as matlab,[4] R,[5] CVX, and YALMIP.[6]

References

  1. ^ E. D. Andersen and Y. Ye. A computational study of the homogeneous algorithm for large-scale convex optimization. Computational Optimization and Applications, 10:243–269, 1998
  2. ^ E. D. Andersen and K. D. Andersen. The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm.In H. Frenk, K. Roos, T. Terlaky, and S. Zhang, editors, High Performance Optimization, pages 197–232. Kluwer Academic Publishers, 2000
  3. ^ E. D. Andersen, C. Roos, and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Programming, 95(2), February 2003
  4. ^ http://docs.mosek.com/7.0/toolbox/
  5. ^ https://r-forge.r-project.org/projects/rmosek/ Rmosek
  6. ^ MOSEK @ Yalmip homepage

External links

  • Mosek licensing options
    • 30-days trial license
    • Academic license


This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 



Copyright © World Library Foundation. All rights reserved. eBooks from World Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.