| Name | paref JSON |
| Version |
0.2.0
JSON |
| download |
| home_page | |
| Summary | Pareto reflection based multi-objective optimization |
| upload_time | 2024-02-24 19:58:13 |
| maintainer | |
| docs_url | None |
| author | Nicolai Palm |
| requires_python | >=3.10 |
| license | MIT |
| keywords |
|
| VCS |
|
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
[](https://github.com/nicolaipalm/paref/actions/workflows/python-test.yml)
[](https://www.python.org/downloads/)
[documentation](https://paref.readthedocs.io/en/latest/)//[notebooks](https://github.com/nicolaipalm/paref/tree/main/docs/notebooks)//[demo]()//[paper](https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4668407)
# Paref - problem tailored MOO for expensive black-box functions
A multi-objective optimization (MOO) problem comes with an idea of what properties the identified
(Pareto) points must satisfy.
The fact that these properties are satisfied is what makes a MOO successful in the first place.
Why not construct MOO algorithms that search for exactly these properties and,
by their very nature, use only a minimum number of evaluations?
With the language of PAreto REFlections this is now possible.
This package contains...
- a series of ready-to-use [MOO algorithms](https://github.com/nicolaipalm/paref/tree/main/paref/moo_algorithms)
corresponding to frequently targeted properties
- a framework for you to implement your problem tailored MOO algorithm
- generic and intuitive [interfaces](https://github.com/nicolaipalm/paref/tree/main/paref/interfaces) for MOO
algorithms, black-box functions and more, so solving a MOO problem with user-defined properties with Paref requires
only minimal effort
See the official [documentation](https://paref.readthedocs.io/en/latest/) for more information.
The official release is available at PyPi:
```
pip install paref
```
Raw data
{
"_id": null,
"home_page": "",
"name": "paref",
"maintainer": "",
"docs_url": null,
"requires_python": ">=3.10",
"maintainer_email": "",
"keywords": "",
"author": "Nicolai Palm",
"author_email": "nicolaipalm@googlemail.com",
"download_url": "https://files.pythonhosted.org/packages/87/fa/cfae217f0b26dd6b0b2600b9fab38d8afa90f456a7d919d510eb3f906899/paref-0.2.0.tar.gz",
"platform": null,
"description": "[](https://github.com/nicolaipalm/paref/actions/workflows/python-test.yml)\n[](https://www.python.org/downloads/)\n\n[documentation](https://paref.readthedocs.io/en/latest/)//[notebooks](https://github.com/nicolaipalm/paref/tree/main/docs/notebooks)//[demo]()//[paper](https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4668407)\n\n# Paref - problem tailored MOO for expensive black-box functions\n\nA multi-objective optimization (MOO) problem comes with an idea of what properties the identified\n(Pareto) points must satisfy.\nThe fact that these properties are satisfied is what makes a MOO successful in the first place.\nWhy not construct MOO algorithms that search for exactly these properties and,\nby their very nature, use only a minimum number of evaluations?\nWith the language of PAreto REFlections this is now possible.\nThis package contains...\n\n- a series of ready-to-use [MOO algorithms](https://github.com/nicolaipalm/paref/tree/main/paref/moo_algorithms)\n corresponding to frequently targeted properties\n- a framework for you to implement your problem tailored MOO algorithm\n- generic and intuitive [interfaces](https://github.com/nicolaipalm/paref/tree/main/paref/interfaces) for MOO\n algorithms, black-box functions and more, so solving a MOO problem with user-defined properties with Paref requires\n only minimal effort\n\nSee the official [documentation](https://paref.readthedocs.io/en/latest/) for more information.\n\nThe official release is available at PyPi:\n\n```\npip install paref\n```\n",
"bugtrack_url": null,
"license": "MIT",
"summary": "Pareto reflection based multi-objective optimization",
"version": "0.2.0",
"project_urls": null,
"split_keywords": [],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "427a56b01c2bddb15f155210ced1c9004111d4204aaa7dc9a88a9a43eb28fc39",
"md5": "ed8eb27c53f071c2beb37967d90d7081",
"sha256": "38a0286717d799f093053fa56851d6e11feda62e938582d3ead1fda6097b34f2"
},
"downloads": -1,
"filename": "paref-0.2.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "ed8eb27c53f071c2beb37967d90d7081",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.10",
"size": 60492,
"upload_time": "2024-02-24T19:58:11",
"upload_time_iso_8601": "2024-02-24T19:58:11.673391Z",
"url": "https://files.pythonhosted.org/packages/42/7a/56b01c2bddb15f155210ced1c9004111d4204aaa7dc9a88a9a43eb28fc39/paref-0.2.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "87facfae217f0b26dd6b0b2600b9fab38d8afa90f456a7d919d510eb3f906899",
"md5": "54cfdbd4d08ab2cd21f83e362989bea5",
"sha256": "ce32f54761664bad43aa3679ade8cbc5a5ac8bcad076ff60912d85dceeb0a815"
},
"downloads": -1,
"filename": "paref-0.2.0.tar.gz",
"has_sig": false,
"md5_digest": "54cfdbd4d08ab2cd21f83e362989bea5",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.10",
"size": 36454,
"upload_time": "2024-02-24T19:58:13",
"upload_time_iso_8601": "2024-02-24T19:58:13.410060Z",
"url": "https://files.pythonhosted.org/packages/87/fa/cfae217f0b26dd6b0b2600b9fab38d8afa90f456a7d919d510eb3f906899/paref-0.2.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-02-24 19:58:13",
"github": false,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"lcname": "paref"
}
