Centered newton method for mathematical programming
Author:
- 6 February 2006
- book chapter
- Published by Springer Nature
- p. 197-206
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming2006
- EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMINGJournal of the Operations Research Society of Japan, 1987
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986
- A polynomial newton method for linear programmingAlgorithmica, 1986
- A note on degeneracy in linear programmingMathematical Programming, 1986
- Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equationsAnnals of the Institute of Statistical Mathematics, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A geometric method in nonlinear programmingJournal of Optimization Theory and Applications, 1980
- Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equationsNonlinear Analysis, 1979