{"id":14977192,"url":"https://github.com/rfsantacruz/cvx-nb","last_synced_at":"2025-07-06T15:33:49.823Z","repository":{"id":83820291,"uuid":"88237514","full_name":"rfsantacruz/cvx-nb","owner":"rfsantacruz","description":"IPython Notebooks of Convex Optimization Problems","archived":false,"fork":false,"pushed_at":"2023-11-09T08:34:16.000Z","size":113,"stargazers_count":13,"open_issues_count":1,"forks_count":12,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-09-28T23:40:55.898Z","etag":null,"topics":["convex-optimization","cvxpy","ipython-notebook","optimization","python"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rfsantacruz.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-04-14T05:54:44.000Z","updated_at":"2024-09-13T01:57:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"80f64ed4-1293-4375-a70f-f043367b3fa4","html_url":"https://github.com/rfsantacruz/cvx-nb","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rfsantacruz%2Fcvx-nb","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rfsantacruz%2Fcvx-nb/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rfsantacruz%2Fcvx-nb/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rfsantacruz%2Fcvx-nb/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rfsantacruz","download_url":"https://codeload.github.com/rfsantacruz/cvx-nb/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":219860225,"owners_count":16556023,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["convex-optimization","cvxpy","ipython-notebook","optimization","python"],"created_at":"2024-09-24T13:55:16.149Z","updated_at":"2024-10-11T15:40:22.727Z","avatar_url":"https://github.com/rfsantacruz.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# cvx-nb: Convex Optimization Notebooks\nThis repository contains a set of IPython Notebooks with solution for interesting optimization problems. Some of the problems and data are from the book, [Convex Optimization](http://stanford.edu/~boyd/cvxbook/) by Stephen Boyd and Lieven Vandenberghe.\n\n## Requirements:\nThe notebooks are developed with:\n* Python 3\n* Numpy\n* SciPy\n* Pandas\n* CVXOPT\n* CVXPY\n\nThese libraries can be easily installed using Anaconda and Pip.\n\n## Notebooks\n1. [Activity Level Problem](./OptimalActivityLevel.ipynb): Solution to a trivial economic activity level problem. \n2. [Illumination Problem](./Illumination.ipynb): Approximate and exact solutions for a toy example about how to choose the bounded power of lamps to illuminate a indoor space.\n3. [Doubly Stochastic Approximation](./DoublyStochasticApproximation.ipynb): How to find the closest doubly stochastic matrix from a given arbitrary matrix.\n4. [Complex Least Norm](./ComplexLeastNorm.ipynb): The classical least norm problem in the complex domain.\n5. [Minimum Fuel Optimal Control](./MinimumFuelOptimalControl.ipynb): Minimization of fuel consuption in a simple dynamic linear system.\n6. [Portfolio Optimization](./SimplePortfolioOptimization.ipynb): Risk-minimization and risk-return trade-off curves on the classical portfolio optimization problem. \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frfsantacruz%2Fcvx-nb","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frfsantacruz%2Fcvx-nb","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frfsantacruz%2Fcvx-nb/lists"}