Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5256| Title: | Complexity of convex optimization using geometry-based measures and a reference point |
| Authors: | Freund, Robert M. |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | 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. Robert M. Freund. 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). |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://papers2.ssrn.com/paper.taf?ABSTRACT%5FID=288134 http://hdl.handle.net/1721.1/5256 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.