Path-following barrier and penalty methods for linearly constrained problems

References

• Al-Mutairi , D , Grossmann , C and Vu , K.T . 1998 . Path-following barrier and penalty methods for linearly constrained problems , TU Dresden . Preprint MATH-NM-10-1998
   Google Scholar
• Allgower , E.L and Georg , K . 1990 . Numerical continuation methods , Berlin : Springer .
   Google Scholar
• Böhmer , K and Grossmann , C . 1993 . Area of contraction of Newton’s method applied to a penalty technique for obstacle problems . Appl Math , 38 ( 6 ) : 428 – 439 .
   Google Scholar
• Chen , B and Harker , P.T . 1995 . A continuation method for monotone varia-tional inequalities . Math. Programming , 69 ( 6 ) : 237 – 253 .
   Google Scholar
• Dentcheva , D , Gollmer , R , Guddat , J and Rueckmann , J.J . 1995 . “ Pathfollowing methods in nonlinear optimization. II: Exact penalty methods ” . In Approximation and optimization in the Carribean II , Frankfurt : P. Lang . held in Havanna, Cuba, September 1993
   Google Scholar
• Deuflhard , P . 1991 . Global inexact Newton methods for very large scale nonlinear problems . IMPACT Comp. Sci. Eng , 3 : 366 – 393 .
   Google Scholar
• Deuflhard , P and Potra , K . 1992 . Asymptotic mesh independence of Newton-Galerkin methods via a refined Mysovskii tlieorem . SIAM J. Numer. Anal , 29 : 1395 – 1412 .
   Web of Science ®Google Scholar
• Elster , K.H and Grossmann , G . 1977 . “ Behandlung niuhtlinearer Optimierungsaufagben mit Staf- und Barrierefunktionen ” . In Math-Ökonomische Methoden und Modelle , 42 – 104 . Berlin : Die Wirtschaft .
   Google Scholar
• Elster , K.H , Reinhardt , R , Schäuble , M and Donath , G . 1977 . Einführung in die nichtlineare Optimierung , Leipzig : Teubner .
   Google Scholar
• Fiacco , A.V and McCormick , G.P . 1968 . Nonlinear programming: Sequential unconstrained minimization techniques , New York : Wiley .
   Google Scholar
• Freund , R.M and Mizuno , S . 1996 . Interior point methods: current status and future directions . OPTIMA, Math. Programming Soc. Newsletter , 51
   Google Scholar
• Gollmer , R , Guddat , J , Guerra , F , Nowak , D and Rueckmann , J.J . 1993 . “ Pathfollowing methods in nonlinear optimization. Ï: Penalty embedding ” . In Parametric optimization and related topics, III , Frankfurt : P. Lang . held in Guestrow, Germany, September 1991
   Google Scholar
• Grossmann , C . 1993 . Asymptotic analvsis of in a path-following barrier method for linearly constrained convex problems . Optimization , to appear
   Google Scholar
• Grossmann , C and Ismail , A . 1993 . Parameter selection rules for path-following with singular embedding . Numer. Math , to appear
   Google Scholar
• Grossmann , C and Kaplan , A.A . 1979 . Straf- Barriere-Verfahren und modifizierte Lagrangefunktionen in der nichllinearen Optimierung , Leipzig : Teubner .
   Google Scholar
• Den Hertog , D . 1994 . Interior point approach to linear, quadratic and convex programming , Dordrecht : Kluwer Publ .
   Google Scholar
• Den Hertog , D , Jarre , F , Roos , C and Terlaky , T . 1994 . A sufficient condition for self-concordance, with application to some classes of structured convex programming problems . Math. Programming , 69 : 75 – 88 .
   Google Scholar
• Kortanek , K.O , Potra , F and Ye , Y . 1991 . On some efficient interior point methods for nonlinear convex programming . Lin. Algebra Appl , 152 : 169 – 189 .
   Web of Science ®Google Scholar
• Kortanek , K.O , Xu , X and Ye , Y . 1996 . An infeasible interior-point algorithm for solving primal and dual geometric programs . Math. Programming , 76 : 155 – 181 .
   Web of Science ®Google Scholar
• Lootsma , F.A . 1970 . Boundary properties of penalty functions for constrained minimization . Philips Res. Kept. Suppl , 3
   Google Scholar
• Mizuno , S , Jaffe , F and Stoer , J . 1996 . A unified approach to infeasible-interior-point algorithms via geometric linear complementarity problems . Appl. Math. Optimization , 33 : 315 – 341 .
   Google Scholar
• Nesterov , Yu . 1997 . Interior point methods: An old and new approach to nonlinear programming . Math. Programming , 79 : 285 – 297 .
   Web of Science ®Google Scholar
• Nesterov , Yu and Nemirovskii , A . 1994 . “ Interior-point polynomial algorithms in convex programming ” . In SIAM Studies in Appl. Math Philadelphia
   Google Scholar
• Sonnevend , G and Stoer , J . 1990 . Global ellipsoidal approximations and homotopy methods for solving convex analytic programs . Appl. Math. Optimization , 21 : 139 – 165 .
   Google Scholar
• Wright , S.J . August 1997 . On the convergence of the Newton/Log-barrier method , August , Argonne National Lab . Preprint ANL/MCS-P681-0897, MCS Division
   Google Scholar