Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Ye (1987)
Interior algorithms for linear, quadratic, and linearly constrained convex programming
J. Renegar (1986)
A polynomial-time algorithm based on Newton's method for linear programming. Report MSRI 07 118-86
M. Todd (1988)
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming AlgorithmMath. Oper. Res., 13
J. Gilewicz, M. Pindor, W. Siemaszko (1987)
Rational Approximation and its Applications in Mathematics and Physics
M. Kojima, S. Mizuno, Akiko Yoshise (1989)
A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 44
G. Sonnevend (1988)
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
A. V. Fiacco (1983)
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
M. Iri, H. Imai (1986)
A multiplicative penalty functionAlgorithmica, 1
D. A. Bayer, J. C. Lagarias (1987)
Karmarkar's linear programming algorithm and Newton's method. Preprint
N. Karmarkar (1984)
A new polynomial-time algorithm for linear programmingCombinatorica, 4
D. Bayer, J. Lagarias (1991)
Karmarkar's linear programming algorithm and Newton's methodMathematical Programming, 50
F. Jarre, G. Sonnevend, J. Stoer (1988)
An implementation of the method of analytic centersAnalysis and optimization of systems
Gy. Sonnevend (1988)
Trends in Mathematical Optimization
M. Kojima, S. Mizuno, A. Yoshishe (1987)
A polynomial-time algorithm for a class of linear complementarity problems. Research Report NO B-193
P. M. Vaidya (1987)
An algorithm for linear programming which requiresO(((m + n)n 2+(m + n) 1.5)L) arithmetic operations. Preprint
J. Renegar (1988)
A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 40
(1986)
Rational Approximation and Its Applications in Mathematics and Physics. Lecture Notes in Mathematics, Vol. 1237
F. Jarre (1991)
On the convergence of the method of analytic centers when applied to convex quadratic programsMathematical Programming, 49
Bùi-Trong-Liêu, P. Huard (1966)
La mèthode des centres dans un espace topologiqueNumerische Mathematik, 8
Gy. Sonnevend (1987)
Colloquia Mathematica Societatis János Bolyai, Vol. 50. Numerical Methods (Miskolc 1986)
G. A. Baker, P. Graves-Morris (1981)
Essentials of Padé Approximation. Encyclopedia of Mathematics, Vols. 13 and 14
Gy. Sonnevend (1985)
Lecture Notes in Control and Information Sciences, Vol. 84
M. J. Todd (1986)
Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm. Technical Report No. 721
P. Vaidya (1987)
An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operationsMathematical Programming, 47
G. Cybenko (1984)
Restrictions of Normal Operators, Padé Approximation and Autoregressive Time SeriesSiam Journal on Mathematical Analysis, 15
Y. Ye, M. Todd (1990)
Containing and shrinking ellipsoids in the path-following algorithmMathematical Programming, 47
G. Sonnevend (1986)
An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingLecture Notes in Control and Information Sciences, 84
This paper deals with some problems of algorithmic complexity arising when solving convex programming problems by following the path of analytic centers (i.e., the trajectory formed by the minimizers of the logarithmic barrier function). We prove that in the case ofm convex quadratic constraints we can obtain in a simple constructive way a two-sided ellipsoidal approximation for the feasible set (intersection ofm ellipsoids), whose tightness depends only onm. This can be used for the early identification of those constraints which are active at the optimum, and it also explains the efficiency of Newton's method used as a corrector when following the central path. Various parametrizations of the central path are studied. This also leads to an extrapolation (predictor) algorithm which can be regarded as a generalization of the method of conjugate gradients.
Applied Mathematics and Optimization – Springer Journals
Published: Mar 23, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.