Skip to main content
SpringerLink
Log in

A new dual problem for nondifferentiable convex programming

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

This paper gives a new dual problem for nondifferentiable convex programming and proves the properties of weak duality and strong duality and offers a necessary and sufficient condition of strong duality.

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

Similar content being viewed by others

References

  1. Avriel, M., Nonlinear Programming Analysis and Methods, Prentice Hall, Englewood Cliffs, N. J., 1976.

    MATH  Google Scholar 

  2. Bank, B., Guddat, J., Klatte, D., Kummer, B., and Tammer, K., Non-Linear Parametric Optimization, Birkhauser Verlag, Basel, 1983.

    MATH  Google Scholar 

  3. Ben-Israel, A., Ben-Tal, A., and Zlobec, S., Optimality in Convex Programming: A Feasible Directions Approach,Math. Prog. Study,19 (1982), 16–23.

    Article  MathSciNet  MATH  Google Scholar 

  4. Joffe, A. D., and Tihomirov, V. M., Theory of Extremal Problems, North-Holland, Amsterdam, 1979.

    Google Scholar 

  5. Li Shi-Zheng, Necessary and Sufficient Conditions for Convex Programming Satisfying Saddle Point Criterion,J. Sys. Sci. Math. Scis. (in Chinese),7(1987), 322–328.

    MATH  Google Scholar 

  6. Matein, L., Regularity Conditions for Constrained Extremum Problems.J. Optim. Theory & Appl. 47 (1985), 217–233.

    Article  MathSciNet  Google Scholar 

  7. Rockaffelar, R., Convex Analysis, Princeton Univ. Press, Second Printing, 1972.

    Google Scholar 

  8. Wolkowicz, Geometry of Optimality Conditions and Constraint Qualifications: The Convex Case,Math. Prog.,19 (1980), 32–60.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shandong Normal University, China

    Li Shizheng

Authors
  1. Li Shizheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, S. A new dual problem for nondifferentiable convex programming. Acta Mathematicae Applicatae Sinica 6, 370–372 (1990). https://doi.org/10.1007/BF02015344

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02015344

Keywords

Search

Navigation