1 / 6

Convex Set of Points

Convex Set of Points. A set of points is convex if it has the following property: Consider all possible pairs of points in the set and consider the line segment connecting any such pair. All such line segments must lie entirely within the set. Convex –vs- Nonconvex.

colum
Download Presentation

Convex Set of Points

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Convex Set of Points • A set of points is convex if it has the following property: Consider all possible pairs of points in the set and consider the line segment connecting any such pair. All such line segments must lie entirely within the set.

  2. Convex –vs- Nonconvex

  3. Highly Nonlinear Problems Highly Nonlinear Problems General Convex Problems Quadratic Problems Linear Problems

  4. Quadratic Programming • Linear convex constraints • Objective is a quadratic function: • Ai xi2 +  Bijxixj +  Cixi + D • Portfolio structuring uses quadratic programming models • Unique optimal solution exists that can be found using Solver’s generalized reduced gradient (GRG) algorithm

  5. General convex models: • Feasible region is a general convex set • Objective may or may not be a general convex function • Produces a unique solution • Highly nonlinear models: • Convexity does not exist • Local and global optimal solutions are possible

  6. Risk Solver Platform • Convexity Tester: • Optimize, Analyze Without Solving or the X-Checkbox icon on the Model tab in the task pane • Results: NSP – Non-smooth problem which is non-convex, NLP - Non-linear smooth problem which may or may not be convex • Model Type – NLP Convex in the Model Diagnosis area of the task pane implies that the local optimal solution is a global optimal solution • Use RSPE’s Guided Mode to interpret your messages and types of nonlinearity in model

More Related