Learn More
We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set de ned by equality and inequality constraints. The algorithm generates feasible iterates and consists in computing approximate solutions of the optimality conditions perturbed by a sequence of positive parameters converging to zero. We prove that it(More)
There are several sections. The goal is to link complex analysis and imbeddings of graphs so that graph imbeddings can be performed systematically using identification spaces based on group actions in the complex plane. We give a short primer of basic calculus and then explain some of the finer aspects that obfuscate a complete solution to the Riemann(More)
  • 1