From mboxrd@z Thu Jan 1 00:00:00 1970 From: Brian Gough To: "Dan, Ho-Jin" Cc: gsl-discuss@sources.redhat.com Subject: Re: gsl optimization routines Date: Wed, 19 Dec 2001 13:20:00 -0000 Message-id: <15352.7990.973348.75823@debian> References: <3BF64CAE.6040900@sys713.kaist.ac.kr> <15350.54550.106860.342528@debian> <3BF7CB71.6070107@sys713.kaist.ac.kr> X-SW-Source: 2001/msg00715.html Dan, Ho-Jin writes: > Okay, I'll figure out the gsl stucture, check reusable functions and survey > recently published papers. First of all, nonlinear programming(NP) will > be focused on with a dense storage(small to medium size problems), and, > if needed, linear programming(LP) will be implemented. actually, I am > not interested in LP since the research area of mine is the structural > optimization. Yes, routines for nonlinear programming are needed. For linear programming there is an excellent GNU package already called GLPK (GNU Linear Programming Kit) written by Andrew Makhorin which people can use. Brian From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 18409 invoked by alias); 18 Nov 2001 21:11:12 -0000 Mailing-List: contact gsl-discuss-help@sourceware.cygnus.com; run by ezmlm Precedence: bulk List-Subscribe: List-Archive: List-Post: List-Help: , Sender: gsl-discuss-owner@sources.redhat.com Received: (qmail 18356 invoked from network); 18 Nov 2001 21:11:10 -0000 Received: from unknown (HELO mail2.svr.pol.co.uk) (195.92.193.210) by sourceware.cygnus.com with SMTP; 18 Nov 2001 21:11:10 -0000 Received: from modem-177.white-faced-ibis.dialup.pol.co.uk ([62.137.216.177] helo=debian) by mail2.svr.pol.co.uk with esmtp (Exim 3.13 #0) id 165ZDU-0003UO-00; Sun, 18 Nov 2001 21:11:05 +0000 Received: from bjg by debian with local (Exim 2.05 #1 (Debian)) id 165Yu7-00005r-00; Sun, 18 Nov 2001 20:51:03 +0000 From: Brian Gough MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15352.7990.973348.75823@debian> Date: Fri, 16 Nov 2001 02:00:00 -0000 To: "Dan, Ho-Jin" Cc: gsl-discuss@sources.redhat.com Subject: Re: gsl optimization routines In-Reply-To: <3BF7CB71.6070107@sys713.kaist.ac.kr> References: <3BF64CAE.6040900@sys713.kaist.ac.kr> <15350.54550.106860.342528@debian> <3BF7CB71.6070107@sys713.kaist.ac.kr> X-Mailer: VM 6.62 under Emacs 19.34.1 X-SW-Source: 2001-q4/txt/msg00039.txt.bz2 Message-ID: <20011116020000.zEAjLWiDdiQr2Bi93IQuX1oVk9e4zs7TyCb0ee4qKMo@z> Dan, Ho-Jin writes: > Okay, I'll figure out the gsl stucture, check reusable functions and survey > recently published papers. First of all, nonlinear programming(NP) will > be focused on with a dense storage(small to medium size problems), and, > if needed, linear programming(LP) will be implemented. actually, I am > not interested in LP since the research area of mine is the structural > optimization. Yes, routines for nonlinear programming are needed. For linear programming there is an excellent GNU package already called GLPK (GNU Linear Programming Kit) written by Andrew Makhorin which people can use. Brian