On computing the center of a convex quadratically constrained set (Q2276879): Difference between revisions

The authors presents an interior point method for finding an analytic center of a convex feasible region whose boundaries are defined by quadratic functions. The algorithm starts from an arbitrary initial point and approaches the desired center by simultaneously reducing infeasibility or slackness of all constraints. A partial Newton step is taken at each iteration.