{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"Clarabel.jl","owner":"oxfordcontrol","isFork":false,"description":"Clarabel.jl: Interior-point solver for convex conic optimisation problems in Julia.","topicNames":["linear-programming","julia-language","semidefinite-programming","optimization-algorithms","quadratic-programming","convex-optimization","interior-point-method","conic-programs","conic-optimization","optimization"],"topicsNotShown":0,"allTopics":["linear-programming","julia-language","semidefinite-programming","optimization-algorithms","quadratic-programming","convex-optimization","interior-point-method","conic-programs","conic-optimization","optimization"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":2,"starsCount":157,"forksCount":16,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-22T07:59:33.062Z"}},{"type":"Public","name":"ClarabelDocs","owner":"oxfordcontrol","isFork":false,"description":"Documentation for the Clarabel interior point conic solver","topicNames":["optimization","linear-programming","julia-language","semidefinite-programming","optimization-algorithms","quadratic-programming","convex-optimization","interior-point-method","conic-programs","conic-optimization"],"topicsNotShown":0,"allTopics":["optimization","linear-programming","julia-language","semidefinite-programming","optimization-algorithms","quadratic-programming","convex-optimization","interior-point-method","conic-programs","conic-optimization"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":4,"starsCount":13,"forksCount":5,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-22T08:40:48.214Z"}},{"type":"Public","name":"ClarabelBenchmarks","owner":"oxfordcontrol","isFork":false,"description":"Benchmark tests for Clarabel solver","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-20T21:55:32.306Z"}},{"type":"Public","name":"COSMO.jl","owner":"oxfordcontrol","isFork":false,"description":"COSMO: Accelerated ADMM-based solver for convex conic optimisation problems (LP, QP, SOCP, SDP, ExpCP, PowCP). Automatic chordal decomposition of sparse semidefinite programs.","topicNames":["optimization","solver","julia-language","semidefinite-programming","convex-optimization","conic-programs","sdp"],"topicsNotShown":0,"allTopics":["optimization","solver","julia-language","semidefinite-programming","convex-optimization","conic-programs","sdp"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":10,"starsCount":277,"forksCount":41,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-07T09:52:03.143Z"}},{"type":"Public","name":"SwitchTimeOpt.jl","owner":"oxfordcontrol","isFork":false,"description":"SwitchTimeOpt.jl - Switching Time Optimization in Julia","topicNames":["switched-systems","optimization","julia"],"topicsNotShown":0,"allTopics":["switched-systems","optimization","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":13,"forksCount":8,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-01T13:04:29.895Z"}},{"type":"Public","name":"CDCS.jl","owner":"oxfordcontrol","isFork":false,"description":"Julia wrapper for CDCS (<a href=\"https://github.com/oxfordcontrol/CDCS/\">https://github.com/oxfordcontrol/CDCS/</a>)","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":2,"starsCount":6,"forksCount":3,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-23T11:40:06.816Z"}},{"type":"Public","name":"QDLDL.jl","owner":"oxfordcontrol","isFork":false,"description":"A free LDL factorisation routine (Julia implementation) ","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":18,"forksCount":5,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-24T22:34:06.782Z"}},{"type":"Public","name":"TRS.jl","owner":"oxfordcontrol","isFork":false,"description":"Solving the Trust Region Subproblem as an Eigenproblem in Julia","topicNames":["optimization","linear-algebra","eigenvalues","trust-region"],"topicsNotShown":0,"allTopics":["optimization","linear-algebra","eigenvalues","trust-region"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":5,"starsCount":22,"forksCount":6,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-10-01T21:36:27.204Z"}},{"type":"Public","name":"DoublyStochastic.jl","owner":"oxfordcontrol","isFork":false,"description":"Doubly Stochastic Approximation of a Matrix in the Frobenius norm.","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-11T08:51:57.848Z"}},{"type":"Public","name":"COSMOAccelerators.jl","owner":"oxfordcontrol","isFork":false,"description":"Accelerators for fixed-point methods, used in the conic solver COSMO.jl","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-01-30T18:33:23.384Z"}},{"type":"Public","name":"QPnorm.jl","owner":"oxfordcontrol","isFork":false,"description":"Solving Nonconvex Quadratic Problems with a norm constraint","topicNames":[],"topicsNotShown":0,"allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":2,"starsCount":4,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-06-12T16:11:29.184Z"}},{"type":"Public","name":"GeneralQP.jl","owner":"oxfordcontrol","isFork":false,"description":"An active set solver for general (definite/indefinite) dense Quadratic Programs","topicNames":["matrix-factorization","quadratic-programming","active-set"],"topicsNotShown":0,"allTopics":["matrix-factorization","quadratic-programming","active-set"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-06-12T09:21:24.016Z"}}],"repositoryCount":12,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}