MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Complexity of convex optimization using geometry-based measures and a reference point

Author(s)
Freund, Robert M.
Thumbnail
DownloadOR-358-01-50876146.pdf (1.414Mb)
Terms of use
http://papers2.ssrn.com/paper.taf?ABSTRACT%5FID=288134
Metadata
Show full item record
Abstract
Our concern lies in solving the following convex optimization problem: minimize cx subject to Ax=b, x \in P, where P is a closed convex set. We bound the complexity of computing an almost-optimal solution of this problem in terms of natural geometry-based measures of the feasible region and the level-set of almost-optimal solutions, relative to a given reference point xr that might be close to the feasible region and/or the almost-optimal level set. This contrasts with other complexity bounds for convex optimization that rely on data-based condition numbers or algebraic measures, and that do not take into account any a priori reference point information. Keywords: Convex Optimization, Complexity, Interior-Point Method, Barrier Method.
Description
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Science Research Network.
 
Title from cover. "September 2001."
 
Includes bibliographical references (leaf 29).
 
Date issued
2001
URI
http://papers2.ssrn.com/paper.taf?ABSTRACT%5FID=288134
http://hdl.handle.net/1721.1/5256
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 358-01

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.