Return-Path: Delivered-To: apmail-commons-user-archive@www.apache.org Received: (qmail 81066 invoked from network); 9 Sep 2010 13:28:56 -0000 Received: from unknown (HELO mail.apache.org) (140.211.11.3) by 140.211.11.9 with SMTP; 9 Sep 2010 13:28:56 -0000 Received: (qmail 53358 invoked by uid 500); 9 Sep 2010 13:28:55 -0000 Delivered-To: apmail-commons-user-archive@commons.apache.org Received: (qmail 52936 invoked by uid 500); 9 Sep 2010 13:28:52 -0000 Mailing-List: contact user-help@commons.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: "Commons Users List" Delivered-To: mailing list user@commons.apache.org Received: (qmail 52927 invoked by uid 99); 9 Sep 2010 13:28:50 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 09 Sep 2010 13:28:50 +0000 X-ASF-Spam-Status: No, hits=0.7 required=10.0 tests=FREEMAIL_FROM,RCVD_IN_DNSWL_NONE,SPF_NEUTRAL X-Spam-Check-By: apache.org Received-SPF: neutral (athena.apache.org: local policy) Received: from [194.206.126.239] (HELO smtp.nordnet.fr) (194.206.126.239) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 09 Sep 2010 13:28:43 +0000 Received: from lehrin (214.202.141.79.dynamic.adsl.abo.nordnet.fr [79.141.202.214]) by smtp.nordnet.fr (Postfix) with ESMTP id AD992484D5 for ; Thu, 9 Sep 2010 15:28:20 +0200 (CEST) Received: by lehrin (Postfix, from userid 5001) id F12E84175; Thu, 9 Sep 2010 15:28:20 +0200 (CEST) X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on lehrin.spaceroots.local X-Spam-Level: Received: from lehrin.spaceroots.local (lehrin.spaceroots.local [127.0.0.1]) by lehrin (Postfix) with ESMTP id 997654173 for ; Thu, 9 Sep 2010 15:28:17 +0200 (CEST) Message-ID: <4C88E0F1.7030709@free.fr> Date: Thu, 09 Sep 2010 15:28:17 +0200 From: Luc Maisonobe User-Agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.1.12) Gecko/20100826 Thunderbird/3.0.7 MIME-Version: 1.0 To: Commons Users List Subject: Re: [math] Re: Sequential Quadratic Programming References: <4C88AA9E.2070106@free.fr> In-Reply-To: X-Enigmail-Version: 1.0.1 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Old-Spam-Status: No, score=-1.0 required=5.0 tests=ALL_TRUSTED,FREEMAIL_FROM autolearn=unavailable version=3.3.1 Le 09/09/2010 15:12, Michael Stover a �crit : > Thank you for your answer, Luc! > > Do you know of any open-source implementations of SQP solvers? Not directly. A quick web search lead me to hqp ? It seems to be written in C++ and distributed under the terms of the GPL. I have no experience at all with this project. Luc > > Mike > > On Thu, Sep 9, 2010 at 5:36 AM, Luc Maisonobe wrote: > >> Hi Michael, >> >> First of all, please add a [math] marker in the subject line when >> posting to this list concernin the commons-math component. The list is >> shared among a large number of components and such markers help filtering. >> >> Le 09/09/2010 04:00, Michael Stover a �crit : >>> I am not a mathematician, but I write software for a bunch of them, so >>> forgive me my limited knowledge of the math and math terms... >>> >>> I need to implement a solution that is estimating the optimal values for >>> several parameters. I have an objective function and starting points and >>> all that. The code I have to rewrite currently is using a method called >>> "SQP", or Sequential Quadratic Programming (actually, a special version >> of >>> it called DESQP - Differential Equation Sequential Quadratic >> Programming). >>> Supposedly such a function exists in R, but I do not know where to find >> it, >>> and I was looking through Apache Math Commons for the equivalent >> solution, >>> but I am not sure what it would be, as the names of the optimizers seem >> to >>> be following a different nomenclature. >>> >>> Can anyone tell me whether one can optimize/estimate using SQP with >> Apache >>> Math Commons, and some pointers on how to get started? >> >> Unfortunately, there are no SQP methods available in commons-math yet >> (patches welcome!). The only constrained optimization methods we have >> are limited to linear problems and linear constraints. The optimization >> methods we have for non-linear problems do not handle constraints yet. >> >> Luc >> >>> >>> -Mike >>> >> >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: user-unsubscribe@commons.apache.org >> For additional commands, e-mail: user-help@commons.apache.org >> >> > --------------------------------------------------------------------- To unsubscribe, e-mail: user-unsubscribe@commons.apache.org For additional commands, e-mail: user-help@commons.apache.org