Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers

References

• Bonnans J. F., Dolecki S. Local study of Newton-type algorithms for constrained problems. Lecture Notes in Mathematics (1989) (Springer, Berlin) 13–241405Google Scholar
• Bonnans J. F. Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Appl. Math. Optim. (1994) 29:161–186Crossref, Google Scholar
• Facchinei F., Fischer A., Kanzow C. Regularity properties of a new equation reformulation of variational inequalities. SIAM J. Optim. (1998a) 8:850–869Crossref, Google Scholar
• Facchinei F., Fischer A., Kanzow C. On the accurate identification of active constraints. SIAM J. Optim. (1998b) 9:14–32Crossref, Google Scholar
• Facchinei F., Lucidi S. Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems. J. Optim. Theory Appl. (1995) 85:265–289Crossref, Google Scholar
• Fischer A. A special Newton-type optimization method. Optimization (1992) 24:269–284Crossref, Google Scholar
• Hager W. W. Stabilized sequential quadratic programming. (1997) . Technical report, Department of Mathematics, University of Florida, Gainesville (revised 1998)Google Scholar
• Hager W. W., Gowda M. S. Stability in the presence of degeneracy and error estimation. (1997) . Technical report, Department of Mathematics, University of Florida, Gainesville (revised 1997)Google Scholar
• Harker P. T., Pang J.-S. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Math. Programming (1990) 48:161–220Crossref, Google Scholar
• Janin R. Directional derivative of the marginal function in nonlinear programming. Math. Programming Stud. (1984) 21:110–126Crossref, Google Scholar
• Josephy N. H. Newton's method for generalized equations. (1979) . Technical summary report no 1965, Mathematical Research Center, University of Wisconsin-MadisonGoogle Scholar
• Levitin E. S., Polyak B. T. Constrained minimization methods. Zh. Vychisl. Mat. i Mat. Fiz. (1966) 6:787–823Translated in: Comput. Math. Math. Phys. 6 1–50Google Scholar
• Panier E. R., Tits A. L. On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Math. Programming (1993) 59:261–276Crossref, Google Scholar
• Pang J.-S. Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results. Math. Programming (1993) 58:149–160Crossref, Google Scholar
• Pshenitchny B. N. Newton's method for the solution of a system of equations and inequalities. Mat. Zametki (1970) 8:635–640Google Scholar
• Pshenitchny B. N., Danilin Ju. M.Numerische Methoden für Extremalaufgaben (1982) (Deutscher Verlag der Wissenschaften, Berlin) Google Scholar
• Qi L., Wei Z. On the constant positive linear dependence condition and its application to an SQP method. (1997) . Technical report, School of Mathematics, The University of New South Wales, Sydney (revised 1998)Google Scholar
• Ralph D., Wright S. J., Ferris M. C., Pang J.-S. Superlinear convergence of an interior-point method for monotone variational inequalities. Complementarity and Variational Problems: State of the Art (1997) (SIAM, Philadelphia) 345–385Google Scholar
• Ralph D., Wright S. J. Superlinear convergence of an interior-point method despite dependent constraints. (1996) . Preprint MCS-P622-1196, Mathematics and Computer Science Division, Argonne National Laboratory, ArgonneGoogle Scholar
• Robinson S. M. Extension of Newton's method to nonlinear functions with values in a cone. Numer. Math. (1972) 19:341–347Crossref, Google Scholar
• Robinson S. M. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms. Math. Programming (1974) 7:1–16Crossref, Google Scholar
• Robinson S. M. Strongly regular generalized equations. Math. Oper. Res. (1980) 5:43–62Link, Google Scholar
• Robinson S. M. Some continuity properties of polyhedral multifunctions. Math. Programming Stud. (1981) 14:206–214Crossref, Google Scholar
• Robinson S. M. Generalized equations and their solutions, Part II: Applications to nonlinear programming. Math. Programming Stud. (1982) 19:200–221Crossref, Google Scholar
• Vetters K. Quadratische Approximationsmethoden zur konvexen Optimierung. Z. Angew. Math. Mech. (1970) 50:479–484Crossref, Google Scholar
• Wilson R. B. A simplicial algorithm for concave programming. (1963) . Ph.D. thesis, Graduate School of Business Administration, Harvard University, Cambridge, MAGoogle Scholar
• Wright S. J. Superlinear convergence of a stabilized SQP method to a degenerate solution. Comput. Optim. Appl. (1998) 11:253–275Crossref, Google Scholar
• Wright S. J. Modifying SQP for degenerate problems. (1997) . Preprint MCS-P699-1097, Mathematics and Computer Science Division, Argonne National Laboratory, ArgonneGoogle Scholar