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 » Software » comp.soft-sys.matlab

Topic: Non-strict Convex Optimization
Replies: 13   Last Post: May 4, 2012 9:50 AM

Advanced Search

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

Posts: 33
Registered: 10/4/11
Re: Non-strict Convex Optimization
Posted: May 3, 2012 3:07 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> Your description of what "p" represents isn't very clear and you haven't described what q represents at all.

Sorry, I think my description was vague. Let me attempt to be more precise:

I have a set C which is the boundary of a (non-strict) convex set. You could imagine the boundary of a convex set, except instead of being curved, it has faces which are sections of hyperplanes (e.g. in 2D it would be a series of increasingly downward sloping lines).

Say "q" is a point on this set and "p" is a plane tangent to C at q (e.g. in 2D "p" is the slope of of a line tangent at q; at vertices there are multiple possible p).

I have a function f(q,p) and I want to solve for f(q,p) = zeros(n,1). What is the best method for doing so?



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.