Beyond the Scope of Interior Point Polynomial Time...

Event Details
  • Date/Time:
    • Thursday October 14, 2004
      11:00 am - 12:00 am
  • Location: Executive Classroom 228 Main Bldg
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: Beyond the Scope of Interior Point Polynomial Time...

Full Summary: Beyond the Scope of Interior Point Polynomial Time...

In all known polynomial time algorithms of nonlinear convex optimization, the computational effort per iteration grows nonlinearly with the design dimension n of the problem (typically, as n3). As a result, in the case of extremely large-scale (tens and hundreds thousands of variables) convex programs, a single iteration of a polynomial time algorithm can become too expensive to be practical. In these cases one is enforced to use

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 8, 2010 - 7:39am
  • Last Updated: Oct 7, 2016 - 9:52pm