commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Erik Erlandson (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (MATH-1464) convex optimization with constraints, barrier method
Date Sat, 07 Jul 2018 13:06:00 GMT

    [ https://issues.apache.org/jira/browse/MATH-1464?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16535754#comment-16535754
] 

Erik Erlandson commented on MATH-1464:
--------------------------------------

I am curious to understand more about the "tight dependency on the matrix API" issue. For
example, I used the {{org.apache.commons.mathX.linear}} matrix API extensively in my code.
Is there some other way I should have coded that for reduced coupling?

> convex optimization with constraints, barrier method
> ----------------------------------------------------
>
>                 Key: MATH-1464
>                 URL: https://issues.apache.org/jira/browse/MATH-1464
>             Project: Commons Math
>          Issue Type: New Feature
>            Reporter: Erik Erlandson
>            Priority: Major
>              Labels: math, optimization
>
> Commons math supports SimplexOptimizer for linear programming.  I created a somewhat
similar package for convex optimization with constraints, which is here:
> [https://github.com/erikerlandson/gibbous]
> I designed it to work in the style of commons-math optimizers, so I thought I would propose
it for inclusion with commons math optimization, to see if there is any community interest.



--
This message was sent by Atlassian JIRA
(v7.6.3#76005)

Mime
View raw message