Complexity of convex optimization using geometry-based measures and a reference point
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Science Research Network.
Other Authors: | Freund, Robert M. |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Online Access: | http://papers2.ssrn.com/paper.taf?ABSTRACT%5FID=288134 http://hdl.handle.net/1721.1/5256 |
Similar Items
-
Complexity of convex optimization using geometry-based measures and a reference point
by: Freund, Robert Michael.
Published: (2009) -
NBC Complexes of Convex Geometries
by: Kenji Kashiwabara, et al.
Published: (2005-01-01) -
Correspondences between convex geometry and complex geometry
by: Brian Lehmann, et al.
Published: (2017-09-01) -
The computational complexity of finding stationary points in non-convex optimization
by: Hollender, A, et al.
Published: (2024) -
Euclidean geometry and convexity/
by: 410413 Benson, Russell V.
Published: (1966)