[SciPy-user] lagrange multipliers in python
Fri Jun 15 08:50:12 CDT 2007
If your function is too complicated to evaluate derivatives, chances are
it's not convex. But you're still going to need the first and second order
for Newton's method...
If you want to solve
s.t. A*x = b
you could first find a feasible point x0 satisfying A*x0 = b (e.g., the
least-norm solution to A*x = b) and parametrize all feasible points as
z = x0+ B*y
where B spans the nullspace of A, i.e., A*B = 0. Now you have an
min. f( x0 + B*y )
over the new variable y.
On 6/15/07, email@example.com <firstname.lastname@example.org> wrote:
> Joachim Dahl wrote:
> > What kind of function are you minimizing?
> > CVXOPT handles convex functions with convex inequality constraints and
> > linear equality constraints.
> > If your function is non-convex, couldn't you eliminate your linear
> > equality constraints and try Newton's method for the unconstrained
> Can you give me some hints on how to eliminate the linear equality
> constraints ?
> How to judge if a function is non-convex? The expression of my function
> too complex to calculate the derivative.
> Xiao Jianfeng
> SciPy-user mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the SciPy-user