This article presents a primal-dual predictor-corrector interior-point
method for solving quadratically constrained convex optimization prob
lems that arise from truss design problems. We investigate certain spe
cial features of the problem, discuss fundamental differences of inter
ior-point methods for linearly and nonlinearly constrained problems, e
xtend Mehrotra's predictor-corrector strategy to nonlinear programs, a
nd establish convergence of a long step method. Numerical experiments
on large scale problems illustrate the surprising efficiency of the me
thod.