Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Eigenvalue Optimization Codes
Replies: 1   Last Post: Jul 18, 1996 3:10 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Brian Borchers

Posts: 148
Registered: 12/6/04
Eigenvalue Optimization Codes
Posted: Jul 16, 1996 7:35 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



Are there any codes available for solving large scale eigenvalue
optimization problems? I'm interested in problems of the form:
Minimize the maximum eigenvalue of a matrix A(x)=A_0 + sum x_i A_i,
subject to linear constraints on the x's.

I'm aware that these problems can be formulated as SDP's and solved
using interior point methods. I'm interested in relatively large
problems for which interior point methods become unwieldy. I'm
looking for codes that use other strategies for convex optimization
such as the bundle trust method or Overton's successive partial linear
programming algorithm.


--
Brian Borchers borchers@nmt.edu
Department of Mathematics http://www.nmt.edu/~borchers/
New Mexico Tech Phone: 505-835-5813
Socorro, NM 87801 FAX: 505-835-5366







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.