Further Development on the Interior Algorithm for Convex Quadratic Programming

  title={Further Development on the Interior Algorithm for Convex Quadratic Programming},
  author={Yinyu Ye},
The interior trust region algorithm for convex quadratic programming is further developed. This development is motivated by the barrier function and the \center" path-following methods, which create a sequence of primal and dual interior feasible points converging to the optimal solution. At each iteration, the gap between the primal and dual objective values (or the complementary slackness value) is reduced at a global convergence ratio (1 ? 1 4 p n), where n is the number of variables in the… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 36 references

Two variant of Karmarkar's linear programming algorithm for problems with some unresctircted variables,

  • J. E. Mitchell, M. J. Todd
  • Technical Report No. 741,
  • 1987
Highly Influential
6 Excerpts

An O(n3L) primal-dual interior point algorithm for linear programming," Manuscript, Department of IEOR, University of California, Berkeley

  • R. C. Monteiro, Adler
  • (CA,
  • 1987
Highly Influential
8 Excerpts

An algorithm for solving linear programming problems in O(n3L) operations," Memorandum No. UCB/ERL M87/10

  • C. C. Gonzaga
  • Electronic Research Laboratory,
  • 1987
Highly Influential
5 Excerpts

An extension of Karmarkar's algorithm and the trust region method for quadratic programming,

  • Y. Ye
  • 1986
Highly Influential
3 Excerpts

An 'analytic center' for polyhedrons and new classes of global al- gorithms for linear (smooth

  • G. Sonnevend
  • convex) programming," Proc. 12th IFIP Conference…
  • 1985
Highly Influential
6 Excerpts

Trust region methods for unconstrained minimization," Nonlinear Optimization, (edited by M.J.D

  • D. C. Sorensen
  • 1981
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…