On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization

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 independent of the problem instance: (i) the sizes of ε-optimal solutions, and (ii) the maximum distance of ε-optimal solutions to the boundary of the cone of the HSD variables. This norm is also useful in developing a stopping-rule theory for HSD-based interior-point methods such as SeDuMi. Under mild assumptions, we show that a standard stopping rule implicitly involves the sum of the sizes of the ε-optimal primal and dual solutions, as well as the size of the initial primal and dual infeasibility residuals. This theory suggests possible criteria for developing starting points for the homogeneous self-dual model that might improve the resulting solution time in practice

The Design of a Mechanical Assembly System

This thesis describes a mechanical assembly system called LAMA (Language for Automatic Mechanical Assembly). The goal of the work was to create a mechanical assembly system that transforms a high-level description of an automatic assembly operation into a program or execution by a computer controlled manipulator. This system allows the initial description of the assembly to be in terms of the desired effects on the parts being assembled. Languages such as WAVE [Bolles & Paul] and MINI [Silver] fail to meet this goal by requiring the assembly operation to be described in terms of manipulator motions. This research concentrates on the spatial complexity of mechanical assembly operations. The assembly problem is seen as the problem of achieving a certain set of geometrical constraints between basic objects while avoiding unwanted collisions. The thesis explores how these two facets, desired constraints and unwanted collisions, affect the primitive operations of the domain.

Automatic Analysis of the Logical Structure of Programs

This report presents a method for viewing complex programs as built up out of simpler ones. The central idea is that typical programs are built up in a small number of stereotyped ways. The method is designed to make it easier for an automatic system to work with programs. It focuses on how the primitive operations performed by a program are combined together in order to produce the actions of the program as a whole. It does not address the issue of how complex data structures are built up from simpler ones, nor the relationships between data structures and the operations performed on them.

A Proposal for Enterprise Value Phase of the Lean Aerospace Initiative

The Massachusetts Institute of Technology (MIT) submits this proposal for the Enterprise Value Phase of the Lean Aerospace Initiative (LAI) in response to the October 9, 2002 Request for Proposal (RFP) F33615-02-2-5501 from the Air Force Research Laboratory (AFRL/MLKT), Wright-Patterson Air Force Base, Ohio. This proposal addresses the conduct of the LAI as set forth in the Enterprise Value Phase Concept of Operations (final draft dated 5 June 2002. The creation of this Enterprise Value Phase Concept of Operations (ConOps) was the result of extensive interaction among all stakeholders in the LAI consortium. The proposed products and research topics have been developed by the MIT LAI team based on this extended interaction with the Lean Aerospace Initiative consortium members during the concept of operations development. This proposal is in consonance with the Enterprise Value Phase vision, and mission as set forth in the concept of operations so as to meet stakeholder needs to achieve the goals and deliverables desired, prioritized to fit available funding.