CVXR (Q33817): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Swh import (talk | contribs)
SWHID from Software Heritage
 
(2 intermediate revisions by 2 users not shown)
Property / source code repository
 
Property / source code repository: https://github.com/cran/CVXR / rank
 
Normal rank
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:8758b373db51219ab0931d3d3fb405572082a862 / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:8758b373db51219ab0931d3d3fb405572082a862 / qualifier
 
Property / Software Heritage ID: swh:1:snp:8758b373db51219ab0931d3d3fb405572082a862 / qualifier
 
point in time: 9 February 2024
Timestamp+2024-02-09T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:15, 21 March 2024

Disciplined Convex Optimization
Language Label Description Also known as
English
CVXR
Disciplined Convex Optimization

    Statements

    0 references
    0 references
    1.0-11
    30 October 2022
    0 references
    0.94-4
    20 November 2017
    0 references
    0.95
    20 February 2018
    0 references
    0.99-2
    6 November 2018
    0 references
    0.99-3
    20 February 2019
    0 references
    0.99-4
    13 March 2019
    0 references
    0.99-5
    13 May 2019
    0 references
    0.99-6
    2 June 2019
    0 references
    0.99-7
    7 November 2019
    0 references
    0.99
    26 May 2018
    0 references
    1.0-1
    2 April 2020
    0 references
    1.0-8
    13 September 2020
    0 references
    1.0-9
    19 January 2021
    0 references
    1.0-10
    10 November 2021
    0 references
    1.0
    2 February 2020
    0 references
    1.0-12
    2 February 2024
    0 references
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    An object-oriented modeling language for disciplined convex programming (DCP) as described in Fu, Narasimhan, and Boyd (2020, <doi:10.18637/jss.v094.i14>). It allows the user to formulate convex optimization problems in a natural way following mathematical convention and DCP rules. The system analyzes the problem, verifies its convexity, converts it into a canonical form, and hands it off to an appropriate solver to obtain the solution. Interfaces to solvers on CRAN and elsewhere are provided, both commercial and open source.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references