Skip to main content
SpringerLink
Log in

Foreword: Special issue on nonlinear programming, variational inequalities, and stochastic programming

  • Preface
  • Published:
Mathematical Programming Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Dirkse S.P. and Ferris M.C. (1995). The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems. Optim. Methods Softw. 5: 123–156

    Article  Google Scholar 

  2. Facchinei F. and Pang J. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, Heidelberg

    Google Scholar 

  3. Gürkan G., Özge A.Y. and Robinson S.M. (1999). Sample-path solution of stochastic variational inequalities. Math. Program. 84: 313–333

    Article  MathSciNet  MATH  Google Scholar 

  4. Josephy N.H. (1979). Newton’s method for generalized equations and the PIES energy model. University of Wisconsin, Madison, Ph.D. thesis

    Google Scholar 

  5. Murtagh B.A. and Saunders M.A. (1982). A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. Math. Program. Study 16: 84–117

    MathSciNet  MATH  Google Scholar 

  6. Plambeck E.L., Fu B.R., Robinson S.M. and Suri R. (1996). Sample-path optimization of convex stochastic performance functions. Math. Program. 75: 137–176

    MathSciNet  Google Scholar 

  7. Qi L. and Sun J. (1993). A nonsmooth version of Newton’s method. Math. Program. 58: 353–367

    Article  MathSciNet  Google Scholar 

  8. Ralph D. (1994). Global convergence of Newton’s method for nonsmooth equations, via the path search. Math. Oper. Res. 19: 352–389

    MathSciNet  MATH  Google Scholar 

  9. Robinson S.M. (1972). Extension of Newton’s method to nonlinear functions with values in a cone. Numer. Math. 19: 341–347

    Article  MathSciNet  MATH  Google Scholar 

  10. Robinson S.M. (1972). Normed convex processes. Trans. Am. Math. Soc. 174: 127–140

    Article  Google Scholar 

  11. Robinson S.M. (1972). A quadratically-convergent algorithm for general nonlinear programming problems. Math. Program. 3: 145–156

    Article  MATH  Google Scholar 

  12. Robinson S.M. (1974). Perturbed Kuhn–Tucker points and rates of convergence for a class of nonlinear-programming algorithms. Math. Program. 7: 1–16

    Article  MATH  Google Scholar 

  13. Robinson S.M. (1975). An application of error bounds for convex programming in a linear space. SIAM J. Control Optim. 13: 271–273

    Article  MATH  Google Scholar 

  14. Robinson S.M. (1976). Regularity and stability for convex multivalued functions. Math. Oper. Res. 1: 130–143

    MathSciNet  MATH  Google Scholar 

  15. Robinson S.M. (1976). Stability theory for systems of inequalities. Part II: differentiable nonlinear systems. SIAM J. Numer. Anal. 13: 497–513

    Article  MathSciNet  MATH  Google Scholar 

  16. Robinson S.M. (1977). A characterization of stability in linear programming. Oper. Res. 25(3): 435–447

    MATH  Google Scholar 

  17. Robinson S.M. (1979). Generalized equations and their solutions. Part I: basic theory. Math. Program. Stud. 10: 128–141

    MATH  Google Scholar 

  18. Robinson S.M. (1980). Strongly regular generalized equations. Math. Oper. Res. 11: 43–62

    Article  Google Scholar 

  19. Robinson S.M. (1982). Generalized equations and their solutions. Part II: applications to nonlinear programming. Math. Program. Stud. 19: 200–221

    MATH  Google Scholar 

  20. Robinson S.M. (1991). An implicit-function theorem for a class of nonsmooth functions. Math. Oper. Res. 16: 292–309

    MathSciNet  MATH  Google Scholar 

  21. Robinson S.M. (1992). Normal maps induced by linear transformations. Math. Oper. Res. 17: 691–714

    MathSciNet  MATH  Google Scholar 

  22. Robinson S.M. (1994). Newton’s method for a class of nonsmooth functions. Set Valued Anal. 2: 291–305

    Article  MathSciNet  MATH  Google Scholar 

  23. Robinson S.M. (1996). Analysis of sample-path optimization. Math. Oper. Res. 21: 513–528

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, USA

    Jong-Shi Pangc

  2. Judge Business School, University of Cambridge, Cambridge, UK

    Daniel Ralph

Authors
  1. Jong-Shi Pangc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Ralph
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel Ralph.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pangc, JS., Ralph, D. Foreword: Special issue on nonlinear programming, variational inequalities, and stochastic programming. Math. Program. 117, 1–4 (2009). https://doi.org/10.1007/s10107-007-0169-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0169-6

Keywords

Search

Navigation