optimalportfolios

Name	optimalportfolios JSON
Version	3.4.1 JSON
	download
home_page	https://github.com/ArturSepp/OptimalPortfolios
Summary	Implementation of optimisation analytics for constructing and backtesting optimal portfolios in Python
upload_time	2025-08-03 10:11:55
maintainer	None
docs_url	None
author	Artur Sepp
requires_python	>=3.8
license	GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. <one line to give the program's name and a brief idea of what it does.> Copyright (C) <year> <name of author> This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>. Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: <program> Copyright (C) <year> <name of author> This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see <https://www.gnu.org/licenses/>. The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read <https://www.gnu.org/licenses/why-not-lgpl.html>.
keywords	portfolio optimization quantitative finance optimal portfolios mean variance optimization risk budgeting portfolio backtesting financial optimization asset allocation portfolio analytics maximum diversification equal risk contribution minimum variance systematic strategies investment strategies covariance estimation ewma lasso regularization
VCS
bugtrack_url
requirements	numba numpy scipy statsmodels pandas matplotlib seaborn openpyxl PyYAML easydev pyarrow fsspec yfinance pandas-datareader cvxpy ecos quadprog scikit-learn qis
Travis-CI	No Travis.
coveralls test coverage	No coveralls.

            # 🚀 **Optimal Portfolios Construction and Backtesting: optimalportfolios**

> optimalportfolios package implements analytics for constructing and backtesting of multi-asset portfolios using risk-return maximization, risk budgeting, and similar optimal portfolio construction methods

---

| 📊 Metric | 🔢 Value |
|-----------|----------|
| PyPI Version | ![PyPI](https://img.shields.io/pypi/v/optimalportfolios?style=flat-square) |
| Python Versions | ![Python](https://img.shields.io/pypi/pyversions/optimalportfolios?style=flat-square) |
| License | ![License](https://img.shields.io/github/license/ArturSepp/OptimalPortfolios.svg?style=flat-square)|


### 📈 Package Statistics

| 📊 Metric | 🔢 Value |
|-----------|----------|
| Total Downloads | [![Total](https://pepy.tech/badge/optimalportfolios)](https://pepy.tech/project/optimalportfolios) |
| Monthly | ![Monthly](https://pepy.tech/badge/optimalportfolios/month) |
| Weekly | ![Weekly](https://pepy.tech/badge/optimalportfolios/week) |
| GitHub Stars | ![GitHub stars](https://img.shields.io/github/stars/ArturSepp/OptimalPortfolios?style=flat-square&logo=github) |
| GitHub Forks | ![GitHub forks](https://img.shields.io/github/forks/ArturSepp/OptimalPortfolios?style=flat-square&logo=github) |


## **Optimal Portfolios Backtester** <a name="analytics"></a>
optimalportfolios package implements analytics for backtesting of optimal portfolios including:
1. Computing of inputs (covariance matrices, returns) for roll forward
computations (to avoid hindsight bias) and for generation of rolling optimal portfolios
2. Implementation of core optimisation solvers:
   1. Minimum variance
   2. Maximum quadratic utility
   3. Budgeted risk contribution (risk parity for equal budgets)
   4. Maximum diversification
   5. Maximum Sharpe ratio
   6. Maximum Cara utility under Gaussian mixture model
   7. Tracking error minimisation 
3. Rolling portfolio optimisation methods are compatible with incomplete time series
for roll forward analysis so that the portfolio universe can include instruments with different price histories

No pre-filtering of universe prices is necessary as rolling optimisers will detect 
eligeble assets when their variances and covariances are available for 
inclusion into time-t allocation set

4. Computing performances of simulated portfolios
5. Reporting of backtested portfolios and cross-sectional analysis



OptimalPortfolios package is split into 5 main modules with the 
dependecy path increasing sequentially as follows.

1. ```optimisation``` with sub-package ```solvers``` contains implementation of
various quadratic and nonlinear solvers. Each solver is implemented 
in a module independently of other solvers.

2. ```covar_estimation``` contains implementation of rolling methods for estimating
covariance matrices using EWMA and Lasso methods.

3. ```lasso``` with sub-package ```laasso_model_estimator``` contains implementation of
lasso based estimator of covariance matrix using the methodology developed in 
paper: Sepp A., Ossa I., and Kastenholz M. (2025),
"Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios"
(https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5250221)

   
4. ```utils``` is module for auxiliary analytics, in particular

5. ```reports``` is module for computing performance statistics and performance attribution including returns, volatilities, etc.

6. ```examples.solvers``` provides example of running all implemented solvers.

### **Illustrations and examples of publicated papers** <a name="analytics"></a>

1. ```examples.crypto_allocation``` is module for computations and visualisations for  
Sepp A. (2023) "Optimal Allocation to Cryptocurrencies in Diversified Portfolios",
Risk, October 2023, 1-6, https://ssrn.com/abstract=4217841

2. ```examples.robust_optimisation_saa_taa``` is module for example of using
Hierarchical Clustering Group Lasso (HCGL) method for rolling estimation of covariance matrix and for solving Strategic Asset Allocation
using risk-budgeted optimisation as introduced in paper  
Sepp A., Ossa I., and Kastenholz M. (2025),
"Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios",
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5250221


# Table of contents
1. [Analytics](#analytics)
2. [Installation](#installation)
3. [Portfolio Optimisers](#optimisers)
   1. [Implementation structure](#structure)
   2. [Example of implementation for Maximum Diversification Solver](#example_structure)
   3. [Constraints](#constraints)
   4. [Wrapper for implemented rolling portfolios](#wrapper)
   5. [Adding an optimiser](#adding)
   6. [Default parameters](#params)
   7. [Price time series data](#ts)
4. [Examples](#examples)
   1. [Optimal Portfolio Backtest](#optimal)
   2. [Customised reporting](#report)
   3. [Parameters sensitivity backtest](#sensitivity)
   4. [Multi optimisers cross backtest](#cross)
   5. [Backtest of multi covariance estimators](#covars)
   6. [Optimal allocation to cryptocurrencies](#crypto)
   7. [Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios](#hcgl)
5. [Contributions](#contributions)
6. [Updates](#updates)
7. [Disclaimer](#disclaimer)

## **Installation** <a name="installation"></a>
install using
```python 
pip install optimalportfolios
```
upgrade using
```python 
pip install --upgrade optimalportfolios
```

close using
```python 
git clone https://github.com/ArturSepp/OptimalPortfolios.git
```


Core dependencies:
    python = ">=3.8,<3.11",
    numba = ">=0.56.4",
    numpy = ">=1.22.4",
    scipy = ">=1.9.0",
    pandas = ">=2.2.2",
    matplotlib = ">=3.2.2",
    seaborn = ">=0.12.2",
    scikit_learn = ">=1.3.0",
    cvxpy = ">=1.3.2",
    qis = ">=2.1.33",
    quadprog = ">=0.1.13"

Optional dependencies:
    yfinance ">=0.2.3" (for getting test price data),
    pybloqs ">=1.2.13" (for producing html and pdf factsheets)



## **Portfolio optimisers** <a name="optimisers"></a>

### 1. Implementation structure <a name="structure"></a>

The implementation of each solver is split into the 3 layers:

1) Mathematical layer which takes clean inputs, formulates the optimisation
problem and solves the 
optimisation problem using Scipy or CVXPY solvers.
The logic of this layer is to solve the problem algorithmically by taking clean inputs.

2) Wrapper level which takes inputs potentially containing nans, 
filters them out and calls the solver in layer 1). The output weights of filtered out
assets are set to zero.

3) Rolling level function with takes price time series as inputs and implements
the estimation of covariance matrix and other inputs on roll-forward basis. 
For each update date the rolling layer call the wrapper layer 2) with estimated
inputs as of the update date.

For rolling level function, the estimated covariance matrix can be passed as dictionary of type Dict[pd.Timestamp, pd.DataFrame] 
with dataframes containing covariance matrices for the universe and with keys being rebalancing times 

The default covariance is estimated using EWMA function with
covar_estimator = CovarEstimator(returns_freq=returns_freq, rebalancing_freq=rebalancing_freq, span=span)


The recommended usage is as follows.

Layer 2) is used for live portfolios or for backtests which are implemented using 
data augmentation

Layer 3) is applied for roll forward backtests where all available data is processed
using roll forward analysis

For implementation of different estimation methods for covariance matrices
and other inputs, we recommend to implement specific layers 2) or 3) with the 
implementation of the estimation logic. 

Layer 1 works with provided covariance matrices and inputs.


### 2. Example of implementation for Maximum Diversification Solver <a name="example_structure"></a>

Using example of ```optimization.solvers.max_diversification.py```

1. Scipy solver ```opt_maximise_diversification()``` which takes "clean" inputs of the 
covariance matrix of type ```np.ndarray``` without nans and
```Constraints``` dataclass which implements constraints for the solver.

The lowest level of each optimisation method is ```opt_...``` or ```cvx_...``` function taking clean inputs and producing the optimal weights. 

The logic of this layer is to implement pure quant logic for the optimiser with cvx solver.

2. Wrapper function ```wrapper_maximise_diversification()``` which takes inputs
covariance matrix of type ```pd.Dataframe``` 
potentially containing nans or assets with zero variance (when their time series are missing in the 
estimation period) and filters out non-nan "clean" inputs and 
updated constraints for OPT/CVX solver in layer 1.

The intermediary level of each optimisation method is ```wrapper_...``` function taking 
"dirty" inputs, filtering inputs,  and producing the optimal weights. This wrapper can be called either 
by rolling backtest simulations or by live portfolios for rebalancing.

The logic of this layer is to filter out data and to be an interface for portfolio implementations.

3. Rolling optimiser function ```rolling_maximise_diversification()``` takes the time series of data 
and sliced these accordingly and at each rebalancing step call the wrapper in layer 2.
In the end, the function outputs the time series of optiomal weight of assets in the universe.
Price data of assets may have gaps and nans which is taken care of in the wrapper level.

The backtesting of each optimisation method is implemented with ```rolling_...``` method with produces the time series of
optimal portfolio weights.

The logic of this layer is to faciliate the backtest of portfolio optimisation method and to produce
time series of portfolio weights using a Markovian setup. These weights are applied for the backtest 
of the optimal portfolio and the underlying strategy

Each module in ```optimization.solver``` implements specific optimisers and estimators for their inputs.



### 3. Constraints <a name="constraints"></a>

Dataclass ```Constraints``` in ```optimization.constraints``` implements 
optimisation constraints in solver independent way.

The following inputs for various constraints are implemented.
```python 
@dataclass
class Constraints:
    is_long_only: bool = True  # for positive allocation weights
    min_weights: pd.Series = None  # instrument min weights  
    max_weights: pd.Series = None  # instrument max weights
    max_exposure: float = 1.0  # for long short portfolios: for long_portfolios = 1
    min_exposure: float = 1.0  # for long short portfolios: for long_portfolios = 1
    benchmark_weights: pd.Series = None  # for minimisation of tracking error 
    tracking_err_vol_constraint: float = None  # annualised sqrt tracking error
    weights_0: pd.Series = None  # for turnover constraints
    turnover_constraint: float = None  # for turnover constraints
    target_return: float = None  # for optimisation with target return
    asset_returns: pd.Series = None  # for optimisation with target return
    max_target_portfolio_vol_an: float = None  # for optimisation with maximum portfolio volatility target
    min_target_portfolio_vol_an: float = None  # for optimisation with maximum portfolio volatility target
    group_lower_upper_constraints: GroupLowerUpperConstraints = None  # for group allocations constraints
```

Dataclass ```GroupLowerUpperConstraints``` implements asset class loading and min and max allocations
```python 
@dataclass
class GroupLowerUpperConstraints:
    """
    add constraints that each asset group is group_min_allocation <= sum group weights <= group_max_allocation
    """
    group_loadings: pd.DataFrame  # columns=instruments, index=groups, data=1 if instrument in indexed group else 0
    group_min_allocation: pd.Series  # index=groups, data=group min allocation 
    group_max_allocation: pd.Series  # index=groups, data=group max allocation 
```

Constraints are updated on the wrapper level to include the valid tickers
```python 
    def update_with_valid_tickers(self,  valid_tickers: List[str]) -> Constraints:
```


On the solver layer, the constants for the solvers are requested as follows.

For Scipy: ```set_scipy_constraints(self, covar: np.ndarray = None) -> List```

For CVXPY: ```set_cvx_constraints(self, w: cvx.Variable, covar: np.ndarray = None) -> List```



### 4. Wrapper for implemented rolling portfolios <a name="wrapper"></a>

Module ```optimisation.wrapper_rolling_portfolios.py``` wraps implementation of 
of the following solvers enumerated in ```config.py```

Using the wrapper function allows for cross-sectional analysis of different
backtest methods and for sensitivity analysis to parameters of
estimation and solver methods.

```python
class PortfolioObjective(Enum):
    """
    implemented portfolios in rolling_engine
    """
    # risk-based:
    MAX_DIVERSIFICATION = 1  # maximum diversification measure
    EQUAL_RISK_CONTRIBUTION = 2  # implementation in risk_parity
    MIN_VARIANCE = 3  # min w^t @ covar @ w
    # return-risk based
    QUADRATIC_UTILITY = 4  # max means^t*w- 0.5*gamma*w^t*covar*w
    MAXIMUM_SHARPE_RATIO = 5  # max means^t*w / sqrt(*w^t*covar*w)
    # return-skeweness based
    MAX_CARA_MIXTURE = 6  # carra for mixture distributions
```

See examples for [Parameters sensitivity backtest](#sensitivity) and 
[Multi optimisers cross backtest](#cross)


### 5. Adding an optimiser <a name="adding"></a>

1. Add analytics for computing rolling weights using a new estimator in
subpackage ```optimization.solvers```. Any third-party packages can be used

2. For cross-sectional analysis, add new optimiser type 
to ```config.py``` and link implemented
optimiser in wrapper function ```compute_rolling_optimal_weights()``` in 
```optimisation.wrapper_rolling_portfolios.py```


### 6. Default parameters <a name="params"></a>

Key parameters include the specification of the estimation sample.

1. ```returns_freq``` defines the frequency of returns for covariance matrix estimation. This parameter affects all methods. 

The default (assuming daily price data) is weekly Wednesday returns ```returns_freq = 'W-WED'```.

For price data with monthly observations 
(such us hedged funds), monthly returns should be used ```returns_freq = 'ME'```.


2. ```span``` defines the estimation span for ewma covariance matrix. This parameter affects all methods which use 
EWMA covariance matrix:
```
PortfolioObjective in [MAX_DIVERSIFICATION, EQUAL_RISK_CONTRIBUTION, MIN_VARIANCE]
```   
and 
```
PortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO]
```   

The span is defined as the number of returns
for the half-life of EWMA filter: ```ewma_lambda = 1 - 2 / (span+1)```. ```span=52``` with weekly returns means that 
last 52 weekly returns (one year of data) contribute 50% of weight to estimated covariance matrix

The default (assuming weekly returns) is 52: ```span=52```.

For monthly returns, I recommend to use ```span=12``` or ```span=24```.


3. ```rebalancing_freq``` defines the frequency of weights update. This parameter affects all methods.

The default value is quarterly rebalancing  ```rebalancing_freq='QE'```.

For the following methods 
```
PortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO, MAX_CARA_MIXTURE]
```   
Rebalancing frequency is also the rolling sample update frequency when mean returns and mixture distributions are estimated.


4. ```roll_window``` defines the number of past returns applied for estimation of rolling mean returns and mixture distributions.

This parameter affects the following optimisers 
```
PortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO, MAX_CARA_MIXTURE]
```   
and it is linked to ```rebalancing_freq```. 

Default value is ```roll_window=20``` which means that data for past 20 (quarters) are used in the sample
with ```rebalancing_freq='QE'```

For monthly rebalancing, I recomend to use ```roll_window=60``` which corresponds to using past 5 years of data

### 7. Price time series data <a name="ts"></a>

The input to all optimisers is dataframe prices which contains dividend and split adjusted prices.

The price data can include assets with prices starting an ending at different times.

All optimisers will set maximum weight to zero for assets with missing prices in the estimation sample period.  



## **Examples** <a name="examples"></a>

### 1. Optimal Portfolio Backtest <a name="optimal"></a>

See script in ```optimalportfolios.examples.optimal_portfolio_backtest.py```

```pythong
import os
import pickle
from pathlib import Path

import pandas as pd
import yfinance as yf
from typing import Tuple
import qis as qis

from optimalportfolios import compute_rolling_optimal_weights, PortfolioObjective, Constraints

#: Cache YFinance price data for subsequent runs here
PRICES_CACHE_PATH = Path("/tmp/prices.pickle")

#: Where to store the results figures and such
OUTPUT_PATH = Path("./output")


def fetch_universe_data() -> Tuple[pd.DataFrame, pd.DataFrame, pd.Series]:
    """
    fetch universe data for the portfolio construction:
    1. dividend and split adjusted end of day prices: price data may start / end at different dates
    2. benchmark prices which is used for portfolio reporting and benchmarking
    3. universe group data for portfolio reporting and risk attribution for large universes
    this function is using yfinance to fetch the price data
    """
    universe_data = dict(SPY='Equities',
                         QQQ='Equities',
                         EEM='Equities',
                         TLT='Bonds',
                         IEF='Bonds',
                         LQD='Credit',
                         HYG='HighYield',
                         GLD='Gold')
    tickers = list(universe_data.keys())
    group_data = pd.Series(universe_data)
    if PRICES_CACHE_PATH.exists():
        print("Using cached prcies")
        prices = pickle.load(PRICES_CACHE_PATH.open("rb"))
    else:
        print("Starting prices download from YFinance")
        prices = yf.download(tickers, start="2003-12-31", end=None, ignore_tz=True, auto_adjust=True)['Close']
        pickle.dump(prices, PRICES_CACHE_PATH.open("wb"))

    prices = prices[tickers]  # arrange as given
    prices = prices.asfreq('B', method='ffill')  # refill at B frequency
    benchmark_prices = prices[['SPY', 'TLT']]
    return prices, benchmark_prices, group_data

# 2. get universe data
prices, benchmark_prices, group_data = fetch_universe_data()
time_period = qis.TimePeriod('31Dec2004', '16Aug2024')   # period for computing weights backtest

# 3.a. define optimisation setup
print("Define optimisation")
portfolio_objective = PortfolioObjective.MAX_DIVERSIFICATION  # define portfolio objective
returns_freq = 'W-WED'  # use weekly returns
rebalancing_freq = 'QE'  # weights rebalancing frequency: rebalancing is quarterly on WED
span = 52  # span of number of returns_freq-returns for covariance estimation = 12y
constraints0 = Constraints(is_long_only=True,
                           min_weights=pd.Series(0.0, index=prices.columns),
                           max_weights=pd.Series(0.5, index=prices.columns))

# 3.b. compute solvers portfolio weights rebalanced every quarter
weights = compute_rolling_optimal_weights(prices=prices,
                                          portfolio_objective=portfolio_objective,
                                          constraints0=constraints0,
                                          time_period=time_period,
                                          rebalancing_freq=rebalancing_freq,
                                          span=span)

# 4. given portfolio weights, construct the performance of the portfolio
print("Assigning weights")
funding_rate = None  # on positive / negative cash balances
rebalancing_costs = 0.0010  # rebalancing costs per volume = 10bp
weight_implementation_lag = 1  # portfolio is implemented next day after weights are computed
portfolio_data = qis.backtest_model_portfolio(prices=prices.loc[weights.index[0]:, :],
                                              weights=weights,
                                              ticker='MaxDiversification',
                                              funding_rate=funding_rate,
                                              weight_implementation_lag=weight_implementation_lag,
                                              rebalancing_costs=rebalancing_costs)

# 5. using portfolio_data run the reporting with strategy factsheet
# for group-based reporting set_group_data
print("Generating reports")
portfolio_data.set_group_data(group_data=group_data, group_order=list(group_data.unique()))
# set time period for portfolio reporting
figs = qis.generate_strategy_factsheet(portfolio_data=portfolio_data,
                                       benchmark_prices=benchmark_prices,
                                       time_period=time_period,
                                       **qis.fetch_default_report_kwargs(time_period=time_period))


if not OUTPUT_PATH.exists():
    os.makedirs(OUTPUT_PATH, exist_ok=True)

# save report to pdf and png
qis.save_figs_to_pdf(figs=figs,
                     file_name=f"{portfolio_data.nav.name}_portfolio_factsheet",
                     orientation='landscape',
                     local_path=str(OUTPUT_PATH))

qis.save_fig(fig=figs[0], file_name=f"example_portfolio_factsheet1", local_path=str(OUTPUT_PATH))
if len(figs) > 1:
    qis.save_fig(fig=figs[1], file_name=f"example_portfolio_factsheet2", local_path=str(OUTPUT_PATH))


```
![image info](optimalportfolios/examples/figures/example_portfolio_factsheet1.PNG)
![image info](optimalportfolios/examples/figures/example_portfolio_factsheet2.PNG)


### 2. Customised reporting <a name="report"></a>

Portfolio data class ```PortfolioData``` is implemented in [QIS package](https://github.com/ArturSepp/QuantInvestStrats)

```python
# 6. can create customised reporting using portfolio_data custom reporting
def run_customised_reporting(portfolio_data) -> plt.Figure:
    with sns.axes_style("darkgrid"):
        fig, axs = plt.subplots(3, 1, figsize=(12, 12), tight_layout=True)
    perf_params = qis.PerfParams(freq='W-WED', freq_reg='ME')
    kwargs = dict(x_date_freq='YE', framealpha=0.8, perf_params=perf_params)
    portfolio_data.plot_nav(ax=axs[0], **kwargs)
    portfolio_data.plot_weights(ncol=len(prices.columns)//3,
                                legend_stats=qis.LegendStats.AVG_LAST,
                                title='Portfolio weights',
                                freq='QE',
                                ax=axs[1],
                                **kwargs)
    portfolio_data.plot_returns_scatter(benchmark_price=benchmark_prices.iloc[:, 0],
                                        ax=axs[2],
                                        **kwargs)
    return fig


# run customised report
fig = run_customised_reporting(portfolio_data)
# save png
qis.save_fig(fig=fig, file_name=f"example_customised_report", local_path=f"figures/")
```
![image info](optimalportfolios/examples/figures/example_customised_report.PNG)


### 3. Parameters sensitivity backtest <a name="sensitivity"></a>

Cross-sectional backtests are applied to test the sensitivity of
optimisation method to a parameter of estimation or solver methods.

See script in ```optimalportfolios.examples.parameter_sensitivity_backtest.py```

![image info](optimalportfolios/examples/figures/max_diversification_span.PNG)



### 4. Multi optimisers cross backtest <a name="cross"></a>

Multiple optimisation methods can be analysed 
using the wrapper function ```compute_rolling_optimal_weights()``` 

See example script in ```optimalportfolios.examples.multi_optimisers_backtest.py```

![image info](optimalportfolios/examples/figures/multi_optimisers_backtest.PNG)



### 5. Backtest of multi covariance estimators <a name="covars"></a>

Multiple covariance estimators can be backtested for the same optimisation method

See example script in ```optimalportfolios.examples.multi_covar_estimation_backtest.py```

![image info](optimalportfolios/examples/figures/MinVariance_multi_covar_estimator_backtest.PNG)


### 6. Optimal allocation to cryptocurrencies <a name="crypto"></a>

Computations and visualisations for 
paper "Optimal Allocation to Cryptocurrencies in Diversified Portfolios" [https://ssrn.com/abstract=4217841](https://ssrn.com/abstract=4217841)
   are implemented in module ```optimalportfolios.examples.crypto_allocation```,
see [README in this module](https://github.com/ArturSepp/OptimalPortfolios/blob/master/optimalportfolios/examples/crypto_allocation/README.md)


### 7. Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios <a name="hcgl"></a>

Computations and visualisations for 
paper "Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios" [https://ssrn.com/abstract=5250221](https://ssrn.com/abstract=5250221)
   are implemented in module ```optimalportfolios.examples.robust_optimisation_saa_taa```,
see [README in this module](https://github.com/ArturSepp/OptimalPortfolios/blob/master/optimalportfolios/examples/robust_optimisation_saa_taa/README.md)


## **Updates** <a name="updates"></a>

#### 8 July 2023,  Version 1.0.1 released

Implementation of optimisation methods and data considered in 
"Optimal Allocation to Cryptocurrencies in
Diversified Portfolios"  by A. Sepp published in Risk Magazine, October 2023, 1-6. The draft is available at SSRN: https://ssrn.com/abstract=4217841


#### 2 September 2023,  Version 1.0.8 released
Added subpackage ```optimisation.rolling_engine``` with optimisers grouped by the type of inputs and
data they require.

#### 18 August 2024,  Version 2.1.1 released
Refactor the implementation of solvers with the 3 layers.

Add new solvers for tracking error and target return optimisations.

Add exmples of running all solvers

#### 05 January 2025,  Version 3.1.1 released

Added Lasso estimator and Group lasso estimator using cvxpy quadratic problems

Added covariance estimator using factor model with Lasso betas

Estimated covariance matrices can be passed to rolling solvers, CovarEstimator type is added for different covariance estimators 

Risk budgeting is implemented using pyrb package with pyrb forked for optimalportfolio package


## **Disclaimer** <a name="disclaimer"></a>

OptimalPortfolios package is distributed FREE & WITHOUT ANY WARRANTY under the GNU GENERAL PUBLIC LICENSE.

See the [LICENSE.txt](https://github.com/ArturSepp/OptimalPortfolios/blob/master/LICENSE.txt) in the release for details.

Please report any bugs or suggestions by opening an [issue](https://github.com/ArturSepp/OptimalPortfolios/issues).

            

Raw data

            {
    "_id": null,
    "home_page": "https://github.com/ArturSepp/OptimalPortfolios",
    "name": "optimalportfolios",
    "maintainer": null,
    "docs_url": null,
    "requires_python": ">=3.8",
    "maintainer_email": "Artur Sepp <artursepp@gmail.com>",
    "keywords": "portfolio optimization, quantitative finance, optimal portfolios, mean variance optimization, risk budgeting, portfolio backtesting, financial optimization, asset allocation, portfolio analytics, maximum diversification, equal risk contribution, minimum variance, systematic strategies, investment strategies, covariance estimation, EWMA, Lasso regularization",
    "author": "Artur Sepp",
    "author_email": "Artur Sepp <artursepp@gmail.com>",
    "download_url": "https://files.pythonhosted.org/packages/ad/9e/a77ccb34cd751cc8a055eb76bc88d4de3fb3a8fd13e5ebddbeafcc8a8f56/optimalportfolios-3.4.1.tar.gz",
    "platform": null,
    "description": "# \ud83d\ude80 **Optimal Portfolios Construction and Backtesting: optimalportfolios**\r\n\r\n> optimalportfolios package implements analytics for constructing and backtesting of multi-asset portfolios using risk-return maximization, risk budgeting, and similar optimal portfolio construction methods\r\n\r\n---\r\n\r\n| \ud83d\udcca Metric | \ud83d\udd22 Value |\r\n|-----------|----------|\r\n| PyPI Version | ![PyPI](https://img.shields.io/pypi/v/optimalportfolios?style=flat-square) |\r\n| Python Versions | ![Python](https://img.shields.io/pypi/pyversions/optimalportfolios?style=flat-square) |\r\n| License | ![License](https://img.shields.io/github/license/ArturSepp/OptimalPortfolios.svg?style=flat-square)|\r\n\r\n\r\n### \ud83d\udcc8 Package Statistics\r\n\r\n| \ud83d\udcca Metric | \ud83d\udd22 Value |\r\n|-----------|----------|\r\n| Total Downloads | [![Total](https://pepy.tech/badge/optimalportfolios)](https://pepy.tech/project/optimalportfolios) |\r\n| Monthly | ![Monthly](https://pepy.tech/badge/optimalportfolios/month) |\r\n| Weekly | ![Weekly](https://pepy.tech/badge/optimalportfolios/week) |\r\n| GitHub Stars | ![GitHub stars](https://img.shields.io/github/stars/ArturSepp/OptimalPortfolios?style=flat-square&logo=github) |\r\n| GitHub Forks | ![GitHub forks](https://img.shields.io/github/forks/ArturSepp/OptimalPortfolios?style=flat-square&logo=github) |\r\n\r\n\r\n## **Optimal Portfolios Backtester** <a name=\"analytics\"></a>\r\noptimalportfolios package implements analytics for backtesting of optimal portfolios including:\r\n1. Computing of inputs (covariance matrices, returns) for roll forward\r\ncomputations (to avoid hindsight bias) and for generation of rolling optimal portfolios\r\n2. Implementation of core optimisation solvers:\r\n   1. Minimum variance\r\n   2. Maximum quadratic utility\r\n   3. Budgeted risk contribution (risk parity for equal budgets)\r\n   4. Maximum diversification\r\n   5. Maximum Sharpe ratio\r\n   6. Maximum Cara utility under Gaussian mixture model\r\n   7. Tracking error minimisation \r\n3. Rolling portfolio optimisation methods are compatible with incomplete time series\r\nfor roll forward analysis so that the portfolio universe can include instruments with different price histories\r\n\r\nNo pre-filtering of universe prices is necessary as rolling optimisers will detect \r\neligeble assets when their variances and covariances are available for \r\ninclusion into time-t allocation set\r\n\r\n4. Computing performances of simulated portfolios\r\n5. Reporting of backtested portfolios and cross-sectional analysis\r\n\r\n\r\n\r\nOptimalPortfolios package is split into 5 main modules with the \r\ndependecy path increasing sequentially as follows.\r\n\r\n1. ```optimisation``` with sub-package ```solvers``` contains implementation of\r\nvarious quadratic and nonlinear solvers. Each solver is implemented \r\nin a module independently of other solvers.\r\n\r\n2. ```covar_estimation``` contains implementation of rolling methods for estimating\r\ncovariance matrices using EWMA and Lasso methods.\r\n\r\n3. ```lasso``` with sub-package ```laasso_model_estimator``` contains implementation of\r\nlasso based estimator of covariance matrix using the methodology developed in \r\npaper: Sepp A., Ossa I., and Kastenholz M. (2025),\r\n\"Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios\"\r\n(https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5250221)\r\n\r\n   \r\n4. ```utils``` is module for auxiliary analytics, in particular\r\n\r\n5. ```reports``` is module for computing performance statistics and performance attribution including returns, volatilities, etc.\r\n\r\n6. ```examples.solvers``` provides example of running all implemented solvers.\r\n\r\n### **Illustrations and examples of publicated papers** <a name=\"analytics\"></a>\r\n\r\n1. ```examples.crypto_allocation``` is module for computations and visualisations for  \r\nSepp A. (2023) \"Optimal Allocation to Cryptocurrencies in Diversified Portfolios\",\r\nRisk, October 2023, 1-6, https://ssrn.com/abstract=4217841\r\n\r\n2. ```examples.robust_optimisation_saa_taa``` is module for example of using\r\nHierarchical Clustering Group Lasso (HCGL) method for rolling estimation of covariance matrix and for solving Strategic Asset Allocation\r\nusing risk-budgeted optimisation as introduced in paper  \r\nSepp A., Ossa I., and Kastenholz M. (2025),\r\n\"Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios\",\r\nhttps://papers.ssrn.com/sol3/papers.cfm?abstract_id=5250221\r\n\r\n\r\n# Table of contents\r\n1. [Analytics](#analytics)\r\n2. [Installation](#installation)\r\n3. [Portfolio Optimisers](#optimisers)\r\n   1. [Implementation structure](#structure)\r\n   2. [Example of implementation for Maximum Diversification Solver](#example_structure)\r\n   3. [Constraints](#constraints)\r\n   4. [Wrapper for implemented rolling portfolios](#wrapper)\r\n   5. [Adding an optimiser](#adding)\r\n   6. [Default parameters](#params)\r\n   7. [Price time series data](#ts)\r\n4. [Examples](#examples)\r\n   1. [Optimal Portfolio Backtest](#optimal)\r\n   2. [Customised reporting](#report)\r\n   3. [Parameters sensitivity backtest](#sensitivity)\r\n   4. [Multi optimisers cross backtest](#cross)\r\n   5. [Backtest of multi covariance estimators](#covars)\r\n   6. [Optimal allocation to cryptocurrencies](#crypto)\r\n   7. [Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios](#hcgl)\r\n5. [Contributions](#contributions)\r\n6. [Updates](#updates)\r\n7. [Disclaimer](#disclaimer)\r\n\r\n## **Installation** <a name=\"installation\"></a>\r\ninstall using\r\n```python \r\npip install optimalportfolios\r\n```\r\nupgrade using\r\n```python \r\npip install --upgrade optimalportfolios\r\n```\r\n\r\nclose using\r\n```python \r\ngit clone https://github.com/ArturSepp/OptimalPortfolios.git\r\n```\r\n\r\n\r\nCore dependencies:\r\n    python = \">=3.8,<3.11\",\r\n    numba = \">=0.56.4\",\r\n    numpy = \">=1.22.4\",\r\n    scipy = \">=1.9.0\",\r\n    pandas = \">=2.2.2\",\r\n    matplotlib = \">=3.2.2\",\r\n    seaborn = \">=0.12.2\",\r\n    scikit_learn = \">=1.3.0\",\r\n    cvxpy = \">=1.3.2\",\r\n    qis = \">=2.1.33\",\r\n    quadprog = \">=0.1.13\"\r\n\r\nOptional dependencies:\r\n    yfinance \">=0.2.3\" (for getting test price data),\r\n    pybloqs \">=1.2.13\" (for producing html and pdf factsheets)\r\n\r\n\r\n\r\n## **Portfolio optimisers** <a name=\"optimisers\"></a>\r\n\r\n### 1. Implementation structure <a name=\"structure\"></a>\r\n\r\nThe implementation of each solver is split into the 3 layers:\r\n\r\n1) Mathematical layer which takes clean inputs, formulates the optimisation\r\nproblem and solves the \r\noptimisation problem using Scipy or CVXPY solvers.\r\nThe logic of this layer is to solve the problem algorithmically by taking clean inputs.\r\n\r\n2) Wrapper level which takes inputs potentially containing nans, \r\nfilters them out and calls the solver in layer 1). The output weights of filtered out\r\nassets are set to zero.\r\n\r\n3) Rolling level function with takes price time series as inputs and implements\r\nthe estimation of covariance matrix and other inputs on roll-forward basis. \r\nFor each update date the rolling layer call the wrapper layer 2) with estimated\r\ninputs as of the update date.\r\n\r\nFor rolling level function, the estimated covariance matrix can be passed as dictionary of type Dict[pd.Timestamp, pd.DataFrame] \r\nwith dataframes containing covariance matrices for the universe and with keys being rebalancing times \r\n\r\nThe default covariance is estimated using EWMA function with\r\ncovar_estimator = CovarEstimator(returns_freq=returns_freq, rebalancing_freq=rebalancing_freq, span=span)\r\n\r\n\r\nThe recommended usage is as follows.\r\n\r\nLayer 2) is used for live portfolios or for backtests which are implemented using \r\ndata augmentation\r\n\r\nLayer 3) is applied for roll forward backtests where all available data is processed\r\nusing roll forward analysis\r\n\r\nFor implementation of different estimation methods for covariance matrices\r\nand other inputs, we recommend to implement specific layers 2) or 3) with the \r\nimplementation of the estimation logic. \r\n\r\nLayer 1 works with provided covariance matrices and inputs.\r\n\r\n\r\n### 2. Example of implementation for Maximum Diversification Solver <a name=\"example_structure\"></a>\r\n\r\nUsing example of ```optimization.solvers.max_diversification.py```\r\n\r\n1. Scipy solver ```opt_maximise_diversification()``` which takes \"clean\" inputs of the \r\ncovariance matrix of type ```np.ndarray``` without nans and\r\n```Constraints``` dataclass which implements constraints for the solver.\r\n\r\nThe lowest level of each optimisation method is ```opt_...``` or ```cvx_...``` function taking clean inputs and producing the optimal weights. \r\n\r\nThe logic of this layer is to implement pure quant logic for the optimiser with cvx solver.\r\n\r\n2. Wrapper function ```wrapper_maximise_diversification()``` which takes inputs\r\ncovariance matrix of type ```pd.Dataframe``` \r\npotentially containing nans or assets with zero variance (when their time series are missing in the \r\nestimation period) and filters out non-nan \"clean\" inputs and \r\nupdated constraints for OPT/CVX solver in layer 1.\r\n\r\nThe intermediary level of each optimisation method is ```wrapper_...``` function taking \r\n\"dirty\" inputs, filtering inputs,  and producing the optimal weights. This wrapper can be called either \r\nby rolling backtest simulations or by live portfolios for rebalancing.\r\n\r\nThe logic of this layer is to filter out data and to be an interface for portfolio implementations.\r\n\r\n3. Rolling optimiser function ```rolling_maximise_diversification()``` takes the time series of data \r\nand sliced these accordingly and at each rebalancing step call the wrapper in layer 2.\r\nIn the end, the function outputs the time series of optiomal weight of assets in the universe.\r\nPrice data of assets may have gaps and nans which is taken care of in the wrapper level.\r\n\r\nThe backtesting of each optimisation method is implemented with ```rolling_...``` method with produces the time series of\r\noptimal portfolio weights.\r\n\r\nThe logic of this layer is to faciliate the backtest of portfolio optimisation method and to produce\r\ntime series of portfolio weights using a Markovian setup. These weights are applied for the backtest \r\nof the optimal portfolio and the underlying strategy\r\n\r\nEach module in ```optimization.solver``` implements specific optimisers and estimators for their inputs.\r\n\r\n\r\n\r\n### 3. Constraints <a name=\"constraints\"></a>\r\n\r\nDataclass ```Constraints``` in ```optimization.constraints``` implements \r\noptimisation constraints in solver independent way.\r\n\r\nThe following inputs for various constraints are implemented.\r\n```python \r\n@dataclass\r\nclass Constraints:\r\n    is_long_only: bool = True  # for positive allocation weights\r\n    min_weights: pd.Series = None  # instrument min weights  \r\n    max_weights: pd.Series = None  # instrument max weights\r\n    max_exposure: float = 1.0  # for long short portfolios: for long_portfolios = 1\r\n    min_exposure: float = 1.0  # for long short portfolios: for long_portfolios = 1\r\n    benchmark_weights: pd.Series = None  # for minimisation of tracking error \r\n    tracking_err_vol_constraint: float = None  # annualised sqrt tracking error\r\n    weights_0: pd.Series = None  # for turnover constraints\r\n    turnover_constraint: float = None  # for turnover constraints\r\n    target_return: float = None  # for optimisation with target return\r\n    asset_returns: pd.Series = None  # for optimisation with target return\r\n    max_target_portfolio_vol_an: float = None  # for optimisation with maximum portfolio volatility target\r\n    min_target_portfolio_vol_an: float = None  # for optimisation with maximum portfolio volatility target\r\n    group_lower_upper_constraints: GroupLowerUpperConstraints = None  # for group allocations constraints\r\n```\r\n\r\nDataclass ```GroupLowerUpperConstraints``` implements asset class loading and min and max allocations\r\n```python \r\n@dataclass\r\nclass GroupLowerUpperConstraints:\r\n    \"\"\"\r\n    add constraints that each asset group is group_min_allocation <= sum group weights <= group_max_allocation\r\n    \"\"\"\r\n    group_loadings: pd.DataFrame  # columns=instruments, index=groups, data=1 if instrument in indexed group else 0\r\n    group_min_allocation: pd.Series  # index=groups, data=group min allocation \r\n    group_max_allocation: pd.Series  # index=groups, data=group max allocation \r\n```\r\n\r\nConstraints are updated on the wrapper level to include the valid tickers\r\n```python \r\n    def update_with_valid_tickers(self,  valid_tickers: List[str]) -> Constraints:\r\n```\r\n\r\n\r\nOn the solver layer, the constants for the solvers are requested as follows.\r\n\r\nFor Scipy: ```set_scipy_constraints(self, covar: np.ndarray = None) -> List```\r\n\r\nFor CVXPY: ```set_cvx_constraints(self, w: cvx.Variable, covar: np.ndarray = None) -> List```\r\n\r\n\r\n\r\n### 4. Wrapper for implemented rolling portfolios <a name=\"wrapper\"></a>\r\n\r\nModule ```optimisation.wrapper_rolling_portfolios.py``` wraps implementation of \r\nof the following solvers enumerated in ```config.py```\r\n\r\nUsing the wrapper function allows for cross-sectional analysis of different\r\nbacktest methods and for sensitivity analysis to parameters of\r\nestimation and solver methods.\r\n\r\n```python\r\nclass PortfolioObjective(Enum):\r\n    \"\"\"\r\n    implemented portfolios in rolling_engine\r\n    \"\"\"\r\n    # risk-based:\r\n    MAX_DIVERSIFICATION = 1  # maximum diversification measure\r\n    EQUAL_RISK_CONTRIBUTION = 2  # implementation in risk_parity\r\n    MIN_VARIANCE = 3  # min w^t @ covar @ w\r\n    # return-risk based\r\n    QUADRATIC_UTILITY = 4  # max means^t*w- 0.5*gamma*w^t*covar*w\r\n    MAXIMUM_SHARPE_RATIO = 5  # max means^t*w / sqrt(*w^t*covar*w)\r\n    # return-skeweness based\r\n    MAX_CARA_MIXTURE = 6  # carra for mixture distributions\r\n```\r\n\r\nSee examples for [Parameters sensitivity backtest](#sensitivity) and \r\n[Multi optimisers cross backtest](#cross)\r\n\r\n\r\n### 5. Adding an optimiser <a name=\"adding\"></a>\r\n\r\n1. Add analytics for computing rolling weights using a new estimator in\r\nsubpackage ```optimization.solvers```. Any third-party packages can be used\r\n\r\n2. For cross-sectional analysis, add new optimiser type \r\nto ```config.py``` and link implemented\r\noptimiser in wrapper function ```compute_rolling_optimal_weights()``` in \r\n```optimisation.wrapper_rolling_portfolios.py```\r\n\r\n\r\n### 6. Default parameters <a name=\"params\"></a>\r\n\r\nKey parameters include the specification of the estimation sample.\r\n\r\n1. ```returns_freq``` defines the frequency of returns for covariance matrix estimation. This parameter affects all methods. \r\n\r\nThe default (assuming daily price data) is weekly Wednesday returns ```returns_freq = 'W-WED'```.\r\n\r\nFor price data with monthly observations \r\n(such us hedged funds), monthly returns should be used ```returns_freq = 'ME'```.\r\n\r\n\r\n2. ```span``` defines the estimation span for ewma covariance matrix. This parameter affects all methods which use \r\nEWMA covariance matrix:\r\n```\r\nPortfolioObjective in [MAX_DIVERSIFICATION, EQUAL_RISK_CONTRIBUTION, MIN_VARIANCE]\r\n```   \r\nand \r\n```\r\nPortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO]\r\n```   \r\n\r\nThe span is defined as the number of returns\r\nfor the half-life of EWMA filter: ```ewma_lambda = 1 - 2 / (span+1)```. ```span=52``` with weekly returns means that \r\nlast 52 weekly returns (one year of data) contribute 50% of weight to estimated covariance matrix\r\n\r\nThe default (assuming weekly returns) is 52: ```span=52```.\r\n\r\nFor monthly returns, I recommend to use ```span=12``` or ```span=24```.\r\n\r\n\r\n3. ```rebalancing_freq``` defines the frequency of weights update. This parameter affects all methods.\r\n\r\nThe default value is quarterly rebalancing  ```rebalancing_freq='QE'```.\r\n\r\nFor the following methods \r\n```\r\nPortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO, MAX_CARA_MIXTURE]\r\n```   \r\nRebalancing frequency is also the rolling sample update frequency when mean returns and mixture distributions are estimated.\r\n\r\n\r\n4. ```roll_window``` defines the number of past returns applied for estimation of rolling mean returns and mixture distributions.\r\n\r\nThis parameter affects the following optimisers \r\n```\r\nPortfolioObjective in [QUADRATIC_UTILITY, MAXIMUM_SHARPE_RATIO, MAX_CARA_MIXTURE]\r\n```   \r\nand it is linked to ```rebalancing_freq```. \r\n\r\nDefault value is ```roll_window=20``` which means that data for past 20 (quarters) are used in the sample\r\nwith ```rebalancing_freq='QE'```\r\n\r\nFor monthly rebalancing, I recomend to use ```roll_window=60``` which corresponds to using past 5 years of data\r\n\r\n### 7. Price time series data <a name=\"ts\"></a>\r\n\r\nThe input to all optimisers is dataframe prices which contains dividend and split adjusted prices.\r\n\r\nThe price data can include assets with prices starting an ending at different times.\r\n\r\nAll optimisers will set maximum weight to zero for assets with missing prices in the estimation sample period.  \r\n\r\n\r\n\r\n## **Examples** <a name=\"examples\"></a>\r\n\r\n### 1. Optimal Portfolio Backtest <a name=\"optimal\"></a>\r\n\r\nSee script in ```optimalportfolios.examples.optimal_portfolio_backtest.py```\r\n\r\n```pythong\r\nimport os\r\nimport pickle\r\nfrom pathlib import Path\r\n\r\nimport pandas as pd\r\nimport yfinance as yf\r\nfrom typing import Tuple\r\nimport qis as qis\r\n\r\nfrom optimalportfolios import compute_rolling_optimal_weights, PortfolioObjective, Constraints\r\n\r\n#: Cache YFinance price data for subsequent runs here\r\nPRICES_CACHE_PATH = Path(\"/tmp/prices.pickle\")\r\n\r\n#: Where to store the results figures and such\r\nOUTPUT_PATH = Path(\"./output\")\r\n\r\n\r\ndef fetch_universe_data() -> Tuple[pd.DataFrame, pd.DataFrame, pd.Series]:\r\n    \"\"\"\r\n    fetch universe data for the portfolio construction:\r\n    1. dividend and split adjusted end of day prices: price data may start / end at different dates\r\n    2. benchmark prices which is used for portfolio reporting and benchmarking\r\n    3. universe group data for portfolio reporting and risk attribution for large universes\r\n    this function is using yfinance to fetch the price data\r\n    \"\"\"\r\n    universe_data = dict(SPY='Equities',\r\n                         QQQ='Equities',\r\n                         EEM='Equities',\r\n                         TLT='Bonds',\r\n                         IEF='Bonds',\r\n                         LQD='Credit',\r\n                         HYG='HighYield',\r\n                         GLD='Gold')\r\n    tickers = list(universe_data.keys())\r\n    group_data = pd.Series(universe_data)\r\n    if PRICES_CACHE_PATH.exists():\r\n        print(\"Using cached prcies\")\r\n        prices = pickle.load(PRICES_CACHE_PATH.open(\"rb\"))\r\n    else:\r\n        print(\"Starting prices download from YFinance\")\r\n        prices = yf.download(tickers, start=\"2003-12-31\", end=None, ignore_tz=True, auto_adjust=True)['Close']\r\n        pickle.dump(prices, PRICES_CACHE_PATH.open(\"wb\"))\r\n\r\n    prices = prices[tickers]  # arrange as given\r\n    prices = prices.asfreq('B', method='ffill')  # refill at B frequency\r\n    benchmark_prices = prices[['SPY', 'TLT']]\r\n    return prices, benchmark_prices, group_data\r\n\r\n# 2. get universe data\r\nprices, benchmark_prices, group_data = fetch_universe_data()\r\ntime_period = qis.TimePeriod('31Dec2004', '16Aug2024')   # period for computing weights backtest\r\n\r\n# 3.a. define optimisation setup\r\nprint(\"Define optimisation\")\r\nportfolio_objective = PortfolioObjective.MAX_DIVERSIFICATION  # define portfolio objective\r\nreturns_freq = 'W-WED'  # use weekly returns\r\nrebalancing_freq = 'QE'  # weights rebalancing frequency: rebalancing is quarterly on WED\r\nspan = 52  # span of number of returns_freq-returns for covariance estimation = 12y\r\nconstraints0 = Constraints(is_long_only=True,\r\n                           min_weights=pd.Series(0.0, index=prices.columns),\r\n                           max_weights=pd.Series(0.5, index=prices.columns))\r\n\r\n# 3.b. compute solvers portfolio weights rebalanced every quarter\r\nweights = compute_rolling_optimal_weights(prices=prices,\r\n                                          portfolio_objective=portfolio_objective,\r\n                                          constraints0=constraints0,\r\n                                          time_period=time_period,\r\n                                          rebalancing_freq=rebalancing_freq,\r\n                                          span=span)\r\n\r\n# 4. given portfolio weights, construct the performance of the portfolio\r\nprint(\"Assigning weights\")\r\nfunding_rate = None  # on positive / negative cash balances\r\nrebalancing_costs = 0.0010  # rebalancing costs per volume = 10bp\r\nweight_implementation_lag = 1  # portfolio is implemented next day after weights are computed\r\nportfolio_data = qis.backtest_model_portfolio(prices=prices.loc[weights.index[0]:, :],\r\n                                              weights=weights,\r\n                                              ticker='MaxDiversification',\r\n                                              funding_rate=funding_rate,\r\n                                              weight_implementation_lag=weight_implementation_lag,\r\n                                              rebalancing_costs=rebalancing_costs)\r\n\r\n# 5. using portfolio_data run the reporting with strategy factsheet\r\n# for group-based reporting set_group_data\r\nprint(\"Generating reports\")\r\nportfolio_data.set_group_data(group_data=group_data, group_order=list(group_data.unique()))\r\n# set time period for portfolio reporting\r\nfigs = qis.generate_strategy_factsheet(portfolio_data=portfolio_data,\r\n                                       benchmark_prices=benchmark_prices,\r\n                                       time_period=time_period,\r\n                                       **qis.fetch_default_report_kwargs(time_period=time_period))\r\n\r\n\r\nif not OUTPUT_PATH.exists():\r\n    os.makedirs(OUTPUT_PATH, exist_ok=True)\r\n\r\n# save report to pdf and png\r\nqis.save_figs_to_pdf(figs=figs,\r\n                     file_name=f\"{portfolio_data.nav.name}_portfolio_factsheet\",\r\n                     orientation='landscape',\r\n                     local_path=str(OUTPUT_PATH))\r\n\r\nqis.save_fig(fig=figs[0], file_name=f\"example_portfolio_factsheet1\", local_path=str(OUTPUT_PATH))\r\nif len(figs) > 1:\r\n    qis.save_fig(fig=figs[1], file_name=f\"example_portfolio_factsheet2\", local_path=str(OUTPUT_PATH))\r\n\r\n\r\n```\r\n![image info](optimalportfolios/examples/figures/example_portfolio_factsheet1.PNG)\r\n![image info](optimalportfolios/examples/figures/example_portfolio_factsheet2.PNG)\r\n\r\n\r\n### 2. Customised reporting <a name=\"report\"></a>\r\n\r\nPortfolio data class ```PortfolioData``` is implemented in [QIS package](https://github.com/ArturSepp/QuantInvestStrats)\r\n\r\n```python\r\n# 6. can create customised reporting using portfolio_data custom reporting\r\ndef run_customised_reporting(portfolio_data) -> plt.Figure:\r\n    with sns.axes_style(\"darkgrid\"):\r\n        fig, axs = plt.subplots(3, 1, figsize=(12, 12), tight_layout=True)\r\n    perf_params = qis.PerfParams(freq='W-WED', freq_reg='ME')\r\n    kwargs = dict(x_date_freq='YE', framealpha=0.8, perf_params=perf_params)\r\n    portfolio_data.plot_nav(ax=axs[0], **kwargs)\r\n    portfolio_data.plot_weights(ncol=len(prices.columns)//3,\r\n                                legend_stats=qis.LegendStats.AVG_LAST,\r\n                                title='Portfolio weights',\r\n                                freq='QE',\r\n                                ax=axs[1],\r\n                                **kwargs)\r\n    portfolio_data.plot_returns_scatter(benchmark_price=benchmark_prices.iloc[:, 0],\r\n                                        ax=axs[2],\r\n                                        **kwargs)\r\n    return fig\r\n\r\n\r\n# run customised report\r\nfig = run_customised_reporting(portfolio_data)\r\n# save png\r\nqis.save_fig(fig=fig, file_name=f\"example_customised_report\", local_path=f\"figures/\")\r\n```\r\n![image info](optimalportfolios/examples/figures/example_customised_report.PNG)\r\n\r\n\r\n### 3. Parameters sensitivity backtest <a name=\"sensitivity\"></a>\r\n\r\nCross-sectional backtests are applied to test the sensitivity of\r\noptimisation method to a parameter of estimation or solver methods.\r\n\r\nSee script in ```optimalportfolios.examples.parameter_sensitivity_backtest.py```\r\n\r\n![image info](optimalportfolios/examples/figures/max_diversification_span.PNG)\r\n\r\n\r\n\r\n### 4. Multi optimisers cross backtest <a name=\"cross\"></a>\r\n\r\nMultiple optimisation methods can be analysed \r\nusing the wrapper function ```compute_rolling_optimal_weights()``` \r\n\r\nSee example script in ```optimalportfolios.examples.multi_optimisers_backtest.py```\r\n\r\n![image info](optimalportfolios/examples/figures/multi_optimisers_backtest.PNG)\r\n\r\n\r\n\r\n### 5. Backtest of multi covariance estimators <a name=\"covars\"></a>\r\n\r\nMultiple covariance estimators can be backtested for the same optimisation method\r\n\r\nSee example script in ```optimalportfolios.examples.multi_covar_estimation_backtest.py```\r\n\r\n![image info](optimalportfolios/examples/figures/MinVariance_multi_covar_estimator_backtest.PNG)\r\n\r\n\r\n### 6. Optimal allocation to cryptocurrencies <a name=\"crypto\"></a>\r\n\r\nComputations and visualisations for \r\npaper \"Optimal Allocation to Cryptocurrencies in Diversified Portfolios\" [https://ssrn.com/abstract=4217841](https://ssrn.com/abstract=4217841)\r\n   are implemented in module ```optimalportfolios.examples.crypto_allocation```,\r\nsee [README in this module](https://github.com/ArturSepp/OptimalPortfolios/blob/master/optimalportfolios/examples/crypto_allocation/README.md)\r\n\r\n\r\n### 7. Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios <a name=\"hcgl\"></a>\r\n\r\nComputations and visualisations for \r\npaper \"Robust Optimization of Strategic and Tactical Asset Allocation for Multi-Asset Portfolios\" [https://ssrn.com/abstract=5250221](https://ssrn.com/abstract=5250221)\r\n   are implemented in module ```optimalportfolios.examples.robust_optimisation_saa_taa```,\r\nsee [README in this module](https://github.com/ArturSepp/OptimalPortfolios/blob/master/optimalportfolios/examples/robust_optimisation_saa_taa/README.md)\r\n\r\n\r\n## **Updates** <a name=\"updates\"></a>\r\n\r\n#### 8 July 2023,  Version 1.0.1 released\r\n\r\nImplementation of optimisation methods and data considered in \r\n\"Optimal Allocation to Cryptocurrencies in\r\nDiversified Portfolios\"  by A. Sepp published in Risk Magazine, October 2023, 1-6. The draft is available at SSRN: https://ssrn.com/abstract=4217841\r\n\r\n\r\n#### 2 September 2023,  Version 1.0.8 released\r\nAdded subpackage ```optimisation.rolling_engine``` with optimisers grouped by the type of inputs and\r\ndata they require.\r\n\r\n#### 18 August 2024,  Version 2.1.1 released\r\nRefactor the implementation of solvers with the 3 layers.\r\n\r\nAdd new solvers for tracking error and target return optimisations.\r\n\r\nAdd exmples of running all solvers\r\n\r\n#### 05 January 2025,  Version 3.1.1 released\r\n\r\nAdded Lasso estimator and Group lasso estimator using cvxpy quadratic problems\r\n\r\nAdded covariance estimator using factor model with Lasso betas\r\n\r\nEstimated covariance matrices can be passed to rolling solvers, CovarEstimator type is added for different covariance estimators \r\n\r\nRisk budgeting is implemented using pyrb package with pyrb forked for optimalportfolio package\r\n\r\n\r\n## **Disclaimer** <a name=\"disclaimer\"></a>\r\n\r\nOptimalPortfolios package is distributed FREE & WITHOUT ANY WARRANTY under the GNU GENERAL PUBLIC LICENSE.\r\n\r\nSee the [LICENSE.txt](https://github.com/ArturSepp/OptimalPortfolios/blob/master/LICENSE.txt) in the release for details.\r\n\r\nPlease report any bugs or suggestions by opening an [issue](https://github.com/ArturSepp/OptimalPortfolios/issues).\r\n",
    "bugtrack_url": null,
    "license": "GNU GENERAL PUBLIC LICENSE\r\n                               Version 3, 29 June 2007\r\n        \r\n         Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>\r\n         Everyone is permitted to copy and distribute verbatim copies\r\n         of this license document, but changing it is not allowed.\r\n        \r\n                                    Preamble\r\n        \r\n          The GNU General Public License is a free, copyleft license for\r\n        software and other kinds of works.\r\n        \r\n          The licenses for most software and other practical works are designed\r\n        to take away your freedom to share and change the works.  By contrast,\r\n        the GNU General Public License is intended to guarantee your freedom to\r\n        share and change all versions of a program--to make sure it remains free\r\n        software for all its users.  We, the Free Software Foundation, use the\r\n        GNU General Public License for most of our software; it applies also to\r\n        any other work released this way by its authors.  You can apply it to\r\n        your programs, too.\r\n        \r\n          When we speak of free software, we are referring to freedom, not\r\n        price.  Our General Public Licenses are designed to make sure that you\r\n        have the freedom to distribute copies of free software (and charge for\r\n        them if you wish), that you receive source code or can get it if you\r\n        want it, that you can change the software or use pieces of it in new\r\n        free programs, and that you know you can do these things.\r\n        \r\n          To protect your rights, we need to prevent others from denying you\r\n        these rights or asking you to surrender the rights.  Therefore, you have\r\n        certain responsibilities if you distribute copies of the software, or if\r\n        you modify it: responsibilities to respect the freedom of others.\r\n        \r\n          For example, if you distribute copies of such a program, whether\r\n        gratis or for a fee, you must pass on to the recipients the same\r\n        freedoms that you received.  You must make sure that they, too, receive\r\n        or can get the source code.  And you must show them these terms so they\r\n        know their rights.\r\n        \r\n          Developers that use the GNU GPL protect your rights with two steps:\r\n        (1) assert copyright on the software, and (2) offer you this License\r\n        giving you legal permission to copy, distribute and/or modify it.\r\n        \r\n          For the developers' and authors' protection, the GPL clearly explains\r\n        that there is no warranty for this free software.  For both users' and\r\n        authors' sake, the GPL requires that modified versions be marked as\r\n        changed, so that their problems will not be attributed erroneously to\r\n        authors of previous versions.\r\n        \r\n          Some devices are designed to deny users access to install or run\r\n        modified versions of the software inside them, although the manufacturer\r\n        can do so.  This is fundamentally incompatible with the aim of\r\n        protecting users' freedom to change the software.  The systematic\r\n        pattern of such abuse occurs in the area of products for individuals to\r\n        use, which is precisely where it is most unacceptable.  Therefore, we\r\n        have designed this version of the GPL to prohibit the practice for those\r\n        products.  If such problems arise substantially in other domains, we\r\n        stand ready to extend this provision to those domains in future versions\r\n        of the GPL, as needed to protect the freedom of users.\r\n        \r\n          Finally, every program is threatened constantly by software patents.\r\n        States should not allow patents to restrict development and use of\r\n        software on general-purpose computers, but in those that do, we wish to\r\n        avoid the special danger that patents applied to a free program could\r\n        make it effectively proprietary.  To prevent this, the GPL assures that\r\n        patents cannot be used to render the program non-free.\r\n        \r\n          The precise terms and conditions for copying, distribution and\r\n        modification follow.\r\n        \r\n                               TERMS AND CONDITIONS\r\n        \r\n          0. Definitions.\r\n        \r\n          \"This License\" refers to version 3 of the GNU General Public License.\r\n        \r\n          \"Copyright\" also means copyright-like laws that apply to other kinds of\r\n        works, such as semiconductor masks.\r\n        \r\n          \"The Program\" refers to any copyrightable work licensed under this\r\n        License.  Each licensee is addressed as \"you\".  \"Licensees\" and\r\n        \"recipients\" may be individuals or organizations.\r\n        \r\n          To \"modify\" a work means to copy from or adapt all or part of the work\r\n        in a fashion requiring copyright permission, other than the making of an\r\n        exact copy.  The resulting work is called a \"modified version\" of the\r\n        earlier work or a work \"based on\" the earlier work.\r\n        \r\n          A \"covered work\" means either the unmodified Program or a work based\r\n        on the Program.\r\n        \r\n          To \"propagate\" a work means to do anything with it that, without\r\n        permission, would make you directly or secondarily liable for\r\n        infringement under applicable copyright law, except executing it on a\r\n        computer or modifying a private copy.  Propagation includes copying,\r\n        distribution (with or without modification), making available to the\r\n        public, and in some countries other activities as well.\r\n        \r\n          To \"convey\" a work means any kind of propagation that enables other\r\n        parties to make or receive copies.  Mere interaction with a user through\r\n        a computer network, with no transfer of a copy, is not conveying.\r\n        \r\n          An interactive user interface displays \"Appropriate Legal Notices\"\r\n        to the extent that it includes a convenient and prominently visible\r\n        feature that (1) displays an appropriate copyright notice, and (2)\r\n        tells the user that there is no warranty for the work (except to the\r\n        extent that warranties are provided), that licensees may convey the\r\n        work under this License, and how to view a copy of this License.  If\r\n        the interface presents a list of user commands or options, such as a\r\n        menu, a prominent item in the list meets this criterion.\r\n        \r\n          1. Source Code.\r\n        \r\n          The \"source code\" for a work means the preferred form of the work\r\n        for making modifications to it.  \"Object code\" means any non-source\r\n        form of a work.\r\n        \r\n          A \"Standard Interface\" means an interface that either is an official\r\n        standard defined by a recognized standards body, or, in the case of\r\n        interfaces specified for a particular programming language, one that\r\n        is widely used among developers working in that language.\r\n        \r\n          The \"System Libraries\" of an executable work include anything, other\r\n        than the work as a whole, that (a) is included in the normal form of\r\n        packaging a Major Component, but which is not part of that Major\r\n        Component, and (b) serves only to enable use of the work with that\r\n        Major Component, or to implement a Standard Interface for which an\r\n        implementation is available to the public in source code form.  A\r\n        \"Major Component\", in this context, means a major essential component\r\n        (kernel, window system, and so on) of the specific operating system\r\n        (if any) on which the executable work runs, or a compiler used to\r\n        produce the work, or an object code interpreter used to run it.\r\n        \r\n          The \"Corresponding Source\" for a work in object code form means all\r\n        the source code needed to generate, install, and (for an executable\r\n        work) run the object code and to modify the work, including scripts to\r\n        control those activities.  However, it does not include the work's\r\n        System Libraries, or general-purpose tools or generally available free\r\n        programs which are used unmodified in performing those activities but\r\n        which are not part of the work.  For example, Corresponding Source\r\n        includes interface definition files associated with source files for\r\n        the work, and the source code for shared libraries and dynamically\r\n        linked subprograms that the work is specifically designed to require,\r\n        such as by intimate data communication or control flow between those\r\n        subprograms and other parts of the work.\r\n        \r\n          The Corresponding Source need not include anything that users\r\n        can regenerate automatically from other parts of the Corresponding\r\n        Source.\r\n        \r\n          The Corresponding Source for a work in source code form is that\r\n        same work.\r\n        \r\n          2. Basic Permissions.\r\n        \r\n          All rights granted under this License are granted for the term of\r\n        copyright on the Program, and are irrevocable provided the stated\r\n        conditions are met.  This License explicitly affirms your unlimited\r\n        permission to run the unmodified Program.  The output from running a\r\n        covered work is covered by this License only if the output, given its\r\n        content, constitutes a covered work.  This License acknowledges your\r\n        rights of fair use or other equivalent, as provided by copyright law.\r\n        \r\n          You may make, run and propagate covered works that you do not\r\n        convey, without conditions so long as your license otherwise remains\r\n        in force.  You may convey covered works to others for the sole purpose\r\n        of having them make modifications exclusively for you, or provide you\r\n        with facilities for running those works, provided that you comply with\r\n        the terms of this License in conveying all material for which you do\r\n        not control copyright.  Those thus making or running the covered works\r\n        for you must do so exclusively on your behalf, under your direction\r\n        and control, on terms that prohibit them from making any copies of\r\n        your copyrighted material outside their relationship with you.\r\n        \r\n          Conveying under any other circumstances is permitted solely under\r\n        the conditions stated below.  Sublicensing is not allowed; section 10\r\n        makes it unnecessary.\r\n        \r\n          3. Protecting Users' Legal Rights From Anti-Circumvention Law.\r\n        \r\n          No covered work shall be deemed part of an effective technological\r\n        measure under any applicable law fulfilling obligations under article\r\n        11 of the WIPO copyright treaty adopted on 20 December 1996, or\r\n        similar laws prohibiting or restricting circumvention of such\r\n        measures.\r\n        \r\n          When you convey a covered work, you waive any legal power to forbid\r\n        circumvention of technological measures to the extent such circumvention\r\n        is effected by exercising rights under this License with respect to\r\n        the covered work, and you disclaim any intention to limit operation or\r\n        modification of the work as a means of enforcing, against the work's\r\n        users, your or third parties' legal rights to forbid circumvention of\r\n        technological measures.\r\n        \r\n          4. Conveying Verbatim Copies.\r\n        \r\n          You may convey verbatim copies of the Program's source code as you\r\n        receive it, in any medium, provided that you conspicuously and\r\n        appropriately publish on each copy an appropriate copyright notice;\r\n        keep intact all notices stating that this License and any\r\n        non-permissive terms added in accord with section 7 apply to the code;\r\n        keep intact all notices of the absence of any warranty; and give all\r\n        recipients a copy of this License along with the Program.\r\n        \r\n          You may charge any price or no price for each copy that you convey,\r\n        and you may offer support or warranty protection for a fee.\r\n        \r\n          5. Conveying Modified Source Versions.\r\n        \r\n          You may convey a work based on the Program, or the modifications to\r\n        produce it from the Program, in the form of source code under the\r\n        terms of section 4, provided that you also meet all of these conditions:\r\n        \r\n            a) The work must carry prominent notices stating that you modified\r\n            it, and giving a relevant date.\r\n        \r\n            b) The work must carry prominent notices stating that it is\r\n            released under this License and any conditions added under section\r\n            7.  This requirement modifies the requirement in section 4 to\r\n            \"keep intact all notices\".\r\n        \r\n            c) You must license the entire work, as a whole, under this\r\n            License to anyone who comes into possession of a copy.  This\r\n            License will therefore apply, along with any applicable section 7\r\n            additional terms, to the whole of the work, and all its parts,\r\n            regardless of how they are packaged.  This License gives no\r\n            permission to license the work in any other way, but it does not\r\n            invalidate such permission if you have separately received it.\r\n        \r\n            d) If the work has interactive user interfaces, each must display\r\n            Appropriate Legal Notices; however, if the Program has interactive\r\n            interfaces that do not display Appropriate Legal Notices, your\r\n            work need not make them do so.\r\n        \r\n          A compilation of a covered work with other separate and independent\r\n        works, which are not by their nature extensions of the covered work,\r\n        and which are not combined with it such as to form a larger program,\r\n        in or on a volume of a storage or distribution medium, is called an\r\n        \"aggregate\" if the compilation and its resulting copyright are not\r\n        used to limit the access or legal rights of the compilation's users\r\n        beyond what the individual works permit.  Inclusion of a covered work\r\n        in an aggregate does not cause this License to apply to the other\r\n        parts of the aggregate.\r\n        \r\n          6. Conveying Non-Source Forms.\r\n        \r\n          You may convey a covered work in object code form under the terms\r\n        of sections 4 and 5, provided that you also convey the\r\n        machine-readable Corresponding Source under the terms of this License,\r\n        in one of these ways:\r\n        \r\n            a) Convey the object code in, or embodied in, a physical product\r\n            (including a physical distribution medium), accompanied by the\r\n            Corresponding Source fixed on a durable physical medium\r\n            customarily used for software interchange.\r\n        \r\n            b) Convey the object code in, or embodied in, a physical product\r\n            (including a physical distribution medium), accompanied by a\r\n            written offer, valid for at least three years and valid for as\r\n            long as you offer spare parts or customer support for that product\r\n            model, to give anyone who possesses the object code either (1) a\r\n            copy of the Corresponding Source for all the software in the\r\n            product that is covered by this License, on a durable physical\r\n            medium customarily used for software interchange, for a price no\r\n            more than your reasonable cost of physically performing this\r\n            conveying of source, or (2) access to copy the\r\n            Corresponding Source from a network server at no charge.\r\n        \r\n            c) Convey individual copies of the object code with a copy of the\r\n            written offer to provide the Corresponding Source.  This\r\n            alternative is allowed only occasionally and noncommercially, and\r\n            only if you received the object code with such an offer, in accord\r\n            with subsection 6b.\r\n        \r\n            d) Convey the object code by offering access from a designated\r\n            place (gratis or for a charge), and offer equivalent access to the\r\n            Corresponding Source in the same way through the same place at no\r\n            further charge.  You need not require recipients to copy the\r\n            Corresponding Source along with the object code.  If the place to\r\n            copy the object code is a network server, the Corresponding Source\r\n            may be on a different server (operated by you or a third party)\r\n            that supports equivalent copying facilities, provided you maintain\r\n            clear directions next to the object code saying where to find the\r\n            Corresponding Source.  Regardless of what server hosts the\r\n            Corresponding Source, you remain obligated to ensure that it is\r\n            available for as long as needed to satisfy these requirements.\r\n        \r\n            e) Convey the object code using peer-to-peer transmission, provided\r\n            you inform other peers where the object code and Corresponding\r\n            Source of the work are being offered to the general public at no\r\n            charge under subsection 6d.\r\n        \r\n          A separable portion of the object code, whose source code is excluded\r\n        from the Corresponding Source as a System Library, need not be\r\n        included in conveying the object code work.\r\n        \r\n          A \"User Product\" is either (1) a \"consumer product\", which means any\r\n        tangible personal property which is normally used for personal, family,\r\n        or household purposes, or (2) anything designed or sold for incorporation\r\n        into a dwelling.  In determining whether a product is a consumer product,\r\n        doubtful cases shall be resolved in favor of coverage.  For a particular\r\n        product received by a particular user, \"normally used\" refers to a\r\n        typical or common use of that class of product, regardless of the status\r\n        of the particular user or of the way in which the particular user\r\n        actually uses, or expects or is expected to use, the product.  A product\r\n        is a consumer product regardless of whether the product has substantial\r\n        commercial, industrial or non-consumer uses, unless such uses represent\r\n        the only significant mode of use of the product.\r\n        \r\n          \"Installation Information\" for a User Product means any methods,\r\n        procedures, authorization keys, or other information required to install\r\n        and execute modified versions of a covered work in that User Product from\r\n        a modified version of its Corresponding Source.  The information must\r\n        suffice to ensure that the continued functioning of the modified object\r\n        code is in no case prevented or interfered with solely because\r\n        modification has been made.\r\n        \r\n          If you convey an object code work under this section in, or with, or\r\n        specifically for use in, a User Product, and the conveying occurs as\r\n        part of a transaction in which the right of possession and use of the\r\n        User Product is transferred to the recipient in perpetuity or for a\r\n        fixed term (regardless of how the transaction is characterized), the\r\n        Corresponding Source conveyed under this section must be accompanied\r\n        by the Installation Information.  But this requirement does not apply\r\n        if neither you nor any third party retains the ability to install\r\n        modified object code on the User Product (for example, the work has\r\n        been installed in ROM).\r\n        \r\n          The requirement to provide Installation Information does not include a\r\n        requirement to continue to provide support service, warranty, or updates\r\n        for a work that has been modified or installed by the recipient, or for\r\n        the User Product in which it has been modified or installed.  Access to a\r\n        network may be denied when the modification itself materially and\r\n        adversely affects the operation of the network or violates the rules and\r\n        protocols for communication across the network.\r\n        \r\n          Corresponding Source conveyed, and Installation Information provided,\r\n        in accord with this section must be in a format that is publicly\r\n        documented (and with an implementation available to the public in\r\n        source code form), and must require no special password or key for\r\n        unpacking, reading or copying.\r\n        \r\n          7. Additional Terms.\r\n        \r\n          \"Additional permissions\" are terms that supplement the terms of this\r\n        License by making exceptions from one or more of its conditions.\r\n        Additional permissions that are applicable to the entire Program shall\r\n        be treated as though they were included in this License, to the extent\r\n        that they are valid under applicable law.  If additional permissions\r\n        apply only to part of the Program, that part may be used separately\r\n        under those permissions, but the entire Program remains governed by\r\n        this License without regard to the additional permissions.\r\n        \r\n          When you convey a copy of a covered work, you may at your option\r\n        remove any additional permissions from that copy, or from any part of\r\n        it.  (Additional permissions may be written to require their own\r\n        removal in certain cases when you modify the work.)  You may place\r\n        additional permissions on material, added by you to a covered work,\r\n        for which you have or can give appropriate copyright permission.\r\n        \r\n          Notwithstanding any other provision of this License, for material you\r\n        add to a covered work, you may (if authorized by the copyright holders of\r\n        that material) supplement the terms of this License with terms:\r\n        \r\n            a) Disclaiming warranty or limiting liability differently from the\r\n            terms of sections 15 and 16 of this License; or\r\n        \r\n            b) Requiring preservation of specified reasonable legal notices or\r\n            author attributions in that material or in the Appropriate Legal\r\n            Notices displayed by works containing it; or\r\n        \r\n            c) Prohibiting misrepresentation of the origin of that material, or\r\n            requiring that modified versions of such material be marked in\r\n            reasonable ways as different from the original version; or\r\n        \r\n            d) Limiting the use for publicity purposes of names of licensors or\r\n            authors of the material; or\r\n        \r\n            e) Declining to grant rights under trademark law for use of some\r\n            trade names, trademarks, or service marks; or\r\n        \r\n            f) Requiring indemnification of licensors and authors of that\r\n            material by anyone who conveys the material (or modified versions of\r\n            it) with contractual assumptions of liability to the recipient, for\r\n            any liability that these contractual assumptions directly impose on\r\n            those licensors and authors.\r\n        \r\n          All other non-permissive additional terms are considered \"further\r\n        restrictions\" within the meaning of section 10.  If the Program as you\r\n        received it, or any part of it, contains a notice stating that it is\r\n        governed by this License along with a term that is a further\r\n        restriction, you may remove that term.  If a license document contains\r\n        a further restriction but permits relicensing or conveying under this\r\n        License, you may add to a covered work material governed by the terms\r\n        of that license document, provided that the further restriction does\r\n        not survive such relicensing or conveying.\r\n        \r\n          If you add terms to a covered work in accord with this section, you\r\n        must place, in the relevant source files, a statement of the\r\n        additional terms that apply to those files, or a notice indicating\r\n        where to find the applicable terms.\r\n        \r\n          Additional terms, permissive or non-permissive, may be stated in the\r\n        form of a separately written license, or stated as exceptions;\r\n        the above requirements apply either way.\r\n        \r\n          8. Termination.\r\n        \r\n          You may not propagate or modify a covered work except as expressly\r\n        provided under this License.  Any attempt otherwise to propagate or\r\n        modify it is void, and will automatically terminate your rights under\r\n        this License (including any patent licenses granted under the third\r\n        paragraph of section 11).\r\n        \r\n          However, if you cease all violation of this License, then your\r\n        license from a particular copyright holder is reinstated (a)\r\n        provisionally, unless and until the copyright holder explicitly and\r\n        finally terminates your license, and (b) permanently, if the copyright\r\n        holder fails to notify you of the violation by some reasonable means\r\n        prior to 60 days after the cessation.\r\n        \r\n          Moreover, your license from a particular copyright holder is\r\n        reinstated permanently if the copyright holder notifies you of the\r\n        violation by some reasonable means, this is the first time you have\r\n        received notice of violation of this License (for any work) from that\r\n        copyright holder, and you cure the violation prior to 30 days after\r\n        your receipt of the notice.\r\n        \r\n          Termination of your rights under this section does not terminate the\r\n        licenses of parties who have received copies or rights from you under\r\n        this License.  If your rights have been terminated and not permanently\r\n        reinstated, you do not qualify to receive new licenses for the same\r\n        material under section 10.\r\n        \r\n          9. Acceptance Not Required for Having Copies.\r\n        \r\n          You are not required to accept this License in order to receive or\r\n        run a copy of the Program.  Ancillary propagation of a covered work\r\n        occurring solely as a consequence of using peer-to-peer transmission\r\n        to receive a copy likewise does not require acceptance.  However,\r\n        nothing other than this License grants you permission to propagate or\r\n        modify any covered work.  These actions infringe copyright if you do\r\n        not accept this License.  Therefore, by modifying or propagating a\r\n        covered work, you indicate your acceptance of this License to do so.\r\n        \r\n          10. Automatic Licensing of Downstream Recipients.\r\n        \r\n          Each time you convey a covered work, the recipient automatically\r\n        receives a license from the original licensors, to run, modify and\r\n        propagate that work, subject to this License.  You are not responsible\r\n        for enforcing compliance by third parties with this License.\r\n        \r\n          An \"entity transaction\" is a transaction transferring control of an\r\n        organization, or substantially all assets of one, or subdividing an\r\n        organization, or merging organizations.  If propagation of a covered\r\n        work results from an entity transaction, each party to that\r\n        transaction who receives a copy of the work also receives whatever\r\n        licenses to the work the party's predecessor in interest had or could\r\n        give under the previous paragraph, plus a right to possession of the\r\n        Corresponding Source of the work from the predecessor in interest, if\r\n        the predecessor has it or can get it with reasonable efforts.\r\n        \r\n          You may not impose any further restrictions on the exercise of the\r\n        rights granted or affirmed under this License.  For example, you may\r\n        not impose a license fee, royalty, or other charge for exercise of\r\n        rights granted under this License, and you may not initiate litigation\r\n        (including a cross-claim or counterclaim in a lawsuit) alleging that\r\n        any patent claim is infringed by making, using, selling, offering for\r\n        sale, or importing the Program or any portion of it.\r\n        \r\n          11. Patents.\r\n        \r\n          A \"contributor\" is a copyright holder who authorizes use under this\r\n        License of the Program or a work on which the Program is based.  The\r\n        work thus licensed is called the contributor's \"contributor version\".\r\n        \r\n          A contributor's \"essential patent claims\" are all patent claims\r\n        owned or controlled by the contributor, whether already acquired or\r\n        hereafter acquired, that would be infringed by some manner, permitted\r\n        by this License, of making, using, or selling its contributor version,\r\n        but do not include claims that would be infringed only as a\r\n        consequence of further modification of the contributor version.  For\r\n        purposes of this definition, \"control\" includes the right to grant\r\n        patent sublicenses in a manner consistent with the requirements of\r\n        this License.\r\n        \r\n          Each contributor grants you a non-exclusive, worldwide, royalty-free\r\n        patent license under the contributor's essential patent claims, to\r\n        make, use, sell, offer for sale, import and otherwise run, modify and\r\n        propagate the contents of its contributor version.\r\n        \r\n          In the following three paragraphs, a \"patent license\" is any express\r\n        agreement or commitment, however denominated, not to enforce a patent\r\n        (such as an express permission to practice a patent or covenant not to\r\n        sue for patent infringement).  To \"grant\" such a patent license to a\r\n        party means to make such an agreement or commitment not to enforce a\r\n        patent against the party.\r\n        \r\n          If you convey a covered work, knowingly relying on a patent license,\r\n        and the Corresponding Source of the work is not available for anyone\r\n        to copy, free of charge and under the terms of this License, through a\r\n        publicly available network server or other readily accessible means,\r\n        then you must either (1) cause the Corresponding Source to be so\r\n        available, or (2) arrange to deprive yourself of the benefit of the\r\n        patent license for this particular work, or (3) arrange, in a manner\r\n        consistent with the requirements of this License, to extend the patent\r\n        license to downstream recipients.  \"Knowingly relying\" means you have\r\n        actual knowledge that, but for the patent license, your conveying the\r\n        covered work in a country, or your recipient's use of the covered work\r\n        in a country, would infringe one or more identifiable patents in that\r\n        country that you have reason to believe are valid.\r\n        \r\n          If, pursuant to or in connection with a single transaction or\r\n        arrangement, you convey, or propagate by procuring conveyance of, a\r\n        covered work, and grant a patent license to some of the parties\r\n        receiving the covered work authorizing them to use, propagate, modify\r\n        or convey a specific copy of the covered work, then the patent license\r\n        you grant is automatically extended to all recipients of the covered\r\n        work and works based on it.\r\n        \r\n          A patent license is \"discriminatory\" if it does not include within\r\n        the scope of its coverage, prohibits the exercise of, or is\r\n        conditioned on the non-exercise of one or more of the rights that are\r\n        specifically granted under this License.  You may not convey a covered\r\n        work if you are a party to an arrangement with a third party that is\r\n        in the business of distributing software, under which you make payment\r\n        to the third party based on the extent of your activity of conveying\r\n        the work, and under which the third party grants, to any of the\r\n        parties who would receive the covered work from you, a discriminatory\r\n        patent license (a) in connection with copies of the covered work\r\n        conveyed by you (or copies made from those copies), or (b) primarily\r\n        for and in connection with specific products or compilations that\r\n        contain the covered work, unless you entered into that arrangement,\r\n        or that patent license was granted, prior to 28 March 2007.\r\n        \r\n          Nothing in this License shall be construed as excluding or limiting\r\n        any implied license or other defenses to infringement that may\r\n        otherwise be available to you under applicable patent law.\r\n        \r\n          12. No Surrender of Others' Freedom.\r\n        \r\n          If conditions are imposed on you (whether by court order, agreement or\r\n        otherwise) that contradict the conditions of this License, they do not\r\n        excuse you from the conditions of this License.  If you cannot convey a\r\n        covered work so as to satisfy simultaneously your obligations under this\r\n        License and any other pertinent obligations, then as a consequence you may\r\n        not convey it at all.  For example, if you agree to terms that obligate you\r\n        to collect a royalty for further conveying from those to whom you convey\r\n        the Program, the only way you could satisfy both those terms and this\r\n        License would be to refrain entirely from conveying the Program.\r\n        \r\n          13. Use with the GNU Affero General Public License.\r\n        \r\n          Notwithstanding any other provision of this License, you have\r\n        permission to link or combine any covered work with a work licensed\r\n        under version 3 of the GNU Affero General Public License into a single\r\n        combined work, and to convey the resulting work.  The terms of this\r\n        License will continue to apply to the part which is the covered work,\r\n        but the special requirements of the GNU Affero General Public License,\r\n        section 13, concerning interaction through a network will apply to the\r\n        combination as such.\r\n        \r\n          14. Revised Versions of this License.\r\n        \r\n          The Free Software Foundation may publish revised and/or new versions of\r\n        the GNU General Public License from time to time.  Such new versions will\r\n        be similar in spirit to the present version, but may differ in detail to\r\n        address new problems or concerns.\r\n        \r\n          Each version is given a distinguishing version number.  If the\r\n        Program specifies that a certain numbered version of the GNU General\r\n        Public License \"or any later version\" applies to it, you have the\r\n        option of following the terms and conditions either of that numbered\r\n        version or of any later version published by the Free Software\r\n        Foundation.  If the Program does not specify a version number of the\r\n        GNU General Public License, you may choose any version ever published\r\n        by the Free Software Foundation.\r\n        \r\n          If the Program specifies that a proxy can decide which future\r\n        versions of the GNU General Public License can be used, that proxy's\r\n        public statement of acceptance of a version permanently authorizes you\r\n        to choose that version for the Program.\r\n        \r\n          Later license versions may give you additional or different\r\n        permissions.  However, no additional obligations are imposed on any\r\n        author or copyright holder as a result of your choosing to follow a\r\n        later version.\r\n        \r\n          15. Disclaimer of Warranty.\r\n        \r\n          THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\r\n        APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\r\n        HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\r\n        OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\r\n        THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\r\n        PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\r\n        IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\r\n        ALL NECESSARY SERVICING, REPAIR OR CORRECTION.\r\n        \r\n          16. Limitation of Liability.\r\n        \r\n          IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\r\n        WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\r\n        THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\r\n        GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\r\n        USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\r\n        DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\r\n        PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\r\n        EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\r\n        SUCH DAMAGES.\r\n        \r\n          17. Interpretation of Sections 15 and 16.\r\n        \r\n          If the disclaimer of warranty and limitation of liability provided\r\n        above cannot be given local legal effect according to their terms,\r\n        reviewing courts shall apply local law that most closely approximates\r\n        an absolute waiver of all civil liability in connection with the\r\n        Program, unless a warranty or assumption of liability accompanies a\r\n        copy of the Program in return for a fee.\r\n        \r\n                             END OF TERMS AND CONDITIONS\r\n        \r\n                    How to Apply These Terms to Your New Programs\r\n        \r\n          If you develop a new program, and you want it to be of the greatest\r\n        possible use to the public, the best way to achieve this is to make it\r\n        free software which everyone can redistribute and change under these terms.\r\n        \r\n          To do so, attach the following notices to the program.  It is safest\r\n        to attach them to the start of each source file to most effectively\r\n        state the exclusion of warranty; and each file should have at least\r\n        the \"copyright\" line and a pointer to where the full notice is found.\r\n        \r\n            <one line to give the program's name and a brief idea of what it does.>\r\n            Copyright (C) <year>  <name of author>\r\n        \r\n            This program is free software: you can redistribute it and/or modify\r\n            it under the terms of the GNU General Public License as published by\r\n            the Free Software Foundation, either version 3 of the License, or\r\n            (at your option) any later version.\r\n        \r\n            This program is distributed in the hope that it will be useful,\r\n            but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n            MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r\n            GNU General Public License for more details.\r\n        \r\n            You should have received a copy of the GNU General Public License\r\n            along with this program.  If not, see <https://www.gnu.org/licenses/>.\r\n        \r\n        Also add information on how to contact you by electronic and paper mail.\r\n        \r\n          If the program does terminal interaction, make it output a short\r\n        notice like this when it starts in an interactive mode:\r\n        \r\n            <program>  Copyright (C) <year>  <name of author>\r\n            This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\r\n            This is free software, and you are welcome to redistribute it\r\n            under certain conditions; type `show c' for details.\r\n        \r\n        The hypothetical commands `show w' and `show c' should show the appropriate\r\n        parts of the General Public License.  Of course, your program's commands\r\n        might be different; for a GUI interface, you would use an \"about box\".\r\n        \r\n          You should also get your employer (if you work as a programmer) or school,\r\n        if any, to sign a \"copyright disclaimer\" for the program, if necessary.\r\n        For more information on this, and how to apply and follow the GNU GPL, see\r\n        <https://www.gnu.org/licenses/>.\r\n        \r\n          The GNU General Public License does not permit incorporating your program\r\n        into proprietary programs.  If your program is a subroutine library, you\r\n        may consider it more useful to permit linking proprietary applications with\r\n        the library.  If this is what you want to do, use the GNU Lesser General\r\n        Public License instead of this License.  But first, please read\r\n        <https://www.gnu.org/licenses/why-not-lgpl.html>.",
    "summary": "Implementation of optimisation analytics for constructing and backtesting optimal portfolios in Python",
    "version": "3.4.1",
    "project_urls": {
        "Changelog": "https://github.com/ArturSepp/OptimalPortfolios/blob/master/CHANGELOG.md",
        "Documentation": "https://github.com/ArturSepp/OptimalPortfolios/blob/master/README.md",
        "Homepage": "https://github.com/ArturSepp/OptimalPortfolios",
        "Issues": "https://github.com/ArturSepp/OptimalPortfolios/issues",
        "Repository": "https://github.com/ArturSepp/OptimalPortfolios.git"
    },
    "split_keywords": [
        "portfolio optimization",
        " quantitative finance",
        " optimal portfolios",
        " mean variance optimization",
        " risk budgeting",
        " portfolio backtesting",
        " financial optimization",
        " asset allocation",
        " portfolio analytics",
        " maximum diversification",
        " equal risk contribution",
        " minimum variance",
        " systematic strategies",
        " investment strategies",
        " covariance estimation",
        " ewma",
        " lasso regularization"
    ],
    "urls": [
        {
            "comment_text": null,
            "digests": {
                "blake2b_256": "ad9ea77ccb34cd751cc8a055eb76bc88d4de3fb3a8fd13e5ebddbeafcc8a8f56",
                "md5": "16b0a54306aca2533b63812bf09b46fb",
                "sha256": "686178de17fd087373ddbe65a6ce05faca2a31cd6904c725ddeb94a2fa5c8f8e"
            },
            "downloads": -1,
            "filename": "optimalportfolios-3.4.1.tar.gz",
            "has_sig": false,
            "md5_digest": "16b0a54306aca2533b63812bf09b46fb",
            "packagetype": "sdist",
            "python_version": "source",
            "requires_python": ">=3.8",
            "size": 976449,
            "upload_time": "2025-08-03T10:11:55",
            "upload_time_iso_8601": "2025-08-03T10:11:55.970446Z",
            "url": "https://files.pythonhosted.org/packages/ad/9e/a77ccb34cd751cc8a055eb76bc88d4de3fb3a8fd13e5ebddbeafcc8a8f56/optimalportfolios-3.4.1.tar.gz",
            "yanked": false,
            "yanked_reason": null
        }
    ],
    "upload_time": "2025-08-03 10:11:55",
    "github": true,
    "gitlab": false,
    "bitbucket": false,
    "codeberg": false,
    "github_user": "ArturSepp",
    "github_project": "OptimalPortfolios",
    "travis_ci": false,
    "coveralls": false,
    "github_actions": false,
    "requirements": [
        {
            "name": "numba",
            "specs": [
                [
                    ">=",
                    "0.60.0"
                ]
            ]
        },
        {
            "name": "numpy",
            "specs": [
                [
                    "==",
                    "2.2.6"
                ]
            ]
        },
        {
            "name": "scipy",
            "specs": [
                [
                    ">=",
                    "1.15.0"
                ]
            ]
        },
        {
            "name": "statsmodels",
            "specs": [
                [
                    ">=",
                    "0.14.0"
                ]
            ]
        },
        {
            "name": "pandas",
            "specs": [
                [
                    ">=",
                    "2.3.1"
                ]
            ]
        },
        {
            "name": "matplotlib",
            "specs": [
                [
                    ">=",
                    "3.9.0"
                ]
            ]
        },
        {
            "name": "seaborn",
            "specs": [
                [
                    ">=",
                    "0.13.0"
                ]
            ]
        },
        {
            "name": "openpyxl",
            "specs": [
                [
                    ">=",
                    "3.1.0"
                ]
            ]
        },
        {
            "name": "PyYAML",
            "specs": [
                [
                    ">=",
                    "6.0"
                ]
            ]
        },
        {
            "name": "easydev",
            "specs": [
                [
                    ">=",
                    "0.12.0"
                ]
            ]
        },
        {
            "name": "pyarrow",
            "specs": [
                [
                    ">=",
                    "18.0.0"
                ]
            ]
        },
        {
            "name": "fsspec",
            "specs": [
                [
                    ">=",
                    "2024.12.0"
                ]
            ]
        },
        {
            "name": "yfinance",
            "specs": [
                [
                    ">=",
                    "0.2.65"
                ]
            ]
        },
        {
            "name": "pandas-datareader",
            "specs": [
                [
                    ">=",
                    "0.10.0"
                ]
            ]
        },
        {
            "name": "cvxpy",
            "specs": [
                [
                    ">=",
                    "1.7.0"
                ]
            ]
        },
        {
            "name": "ecos",
            "specs": [
                [
                    ">=",
                    "2.0.0"
                ]
            ]
        },
        {
            "name": "quadprog",
            "specs": [
                [
                    ">=",
                    "0.1.11"
                ]
            ]
        },
        {
            "name": "scikit-learn",
            "specs": [
                [
                    ">=",
                    "1.7.0"
                ]
            ]
        },
        {
            "name": "qis",
            "specs": [
                [
                    ">=",
                    "3.3.3"
                ]
            ]
        }
    ],
    "lcname": "optimalportfolios"
}