Now showing items 1-4 of 4
Comparison of Two Sets of First-order Conditions as Bases of Interior-Point Newton Methods for Optimization with Simple Bounds
In this paper, we compare the behavior of two Newton interior-point methods derived from two different first-order necessary conditions for the same nonlinear optimization problem with simple bounds. One set of conditions ...
A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs
The authors of this paper recently introduced a transformation that converts a class of semidefinite programs (SDPs) into nonlinear optimization problems free of matrix-valued constraints and variables. This transformation ...
On Numerical Solution of the Maximum Volume Ellipsoid Problem
In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R n defined by a finite set of affine inequalities. Our goal is to design a ...
Solving the Double Digestion Problem as a Mixed-Integer Linear Program
The double digestion problem for DNA restriction mapping is known to be NP-complete. Several approaches to the problem have been used including exhaustive search, simulated annealing, branch-and-bound. In this paper, we ...