Mosek
MOSEK is a tool for solving mathematical optimization problems. Some examples of problems MOSEK can solve are linear programs, quadratic programs, conic problems and mixed integer problems. Such problems occurs frequently in Financial applications e.g. portfolio management, Supply chain management, Analog chip design, Forestry and farming, Medical and hospital management, Power supply and network planning, Logistics, TV commercial scheduling, Structural engineering. Due the strengths of the linear and conic optimizers in MOSEK, then MOSEK is currently employed widely in the financial industry. MOSEK has also been employed extensively in energy and forestry industry due to its powerful interior-point optimizer.
Keywords for this software
References in zbMATH (referenced in 259 articles )
Showing results 1 to 20 of 259.
Sorted by year (- Ghaddar, Bissan; Jabr, Rabih A.: Power transmission network expansion planning: a semidefinite programming branch-and-bound approach (2019)
- Ahmadi, Amir Ali; Hall, Georgina: DC decomposition of nonconvex polynomials with algebraic techniques (2018)
- Armstrong, John; Pennanen, Teemu; Rakwongwan, Udomsak: Pricing index options by static hedging under finite liquidity (2018)
- Aßmann, Denis; Liers, Frauke; Stingl, Michael; Vera, Juan C.: Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations (2018)
- Bonafini, M.: Convex relaxation and variational approximation of the Steiner problem: theory and numerics (2018)
- Dal Col, Laura; Tarbouriech, Sophie; Zaccarian, Luca: $\mathcal H_\infty$ control design for synchronisation of identical linear multi-agent systems (2018)
- El Karoui, Noureddine; Purdom, Elizabeth: Can we trust the bootstrap in high-dimensions? The case of linear models (2018)
- Filip, Silviu-Ioan; Nakatsukasa, Yuji; Trefethen, Lloyd N.; Beckermann, Bernhard: Rational minimax approximation via adaptive barycentric representations (2018)
- Goluskin, David: Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (2018)
- Guigues, Vincent; Krätschmer, Volker; Shapiro, Alexander: A central limit theorem and hypotheses testing for risk-averse stochastic programs (2018)
- Huang, Shimeng; Wolkowicz, Henry: Low-rank matrix completion using nuclear norm minimization and facial reduction (2018)
- Lasserre, Jean-Bernard; Magron, Victor: Optimal data fitting: a moment approach (2018)
- Park, Jaehyun; Boyd, Stephen: A semidefinite programming method for integer convex quadratic minimization (2018)
- Polcz, Péter; Péni, Tamás; Szederkényi, Gábor: Improved algorithm for computing the domain of attraction of rational nonlinear systems (2018)
- Roux, Pierre; Voronin, Yuen-Lam; Sankaranarayanan, Sriram: Validating numerical semidefinite programming solvers for polynomial invariants (2018)
- Sotirov, Renata: Graph bisection revisited (2018)
- Wang, Guanglei; Hijazi, Hassan: Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (2018)
- Weisser, Tillmann; Lasserre, Jean B.; Toh, Kim-Chuan: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (2018)
- Weldeyesus, Alemseged Gebrehiwot; Gondzio, Jacek: A specialized primal-dual interior point method for the plastic truss layout optimization (2018)
- Xu, Guanglin; Burer, Samuel: A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (2018)