Search
Now showing items 1-10 of 21
AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods
(Massachusetts Institute of Technology, Operations Research Center, 2014-03-14)
Optimizing Product Line Designs: Efficient Methods and Comparisons
(2005-03-04)
We compare a broad range of optimal product line design methods. The comparisons
take advantage of recent advances that make it possible to identify the optimal solution to
problems that are too large for complete ...
Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems
(2005-03-04)
We study four measures of problem instance behavior that might account for the observed differences in interior-point method (IPM) iterations when these methods are used to solve semidefinite programming (SDP) problem ...
Projective Pre-Conditioners for Improving the Behavior of a Homogeneous Conic Linear System
(Massachusetts Institute of Technology, Operations Research Center, 2005-05-31)
In this paper we present a general theory for transforming a normalized homogeneous conic system F : Ax = 0, s'x = 1, x in C to an equivalent system via projective transformation induced by the choice of a point w in the ...
New Analysis and Results for the Conditional Gradient Method
(Massachusetts Institute of Technology, Operations Research Center, 2013-07-10)
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
(Massachusetts Institute of Technology, Operations Research Center, 2009-02-03)
On an Extension of Condition Number Theory to Non-Conic Convex Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2003-02)
The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z* := minz ctx s.t. Ax - b Cy C Cx , to the more general non-conic format: z* := minx ctx ...
Theoretical Efficiency of A Shifted Barrier Function Algorithm for Linear Programming
(Massachusetts Institute of Technology, Operations Research Center, 1989-04)
This paper examines the theoretical efficiency of solving a standard-form linear program by solving a sequence of shifted-barrier problems of the form minimize cTx - n (xj + ehj) j.,1 x s.t. Ax = b , x + e h > , for a given ...
On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization
(Massachusetts Institute of Technology, Operations Research Center, 2004-10)
There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm
two measures of the HSD model’s behavior are precisely controlled ...