Explicit Computations of Universal Barrier Functions

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

Summary Sentence: Explicit Computations of Universal Barrier Functions

Full Summary: Explicit Computations of Universal Barrier Functions

We describe a general idea of path-following algorithms for solving
optimization problems. The concept of the universal barrier function (u.b.f) is introduced.
The key result of Yu. Nesterov and A.Nemirovsky allowing to obtain excellent complexity estimates is explained. Finally, we describe new results related to computations of u.b. fs for a very broad class of cones generated by Chebyshev systems. Connections with classical work of M. Krein , A. Nudelman and I. Schoenberg are explained. New results allow one to substantially extend the
domain of applicability of modern interior-point algorithms.

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:42am
  • Last Updated: Oct 7, 2016 - 9:52pm