Beyond the Scope of Interior Point Polynomial Time...

Primary tabs

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


  • Workflow Status: Published
  • Created By: Barbara Christopher
  • Created: 10/08/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


No keywords were submitted.

Target Audience