Efficiency of random search methods on huge-scale optimization problems

Event Details
  • Date/Time:
    • Thursday April 1, 2010
      11:00 am - 12:00 pm
  • Location: ISyE Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Efficiency of random search methods on huge-scale optimization problems

Full Summary: Efficiency of random search methods on huge-scale optimization problems

TITLE: Efficiency of random search methods on huge-scale optimization problems

SPEAKER:  Yurii Nesterov

ABSTRACT:

In this talk we describe the new methods for solving huge-scale optimization problems. For problems of this size, even the simplest full-dimensional vector operations are very expensive. Hence, we suggest to apply an optimization technique based on random partial update of
decision variables. For these methods, we prove the global estimates for the rate of convergence. Surprisingly enough, for certain classes of objective functions, our results are better than the standard worst-case bounds for deterministic algorithms. We present constrained and unconstrained versions of the method, and its accelerated variant. Our numerical test confirms a high efficiency of this technique on problems of very big size.

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: Anita Race
  • Workflow Status: Published
  • Created On: Mar 24, 2010 - 7:10am
  • Last Updated: Oct 7, 2016 - 9:51pm