This is the mail archive of the gsl-discuss@sources.redhat.com mailing list for the GSL project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: Area constraint in 2-d roots?

From: Brian Gough <bjg at network-theory dot co dot uk>
To: "Peter S. Christopher" <peterc at midway dot uchicago dot edu>
Cc: gsl-discuss at sources dot redhat dot com
Date: Sun, 21 Jul 2002 14:06:12 +0100 (BST)
Subject: Re: Area constraint in 2-d roots?
References: <Pine.GSO.4.21.0207181351120.27879-100000@harper.uchicago.edu>

Peter S. Christopher writes:
 > Hi there,
 > 	I'm inquiring about the gsl_multiroot_fsolver_iterate function.
 > Specifically I'm interested in constraining the allowable solutions that
 > the algorithm searches to a small area.

GSL doesn't have any routines for constrained minimization.

You can use a penalty function to safely discourage the minimizer from
going outside the desired region.  Modification of const arguments is
definitely not recommended.

regards
Brian Gough

References:
- Area constraint in 2-d roots?
  - From: Peter S. Christopher

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]