Skip to main content
Log in

Upper Subderivatives and Generalized Gradients of the Marginal Function of a Non-Lipschitzian Program

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We obtain an upper bound for the upper subderivative of the marginal function of an abstract parametric optimization problem when the objective function is lower semicontinuous. Moreover, we apply the result to a nonlinear program with right-hand side perturbations. As a result, we obtain an upper bound for the upper subderivative of the marginal function of a nonlinear program with right-hand side perturbations, which is expressed in “dual form” in terms of appropriate Lagrange multipliers. Finally, we present conditions which imply that the marginal function is locally Lipschitzian.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.–P. Aubin and H. Frankowska, Set–Valued Analysis (Birkhäuser Boston, Cambridge, MA, 1990).

    Google Scholar 

  2. A. Auslender, Differentiable stability in non–convex and non–differentiable programming, Math. Programming Study 10 (1979) 29–41.

    Google Scholar 

  3. J.M. Borwein, Stability and regular points of inequality systems, J. Optim. Theory Appl. 48 (1986) 9–52.

    Google Scholar 

  4. J.M. Borwein and Q.J. Zhu, A survey of subdifferential calculus with applications, Nonlinear Anal. 38 (1999) 687–773.

    Google Scholar 

  5. F.H. Clarke, Optimization and Nonsmooth Analysis (Wiley, New York, 1983).

    Google Scholar 

  6. F.H. Clarke, Methods of Dynamic and Nonsmooth Optimization (SIAM, Philadelphia, 1989).

    Google Scholar 

  7. J.–B. Hiriart–Urruty, Gradients generalises de functions marginales, SIAMJ. Control Optim. 16 (1978) 301–316.

    Google Scholar 

  8. D.V. Luu, On the Rockafellar derivative of marginal functions and applications, Acta Mathematica Vietnamica 18 (1993) 225–236.

    Google Scholar 

  9. B.S. Mordukhovich, Sensitivity analysis in nonsmooth optimization, in: Theoretical Aspects of Industrial Design, eds. D.A. Field and V. Komkov (SIAM, Philadelphia, 1992) pp. 32–46.

    Google Scholar 

  10. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  11. R.T. Rockafellar, Extensions of subgradient calculus with applications to optimization, Nonlinear Anal. 9 (1985) 665–698.

    Google Scholar 

  12. R.T. Rockafellar, Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming, Math. Prog. Study 17 (1982) 28–66.

    Google Scholar 

  13. R.T. Rockafellar, The Theory of Subgradients and its Applications to Problems of Optimization: Convex and Nonconvex Functions (Heldermann, Berlin, 1981).

    Google Scholar 

  14. D.E. Ward, A chain rule for parabolic second–order epiderivatives, Optimization 28 (1994) 223–236.

    Google Scholar 

  15. D.E. Ward, Differential stability in non–Lipschitzian optimization, J. Optim. Theory Appl., 73 (1992) 101–120.

    Google Scholar 

  16. D.E. Ward, Dini derivatives of the marginal function of a non–Lipschitzian program, SIAM J. Optimization 6 (1996) 198–211.

    Google Scholar 

  17. D.E. Ward, Epiderivatives of the marginal function in nonsmooth parametric optimization, Optimization 31 (1994) 47–61.

    Google Scholar 

  18. D.E. Ward and J.M. Borwein, Nonsmooth calculus in finite dimensions, SIAM J. Control Optim. 25 (1987) 1312–1340.

    Google Scholar 

  19. C. Zalinescu, On convex sets in general position, Linear Algebra Appl. 64 (1985) 191–198.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ward, D., Lee, G. Upper Subderivatives and Generalized Gradients of the Marginal Function of a Non-Lipschitzian Program. Annals of Operations Research 101, 299–312 (2001). https://doi.org/10.1023/A:1010953431290

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010953431290

Navigation